Need help in solving the following Codechef problem :
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Need help in solving the following Codechef problem :
Name |
---|
Auto comment: topic has been updated by yesnomaybe (previous revision, new revision, compare).
Auto comment: topic has been updated by yesnomaybe (previous revision, new revision, compare).
You can interpret the tasks as nodes in a graph. There is a directed edge (because of the index restriction) $$$v \rightarrow u$$$ if $$$u$$$ can be completed immediately after $$$v$$$. Since there are $$$10^3$$$ tasks, the maximum number of edges is around $$$10^6$$$, which is fine.
The problem can be understood as "choosing the minimum number of directed paths such that you visit each vertex exactly once". I have seen this problem here and the only editorial I know of is this YouTube video.