We will hold AtCoder Regular Contest 193 (Div. 1).
- Contest URL: https://atcoder.jp/contests/arc193
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20250223T2100&p1=248
- Duration: 150 minutes
- Number of Tasks: 4
- Writer: leaf1415
- Tester: Nyaan, maspy
- Rated range: 1600 ~ 2799
The point values will be 700-800-1000-1000.
We are looking forward to your participation!
Will every future ARC Div.1 be extended by half an hour?
I plan to do so.
Excellent! There are 30 more minutes for us to solve the problems. Wish everyone a good play!
Auto comment: topic has been updated by atcoder_official (previous revision, new revision, compare).
Be careful of ARC AGC-ization!
Fewer but tougher problems is a much better contest format. Would be better if ABC and ARC div. 2 followed in the same direction and converged to 3-4 problem contests. Quality over quantity.
Problem C can be easily solved using two-variable polynomials and NTT, but I didn't have the code template for it so I wasted a lot of time trying to come up with an $$$O(n^3)$$$ solution.
In the editorial for problem A, it mentions:
b[i]:= Lv≥i max Wshouldn't this be min as well? am I missing something?
I was confused about that part too. I got AC by setting $$$b[i] := \min_{L_v \geq i} W_v$$$, so it seems to be an error in the editorial.
Here's my submission (AC): https://atcoder.jp/contests/arc193/submissions/63105370
What is the dp transition for B on earth? Don’t quite understand the editorial.
Good contest