We will hold AtCoder Regular Contest 195 (Div. 2).
- Contest URL: https://atcoder.jp/contests/arc195
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20250323T2100&p1=248
- Duration: 120 minutes
- Number of Tasks: 5
- Writer: tokusakurai
- Tester: Nyaan, maspy
- Rated range: 1200 ~ 2399
The point values will be 400-500-600-700-900.
We are looking forward to your participation!
What's the point of problem C??? Nothing but useless coding and debuging...
Can anyone tell me how to solve prob D?
Hate the constraints in problem B,O(n*n log(n)) keeps getting TLE,no thinking only optimization.
For ordered set and map it is giving tle and for unordered map and set it was passing in 3 s, how it is possible?
You can use hash map to get an $$$O(n^2)$$$ solution. (just close to $$$n^2$$$)
But I passed by ordered map in 3s :)
I know,but passing some O(n*n*logn) while TLE others is the main issue for me.
Why I got WA on D with greedy?
Submission
Thanks a lot if anybody can give me an small hack. QwQ
should be 5
Thanks a lot, fixed but still WA.
new one
more one case is correct :)
A new stronger hack
D can't use greedy, sad :(
In the official editorial of problem C,
This conclusion is wrong. Actually it should be " $$$r_i$$$ has different parity with $$$r_{i+1}$$$ "
Thank you. I've informed the writer, so I think it will be corrected.
Can we have the gcc version updated to 14.2.0?
https://atcoder.jp/contests/arc195/submissions/64147881
A test case for D:
should be 7.