We will hold AtCoder Beginner Contest 466.
- Contest URL: https://atcoder.jp/contests/abc466
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20260711T2100&p1=248
- Duration: 100 minutes
- Writer: math957963, cn449, sounansya
- Tester: kyopro_friends, harurun4635, sheyasutaka
- Rated range: ~ 1999
- The point values: 100-200-300-400-450-500-600
We are looking forward to your participation!
I hope I can solve A to D.
I've never solved for four problems before.
Me too.
Me too, but I managed it in this contest. It’s the first time I’ve solved problems A through D.
Good luck!!! ( ^ o ^ )
I hope I can solve A to D.
Let's try my best!
Hope I can solve E as usuall.
https://leetcode.com/u/Chaitanya_Agarwal87/ what are the things I should do and resources I should follow to become div2 or 3 ? this is the first time I'll be solving live on atcoder so what can do to become eligible for regular contests on atcoder and codeforces.
I will solve A B C and perhaps D
i hope i can solve problem A to D :)
I am able to solve A and B only
I hope I can solve C
I ended up writing a checker for problem C in Python and repeating
./abc466_c < /tmp/pipe | python3 abc466_c_checker.py > /tmp/pipeWOW!C is a interactive problem. It is the first!
“It was fun. I solved Problem A using the XX method,” “Problem A resulted in TLE,” and “Problem A was easy once you noticed something” all mention a problem, so they must not be posted during the contest.
i was able to solve only A and B and got TLE in F
It was a graet contest ATcoder on TOP
Who can solve F?
F is easy to TLE this dfs looks right but TLE I only solved A to E.And 47minutes+3*5minutes
i writed code like this before and got 1 TLE . You can binsearch in your line 11
Only two cases?
I hope I can solve F(I can slove A~E)
I ate 4 penalties and who can solve E
sob
What a pity that I've already done F before after one simulated contest, but I forget now.
It’s the first time I’ve solved problems A through E.Lucky me!
ban xzy404 pls
In problem G,
3 1 1 2 998244354
something like this is annoying.......
best contest i writed yet in atcoder
PAIN
which problem though
F
If it's me,I will hit the keyboard. And……
G is similar to UOJ813.
bro A-E is too easy
How to solve E ? I was only able to solve A — D.
I was only able to conclude that intervals should be dis-jointIn fact, if $$$a \lt b \lt c \lt d$$$, flipping $$$[a, c), [b, d)$$$ is equivalent to flipping $$$[a, b), [c, d)$$$. So this problem can be seen as flipping disjoint intervals.
Yeah I understood that but I was blank what to do next.
You can Apply Kadane's algorithm k times of the list of differences.
dp
For C, you have to cout<<endl after you output the answer, even if your program will exit immediately. I wasted about 30 minutes
Problem F was awesome!