#  User  Rating 

1  tourist  3869 
2  Benq  3618 
3  Miracle03  3452 
4  peehs_moorhsum  3429 
5  Radewoosh  3417 
6  Petr  3408 
7  maroonrk  3386 
8  ko_osaga  3339 
9  sunset  3338 
10  jiangly  3333 
#  User  Contrib. 

1  YouKn0wWho  214 
2  1gon  204 
3  Um_nik  195 
4  Errichto  182 
5  awoo  180 
6  sus  176 
6  tourist  176 
8  antontrygubO_o  172 
9  isthisfft  169 
10  maroonrk  167 
On
insane_banda →
Two almost same solution in java one gets AC and another one gets TLE??, 7 weeks ago
0
It's because of Arrays.sort which can run in quadratic time for some inputs. 
+9
"Just asking for sake of knowledge." Ok bro why not post on your main account then? 
+10
RIP sleep schedule. Gotta get up at 5am for this contest. 
39
Probably because you are too smart and have never made a mistake in your code before. 
0
I've never heard of this before, but it sounds interesting. Thanks for your feedback! 
+33
Wow, that was quick. 
+2

+26
I disagree. In my opinion, E was not very easy; it is just that there are many very similar problems across the internet, so most people would not be solving it for the first time. For an actual "beginner" who has never seen a similar problem before, I would argue it could be quite challenging. Furthermore, F was not substantially harder than E in my opinion it is just that everyone has seen a similar problem to E before, but not necessarily F. I think the difficulty curve was appropriate for a beginner contest. 
+3
I think its your computer; I clicked on his profile and everything was normal. 
0
I see, thanks! 
0
XOR M and N. The answer is the number of one bits in this value. 
+9
If you don't understand the editorial, I think that it is a good sign that the problem is too hard and you should return to it later. Solving problems out of your comfort zone is good, but if it is so hard that you can't even understand the solution when given it, then you are probably just wasting your time. 
+11
Where was that picture taken? 
0
Just my opinion, but most new releases, for any language, have very minimal impact on competitive programming. So it doesn't really matter if it's added to cf or not. 
+29
One of my favorite ways to approach any problem I have no clue about is to write a naïve (maybe even exponential) solution. I run this solution on a bunch of small inputs and this way I can see if there are any patterns that might lead to a full solution. I feel like this applies especially well to constructive and greedy problems, but it is also pretty useful for DP as well. 
+19
I agree; this format is very fun! This is the first contest I've done where it doesn't put me at a disadvantage to use Java. 
+79
Sounds like your problem, not the contest's. I found the questions to be enjoyable and the process went very smoothly. I am quite sure this is the case for many others as well. 
+30
Join the club bro. Literally everyone has been downvoted before its not a big deal. 
0
I don't know of any, and there probably aren't any since grading math contests takes far more work than the online judges used in cp. I'm in high school so my main competitions are just AMC, COMC, and some smaller regional ones and all my practice is offline (downloading problemsets and solving them, then comparing with the answers). 
0
If you want to improve your math skills, maybe try some math contests. They can be just as fun and rewarding as competitive programming, and there are tons of good contests and resources which you can access online. Many competitive programmers (including myself) come from a competitive math background before moving on to cp. 
66
Spoiler 
+56
I am all of the above. 
+1
I believe you are referring to this problem: https://dmoj.ca/problem/coci14c2p6 
0
Normally, I would try something like that, but it seems quite difficult (maybe even impossible) in this case because of two issues:
That being said, there may be ways to optimize my naive BFS/DFS approach since a lot of the N^2 edges will be redundant. 
+1
This is a very interesting problem. I believe I know of a solution, but it depends on how large the constraint for N is. This solution should run O(N^2). First we build a graph on the circles, there is an edge between two circles if they intersect (the distance between their centers is no more than the sum of their radii). Now we perform BFS/DFS on the circles. If we are able to connect the top of the rectangle to the bottom of the rectangle or top to left or left to right or bottom to right, then the answer should be false. Otherwise the answer is true. 
+4
While I agree that OOP isn't too relevant to cp, I have seen a lot of cf blogs that are way less useful/productive than this one. 
0
I think I know a decent problem with an editorial (its not on cf though). 
+3
Are you sure you have correctly understood and restated the problem statement? First of all for a case such as: n = 3, a = [1, 2, 1] it seems that there is no solution. Even assuming 1 (or something similar) is printed in these cases, any solution would still be O(n^2) since this problem is quite similar to bubble sort. This would TLE most of the time for n <= 1e5. 
+19
I'm finally able to solve 6 problems in ABC, but now there are 8 total :( Also, now that ABCs are substantially harder than before, maybe the rated range should also increase? 
0
Got it, thanks! 
0
If you don't mind, could you please elaborate on your statement: "if the total length of strings is limited with L, the number of different lengths among strings ≤√2L." I'm not sure what is meant by this. 
0
This is actually very interesting to me. I wonder why it is that many coders can get very far into their competitive programming journeys and not really use or learn string algorithms. I myself am an example of this, I have been doing cp for over a year now and have not really touched any string algorithms. Its not that string algorithms aren’t useful, I have seen them in plenty of problems and contests, but I just never bothered to learn them for some reason. From what I have observed of other coders, this is true for a decent amount of them as well. 
0
I see. Thanks again! 
0
Thank you for the advice! Is there any particular order I should learn these (in terms of importance/usefulness, but also in terms of difficulty/prerequisites)? 
+4
Considering that there are thousands of c++ solves I don't think that c++ is the issue... 
0
One way to do this problem would be using coordinate compression + a segment tree. First, compress all of the coordinates to the range [1, n]. Then iterate left to right, while maintaining a minimum segment tree over a function f, where f(x) = min index with value x. At each index i, the answer is i — min(f(1), f(2), ..., f(i)) which can be queried from the segment tree. All f(i) should be initialized to infinite and values should be updated as they come in. 
0
Can some please link the problem (or another problem with same idea)? It sounds interesting so I want to give it a shot. 
Name 
