Related questions

Please note: the language of this site will now be ENGLISH. Please do not use another language since visitors from different countries will participate in training.

Most popular tags

misc graph dynamic-programming graphs uva greedy lazarus convex-hull geometry divide-and-conquer combinatorics suffix-trie string maximum-flow path shortest warm-up judge backtracking

Week 7 - Graphs (3)

The tasks for week 7 are as follows:

Week problem: 11631 Dark Roads
Weekend problem: 10048 Audiophobia
Suggested bonus: 10600 ACM Contest and Blackout

Read up on minimum spanning trees.

You must submit your solutions on http://uva.onlinejudge.org/

You can browse to these problems from the online judge website by clicking on Browse Problems, Contest Volumes, and then selecting the contest volume as indicated above.

asked Jul 15, 2012 in Tasks by eljakimit
edited Aug 9, 2012 by eljakimit

Please post below which of the questions you have been able to finish.

For each task, please let us know how much time you have spent on understanding / coding / debugging.

For each task let us know what the hardest part was. (This can be anything, ranging from not having read the problem to forgetting about a border case, to a semicolon in the wrong spot that screwed up an if-statement...)

commented Jul 15, 2012 by eljakimit

Please log in or register to answer this question.

Powered by Question2Answer
NL: NIO UK: BIO Int: IOI
...