We will hold AtCoder Regular Contest 206 (Div. 2).
- Contest URL: https://atcoder.jp/contests/arc206
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20250921T2100&p1=248
- Duration: 120 minutes
- Number of Tasks: 5
- Writer: nok0
- Tester: physics0523, maspy
- Rated range: 1200 ~ 2399
The point values will be 400-500-600-700-800.
We are looking forward to your participation!
Auto comment: topic has been updated by atcoder_official (previous revision, new revision, compare).
Samples for D are too weak.
Why the sum of the min and second min of each edge can't get AC on E?
Is this solution bigger than the answer or smaller?
can anybody give me an hack?
counter test for E:
Got it. Thank you.
Smaller I guess
ngl, E scammed me hard
Enjoyed the contest. Found it a bit on the easier side. Enjoyed D up until the part I had to brute force for k == 0 and k == 1.
B have to be done by LIS but i wrote a code where I was counting inversion ofcourse it was wrong.But can you suggest me a test case where this code was failing as I couldn't find one. https://atcoder.jp/contests/arc206/submissions/69778555
C was an amazing problem. It was awesome to see the $$$O(N^3)$$$ DP solution reduce to $$$O(N)$$$. The final implementation was very simple too, loved it.
Can you please Explain your solution? This was my solution and I don't know what was wrong with it :( Code
n=1 corner case
In the editorial of E,
I believe it's when $$$u2 + 1 \lt d1$$$ and $$$r2 + 1 \lt l1$$$ or when $$$d2 + 1 \lt u1$$$ and $$$l2 + 1 \lt r1$$$. Can you fix it?
I fixed it, thank you!
How to write checker for D?
You can refer to the brute function of my submission.
https://atcoder.jp/contests/arc206/submissions/69537460