We will hold AtCoder Regular Contest 181.
- Contest URL: https://atcoder.jp/contests/arc181
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20240804T2100&p1=248
- Duration: 120 minutes
- Number of Tasks: 6
- Writer: chinerist
- Tester: maspy, sigma425
- Rated range: — 2799
The point values will be 300-600-600-700-1000-1100.
We are looking forward to your participation!
Hoping for the best ARC Round!
Hope for a good ARC!
I'm hoping for a good ARC, but I cannot participate cuz I will participate in Codeforces Round 963 (Div. 2) in the same day.
they don't intersect tho
I can't participate in both AtCOder and Codeforces due to skill issue, I think I need sleep.
This is my first time participating in ARC, could you tell me how ARC questions are generally rated on codeforces? Thank you.
In my opinion, ARC has some first problems that you could encounter in codeforces div2, but the difficulty curve for the problems is pretty steep and the last few problems are hard. So ARC is somewhat between a codeforces div1 and div2 (div1.5), but more leaning to the div1 side.
Thanks a lot!
My first time to participating in ARC,exciting!
how was it ?
Too bad None AC I am new code boy
I am only a thirteen-year-old-Chinese-boy
I need English!
is it with evryone
yeah i guess, i am seeing either chinese or english
is anyone able to see problems in English?
Could you offer us English Problem?
Missed D for 30 seconds... https://atcoder.jp/contests/arc181/submissions/56359770 spent the last 10 minutes trying to find a segment tree beats code and making it work
Who cares ?
D is nice problem
For problem B, I think the proof of the necessity part is very hard. Would anyone like to share your ideas about this ? Thanks a lot.
I solved the problem B, but I guess, my solution should not have passed.
https://atcoder.jp/contests/arc181/submissions/56359242
I passed 108 test cases, and couldn't pass one single test case. Then I did bruteforce my way out of it. Refer to line 367 to 376 in the above solution link.
Please fail my solution, and others as well, who used bruteforce, and give points to only those who deserve.
cc: chinerist maspy sigma425
If tests were weak, failing some solutions in-contest retroactively by adding countertests is worse than accepting that the tests weren't good enough to prevent them from passing. As long as you didn't break any rules during your submit attempts, you solved the problem.
Thank you for your report. If we determine that adding test cases would be beneficial for those studying the problem after the contest, we may add additional test cases. In such cases, names like after_contest_01.txt will be used. However, even in this case, we will not perform a rejudge or change the contest results.