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!
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/25/2026 14:29:13 (g2).
Desktop version, switch to mobile version.
Supported by
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