We will hold UNIQUE VISION Programming Contest 2024 Autumn (AtCoder Beginner Contest 372).
- Contest URL: https://atcoder.jp/contests/abc372
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20240921T2100&p1=248
- Duration: 100 minutes
- Writer: toam, sounansya, chokudai
- Tester: Nyaan, math957963
- Rated range: ~ 1999
- The point values: 100-200-350-400-475-525-625
We are looking forward to your participation!
Anyone else feel it is much harder to gain rating in ABC 372? F is not an easy problem and over 800+ participants pass?
It's 581, not 800+, default standings include non-rated participants too. Seems fine for F + if you get the idea it's pretty easy to implement.
Hey can anyone explain how to solve problem F.
https://atcoder.jp/contests/abc372/editorial
hey thanks but I wasn't able to understand it completely.
I understand that dp[i][v] can be computed from dp[i-1][v-1], where i is the number of moves and v is the vertex but what about the other m edges and how to compute it efficiently.
M is rather small, you can straight up calculate dp on top of small subgraph where vertices are only ones that are present in M edges.