Can anyone please give me some idea about this USACO problem? DELIVER — Delivery Route
Here is the editorial of the problem but I could not understand why 5N nodes are required.
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Can anyone please give me some idea about this USACO problem? DELIVER — Delivery Route
Here is the editorial of the problem but I could not understand why 5N nodes are required.
Name |
---|
because you have to build 4n points (up, down, left and right) and themselves, 5n in total.
But why it is enough to consider only the right-angled paths?