AtCoder Beginner Contest 061 will be held.
Time: May 13th (Saturday), 21:00 JST
Duration: 100 minutes
Number of Tasks: 4
writer: Hec
Rating: 0-1199
The point values are: 100 — 200 — 300 — 400
We are looking forward to your participation!
# | 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 | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
AtCoder Beginner Contest 061 will be held.
Time: May 13th (Saturday), 21:00 JST
Duration: 100 minutes
Number of Tasks: 4
writer: Hec
Rating: 0-1199
The point values are: 100 — 200 — 300 — 400
We are looking forward to your participation!
Name |
---|
Please inform me about the contest's difficulty. Is it suitable for div. 2 ?
How to solve D ?
My idea was to make all the weights negative, and then apply Bellman Ford. If there was any negative cycle the answer would be "inf", else "-1 * dist[N]".
However, i got WA on the last 3 cases. Any help where am i wrong?
Anybody can share accepted code of D?
Yes
In the case that the negative cycle is not found on the path from 1 to N, then the answer should not be inf. For example the answer to the following case should be 1, not inf. 5 5 1 2 1 2 3 1 3 4 1 4 2 1 1 5 1