We will hold UNIQUE VISION Programming Contest 2026 Summer (AtCoder Regular Contest 226).
- Contest URL: https://atcoder.jp/contests/arc226
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20260809T2100&p1=248
- Duration: 120 minutes
- Writer: snuke
- Tester: Nyaan, maspy
- Rated range: 1200 ~ 2799
- Point Values: 400-500-700-800-1000
We are looking forward to your participation!
Reading the statement of E is a kind of cruel torture for everyone I think, including native English/Japanese speakers. It's AHC-like.
In fact, more painful than AHC problems because of the numerous constraints.
Attention Is All You Need
I got AB and-40.The C is so trash that dfs+empty,and I don't want to dfs and fucked.
You are right
For D, if we had infinite queues, then are there any asymptotic bounds for the total moves? I think it's nlogn but that's just a guess for the lower bound, since we can potentially sort the elements using it and each comparision mostly leads to a move.
More on this, the nlogn bound is achievable, you can simulate a merge sort using logn queues.ig you can also approximately proof it by keeping a exponentail threshold for making elements go from one queue to another.
Why the hell was my first ARC contest such garbage?!
When I saw the "Visualizer" on the browser page of problem E, I doubt if I accidentally went the AHC
Although the problem E is crazy, I think it's really a fun problem.