We will hold AtCoder Beginner Contest 483.
- Contest URL: https://atcoder.jp/contests/abc483
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20261107T2100&p1=248
- Duration: 100 minutes
- Writer: math957963, sounansya
- Tester: sheyasutaka, cn449
- Rated range: ~ 1999
- The point values: 100-200-300-400-450-500-575
We are looking forward to your participation!








Good luck!
What an easy round! G is lower than 600 points.
2
I hope I can solve A ~ F. Good luck!
how many u solved?
A ~ E
I don't know why can't I solve F. I felt like I was a fool when I knew the solution.
u could solve e then how are u still pupil in cf , shouldnt u be higher , just curious to know , nothing personal
I occasionally participate in CF contest. If I want to participate in contests from other countries, then I will choose AT instead because AT has a certain contest (ABC) which is held on Saturdays.
yummy abc
I hope I can solve ABCDE.
Editorial when?
now
trash contest? only abcd,eis hash? Ithink my code is O(200000*6*log(30000000)*26)around6*10^8??but tle?look!
I replaced map by unordered_map and then passed.
same... I really thought that I'm gonna end the contest by just solved A-C (for whatever dumb reason I can't really solve D 😅)
there like 5 mins before it end and I'm be like wait ? does unordered_map work for string?(I never tried it before and always assume that it only work when the key is int/ll) then BOOM the whole thing compiled then I re-submit then it passed such a silly moment...
Dude, it is 7.8 * 10^8
(in case you have a log)
BNDSer orz
I even can't solve T3...
【Sob】I’ve finally met a peer at my level… though we both still have a long way to go.
T3 is harder than before ,It take me 20min,and Igot 2 penalty time.
I will remember for the rest of my life that unordered map also work for other primitive data type than integer and to use it whenever possible on atcoder because it's been few times now that I got fkc over because of not using it, I will also remember that this is not codeforces and I should not expect there to always be anti hash test. 🥀🥀🥀 all this flower for all those who have fallen because of it including me.
What a pity. But I think it is good to think about how to avoid being hacked by anti-hash test cases because if there are also some other ways to solve some problems in the passed contests (maybe not especially in this one), which the participants mainly think that it is a hash problem, then why it is not designed to hack hashes?
true, codeforces got me all paranoid whenever I'm using unordered_map but many damn time I swear young brother when I check editorial on atcoder(~2 times already) and it mention thing like "which can be done by unordered map since there are only around 10 test-cases" and make it intended... anyway congrat for solving A-E 🎉 I'm now officially joining those 28 weirdos who can solve E but don't know how to solve D this week 😅
E is interesting but F is too typical
G is also quiet typical
How C? I can only think of a Segment Tree solution.
in the kind of problem like these I often spam using set like one store (i, score) the other one store (score, i) both mirroring each other then spam search & erase on it, some other might did it more simple but I often don't think much and to this.
thanks
Wow!Use segment tree to solve C??Ithink it's fun.(((((
Why I think that D is much easier than C??? I even think that E is easier than C??? What about you???
didnt solve C either
Oh no!Editorial F is wrong!I submit it and it was TLE!!!
atcoder_official math957963 sounansya When will the editorial be published?