We will hold AtCoder Beginner Contest 285.
- Contest URL: https://atcoder.jp/contests/abc285
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20230115T2100&p1=248
- Duration: 100 minutes
- Number of Tasks: 8
- Writer: physics0523, kyopro_friends, yuto1115, m_99
- Tester: leaf1415, cn449
- Rated range: ~ 1999
The point values will be 100-200-300-400-500-500-600-600.
We are looking forward to your participation!
It will be good if you put the time with GMT instead of a link.
Just a kind remind, ABC is on Sunday this time, meanwhile ARC is on Saturday.
Hope I can pass ABCDEF quickly and get high performance.
Humble Request: Please postpone the round to Monday (or some other day) as there is a clash with CF R844, we want to write both the contests.
Can anyone tell me how to optimise segment tree solution in Problem F.
21 AC 3 TLE:(can you explain E?
Probably the constant of your code is too large?
can anyone explain solution of problem E
Did not think using 26 different segment trees + a lot of queries would be fast enough for F but apparently it worked.