We will hold AtCoder Beginner Contest 452.
- Contest URL: https://atcoder.jp/contests/abc452
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20260404T2100&p1=248
- Duration: 100 minutes
- Writer: sheyasutaka, MMNMM, blackyuki
- Tester: vwxyz0, Nyaan
- Rated range: ~ 1999
- The point values: 100-200-300-400-450-500-600
We are looking forward to your participation!
First comment!Hope I have a good performance.
的确
哟西
It`s very good ~
Are you a 叫破尼斯?
I really want a heatmap for atcoder like codeforces, I use atcoder just as much as I use Codeforces but don't know how many problems have I solved there
You can use this. It provides simliar functions for AtCoder.
Maybe I don't know how to properly use it yet, but its too much effort for knowing about the kind of problems to solve, had it been like an extension (like we have on codeforces) it would have been amazing.
I am just waiting for someone to make a heatmap like extension for atcoder, if not then I will definitely try making it when I will be able to.
Thanks btw!
https://kenkoooo.com/atcoder/#/user/[YourUsername]?userPageTab=Progress+Charts for heat map.
https://kenkoooo.com/atcoder/#/table/[YourUsername] for problem set.
I don't know what to say, I had opened this page a little earlier but did not bother to scroll to the bottom.
Anyway, Thanks a lot!
$$$Good luck!$$$
why this code for C -> [https://atcoder.jp/contests/abc452/submissions/74677213] giving tle?
Just store character positions in the map(wrt size), U loop through every string in mp[sz] so worst case is O(n*m*m)
yeah but why answer is "no" for len(v[i]) > n ..we can use strings more than 1 time for < n it seems logical
wasn't the first constraint is that the length of the spine must be exactly N, I miss that to initially.
I don't know how to make progress .I just can solve A,B problems in ten minutes,but I can't complete C int the rest of time.This situation has been keeping for 3 months. What should I do now?
same bro
Don't worry. C was a poorly written bad problem today. I found C > D today, just because it took so much time for me to understand the problem.
brother I solve like A-E in this contest(also on average) but this contest C also tough to me in reading comprehension and implementation aspect(I miss on many little detail and as a result I spend much more effort in debugging it this time, 3WA), also there are many time that I cannot solve D too but do fine on E, e.g. the last ABC449 & 451 I did not manage to solve D, it may be the case that I have blind spot in thinking involving to specific bruteforce implementation I don't know whatever. I think difficulty can be a bit subjective to you sometime like you gonna find some expectedly easy problem to be a bit harder to you from time to time, so don't give up brother.
I couldn't agree more! Sometimes you overthink it (like me XD)
Same here!
For problem C: To read and understand the text is so so so more difficult to code it.
Shit
so sad G=ABC446G, but i didn't do it.
They have slightly different statement, but other wise they are 2 diffferent problems, like easy and hard version
Screencast (solving A-F). https://youtu.be/XtV_EuUFF4I
During the contest, i had (and still have as of now) difficulties reaching the contest URL. I have to use 1.1.1.1 in order to access the site. Does anyone else face these issues?
Why is my O(|S|^2) solution gives AC result instead of TLE for problem D?
I check for this simple test case below on local and it runs more than 2 seconds.
S = string with length 2*10^5 only contains char 'a'
T = 'z'
Screencast — Solving all problems: https://youtu.be/d-WHxeL5uco