# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
+297
Does CF allow someone who cheated (https://codeforces.com/blog/entry/120675) and never showed remorse for his actions to author contests? What I want is not that he shouldn't author contests ever, what I want is for him to apologize publicly and say that what he did was wrong, and maybe return the 2 TON he got from cheating. |
+252
he's completing school years in reverse order — won't graduate until 1st grade |
+117
|
+102
1933 != 2200 |
+95
Ok cheater |
+81
So you mean you've also violated codeforces rules and have another account right? |
+79
China's team:
Good luck to them! |
+73
meanwhile you are just a troll with no life |
+70
I feel bad that qwerasdfzxcl didn't make it. |
+68
dramaforces |
+68
The perception among the top contestants is generally that using alts is not a bad thing, and I kind of agree with it (although Mike does not given that zh0ukangyang got banned, but that was probably a special case anyway, but I digress). It has a caveat though: You should never, and I repeat never, use two accounts in the same contest (obviously), which he has violated several times, and even worse than that, he has used two accounts in a contest with prizes, therefore effectively taking away one contestant's 2 TON. Of course, you could argue: "Well 2 TON is chump change, who the hell cares?", and I agree yes, this sort of mindset does have a place in certain situations, but not in this one. Why? Well for starters zh0ukangyang got banned even though all he did was take 3000 measly internet points from other participants, so it stands to reason that a person who takes 2 TON should have some action taken against him. Also, without all of that stuff, like cheating = bad???? hello??? a person who cheats should not get away scot free, like that's what I believe, maybe other people might believe something different, but yknow I've spoken my piece I guess |
+65
New fear unlocked |
+62
They brought guns to a fist fight. |
+62
Come on... releasing the checker and some tests after 10 days of the competition? +Extension I did most of the work in the first week, and planned to do very little this week. Good luck with that plan now, right? |
+61
What is your codeforces account's password ? |
+60
Argentina's team:
|
+59
I recommend watching anime instead for the optimal skill boost |
+53
South Korea:
|
+44
Stop replying with your alts then we can talk |
+43
This is a huge insult. I'm sure I'm not the only one who agrees with. I don't know if I'm qualified to say this, but can't you be kind to other? Can't you at least be kind enough to not be sarcastic or insult someone who has nothing to do with you and has raised a legitimate issue? |
+38
As a tester, problems are: Spoiler |
+37
Glad the guy finally got served. Never have anything nice to say, just stupid insults and 4chan rhetorics |
+36
Cuba's team:
I don't know if the entire team will be able to travel. |
+36
at uni |
+34
United Kingdom's team:
|
+33
Hi! As a newbie tester I would encourage everyone to take part in this round and I would like to thank all the people who took part in organizing this round — especially prvocislo ! :D |
+33
Not you sir |
+31
NeverCompromise is one of his alt's which he accidentally doxxed here |
+29
Dyslexic Sparse University of Tartaria |
+28
Why? |
+27
Spain's IOI team is:
|
+25
As a tester, I enjoyed testing this round. Also, satyam343 orz |
+24
As a tester I am afraid to say that I'm no longer a specialist to make this round special |
+22
MikeMirzayanov Can you please tell why no action was taken against him despite him cheating in many contests using alt accounts, and he never apologized or showed remorse for his actions? |
+21
As a tester, I confirm! |
+21
I messed up guys. It was 7 and I wasn't been able to sleep yet. I decided to go to uni right away. Next frame, it was 12! I have no idea what happened since I even had my alarms on for 8. I hope we'll have a chance to do this another time. Feel free to downvote this comment. I messed up and deserve that. |
+20
|
+19
Feet_McYeet will win IOI 2024! |
+19
as another participant I don't think this is a wise decision. If you don't attempt harder interactive problems you will not improve at them. |
+19
I don't know man, telling someone is right after he called you effeminate is just a little weird |
+19
This never happens again. But, definitely, I will share the channel with them. |
+19
Here is the brazilian team:
Good luck guys :D |
+18
romanticforces |
+18
How on earth have so many people solved COUNTRBS? My solution is to notice that at most one good RBS starts at each position (namely, it ends at the next occurrence of the same prefix sum if all prefix sums in between are greater) and hash all O(n) substrings, but I think the observation part is too hard for most 5* coders. |
+18
In PRISON it should be made more clear what to output when there are no prisoners or guarenteed that there is at lease one prisoner. I chose some random negative values and got WA first. |
+18
Sir, you can watch death note, It will definitely increase your skills of deception and give a boost to your intellectual abilities. |
+18
Expected sum is not always exact. It is calculated by Kahan summation as in the published checker implementation. |
+17
Using alts is still cheating anyway, cos you're still taking some rating from other people. If you want to be against cheating, be against it fully. |
+17
More bitset blogs coming soon. |
+17
If I may: Also, I saw that you're mostly upsolving the next-unsolved question from past contests, that's good. Keep it up 👍 As for hitting CM, can't comment as everyone's mileage varies, but seeing your practice, you should be hitting Expert soon, possibly by the end of this summer (even if not in rating, surely in skill level — confidently hitting Expert a few contests later) Edit1: Rating fix |
+16
As a tester, I tasted so you could enjoy. GLHF! |
+16
rainboy orz |
On
Hawkwatch_19 →
Error: non-aggregate type 'vector<int>' cannot be initialized with an initializer list, 45 hours ago
+16
It had been solved already by Heap_OverFlow, but comment got removed due to some reason? Possibly, Heap_OverFlow reported some cheater, who reported heap's comments. The soln that heap said and worked with the OP had been updating the C++ standard in VS Code to C++11 or later, where the initializer list is supported. Modify tasks.json to include the -std=c++11 flag (or a later version like -std=c++14, -std=c++17, etc.) when compiling your code. Spoiler Update tasks.json to -> { "type": "shell", "label": "g++ build active file", "command": "/usr/bin/g++", "args": [ "-std=c++11", "-g", "$$${file}", "-o", "$$${fileDirname}/${fileBasenameNoExtension}" ], "options": { "cwd": "/usr/bin" } } then, Open Visual Studio Code. Click on the Extensions view icon on the sidebar or use the keyboard shortcut (Ctrl+Shift+X on Windows and Linux, ⇧⌘X on macOS). In the Extensions view search bar, type ‘C++’. Click on the C/C++ extension (ms-vscode.cpptools). To the right of Uninstall, there should be a gear icon. Click it and select Extension Settings from the dropdown menu. In the search bar of the settings page, type cppStandard. You should see an option for Cpp Standard. Change it to your desired version. For example, if you want to use C++17, select c++17. I wonder if cheat reporting these days lead to removal of such useful comments solving people's doubts? Heap sent me this. |
+16
Who on earth gave this guy the wrong info saying it's OK to be rude if you're CM? |
+16
Italy:
|
+16
Plz.start on 17:05(UTC+08) :< |
+16
I tried my best to divide the solution into reasonable parts, hopefully it'd be helpful. init Part 1 First let's make two sparse tables, one for min and one for max. Now I claim that from an element it's always optimal to go to the maximum point I can, and I'm allowed to, reach from it, to the right or to the left. Proof Proof is left as an exercise for the reader. 8 ) Part 2 We'll make two more sparse tables which will store what's the maximum point to the left or right I can reach after $$$2^i$$$ moves. Now let's find out how to even find the maximum point at the first stage I'll just do for one direction, other's exactly symmetric. Let's say I wanna find that point for some $$$a[l]$$$, we know that $$$a[l]$$$ is maximum/minimum of the range, which can be determined by $$$a[l]<a[l+1]$$$. WLOG $$$a[l]$$$ is minimum, now we find the first element that's less than and to the right of $$$a[l]$$$ which can be found using binary search + $$$O(1)$$$ sparse table query. Let's say index of it is $$$j$$$. Next find the maximum in the range $$$(l,j)$$$, let's say index of it is $$$r$$$. Now it's clear that there's an edge between $$$l$$$ and $$$r$$$ and we can't go further than using no more than one edge. calc_f Now let's answer a query. : ) Part 1 I can just use binary lifting to go to the maximum point I can reach from $$$l$$$, and is less than $$$r$$$, let's say $$$x$$$. Which's optimal according to our claim before. What to do next, can we just return ans+1? After checking on a few examples, we find that we can't. Proof $$$a[x]<a[y]$$$ $$$--->$$$ $$$a[x,...y-1]<a[y]$$$ P.S: It appears that there are some similarities between my sol and the sol above, which wasn't there when I started writing the comment. |
+16
what is dsu |
+16
r/wooosh |
+15
Honestly, it doesn't matter. There is simply no reason why you should defend the guy. |
+14
Well done prvocislo, I am looking forward to Friday :-) |
+14
Who is the greatest footballer of all time and why it's Messi? |
+14
Magic I've solved a large number of easier problems too so maybe that helps and there's quality problems from other OJs (CSES/Atcoder primarily and Topcoder/Codechef too) Practice@Atcoder I've practiced across OJs, though even after that, the count of meaningful problems I've solved is relatively low compared to peers in my rating range — which is probably why I'm hardstuck right now :') My implementation skills are probably subpar for my rating range; I probably benefit from having a set of templates for contests (which is a huge supplement in implementation) I guess being an avid puzzle/problem solver as a kid gave me some boost initially |
+14
Marinush His comments are more useful for the community than your retarded post and comments. It is you who needs to chill. Also, you don't need to write your username in your every fucking comment. We can see your username with our own eyes. We are not blind either |
+14
I'll win. |
+14
shayan is awol lol |
+14
wait your legendary Aidar Munduzbaev has no attemts left? Sad that he couldnt get gold |
+14
In my humble opinion, these recent announcements are not entirely fair to those individuals in top positions, as they were clever enough to unravel the hidden aspects of the contest unaided. Now, they may face additional competition for the top spots. While such adjustments might be acceptable in a 'just for fun' contest, they seem unjustified here, especially considering the significant monetary stakes involved. Fear not, top performers! I pose no threat to you! I currently reside at the bottom of the leaderboard and intend to stay there for the duration of the competition. :) Good luck! |
+13
correct me if i'm wrong
|
+13
Yes, that is true. I personally don't have any alts, but I can see a ton of reasons why someone could create alts, the most frequent of which is that "I have only an hour to participate in contest, but I still want to participate". If CF introduced a feature like Atcoder where you can participate unrated, that would be great, and would probably reduce the use of alts by a lot. |
+13
Boring Contest ever |
+13
Great Problemset. I learned alot. |
+13
idk it sounds cool |
+12
As a tester, I hope the participants will enjoy solving the problems as much as I did. Also, satyam343 orz. |
+12
This will be my birthday contest :) |
+12
TimDee has neither silver medal nor girlfriend |
+12
thank you blog that man good put like for him |
+11
As a loyal tester, I wish you all the best! |
+11
As a tester, I enjoyed testing this round. |
+11
It was my first time testing a round, I really enjoyed it, all the best for it!!!! |
+11
First, we can make $$$4$$$ arrays $$$gr, gl, sr, sl$$$ which stores for index $$$i$$$, what's the nearest greater value to the right, to left and smaller value to left and to right. This can be done using stack in $$$O(n)$$$. Now, let's consider the edges (there is an edge between $$$(i, j)$$$ if we can go from $$$i$$$ to $$$j$$$ in $$$1$$$ move i.e all elements in between are between $$$a_i$$$, $$$a_j$$$). Important thing to notice is that, we will take the edge which brings us closest to $$$r$$$ (considering the query $$$(l, r)$$$). Also, another observation is that it is easily determinable that whether $$$a_i$$$ is a min-point or max-point. We can just check that whether $$$a_{i + 1}$$$ is less or greater than $$$a_i$$$ and then we can't have $$$a_i$$$ as min if $$$a_{i + 1}$$$ is less than it (similar for other case). Assume that $$$a_i < a_{i + 1}$$$ since other case is similar. Now, $$$a_i$$$ is min and we want the max points. Note that the edges from $$$i$$$ are going to the changes in the max as we go towards right from $$$i$$$. Now, where will the last edge be? It will be to the maximum in the valid range. What is a valid range? the range will be valid such that the min point $$$i$$$ does not change. So, beyond $$$sr_i$$$ (the first index to the right of $$$i$$$ which have smaller value than $$$a_i$$$)we don't have any edge outgoing from $$$i$$$. So, we just get the max in the range $$$[i, sr_i)$$$. Now, we have $$$O(n)$$$ edges added in $$$O(n \space lg(n))$$$. We can also do binary lifting and store where do I land when I take $$$2^x$$$ edges. Now, when the query comes, we just go to the rightmost point we can from $$$l$$$ which is $$$\leq r$$$. What to do after that? We can now just do the same things we did for going in the right direction, for the left direction. Now, we starting going left from $$$r$$$ (using binary lifting). And we want the minimum jumps needed to get $$$r \leq l$$$. Now, we add both of the steps and we are done. Proofs of the observations are not hard, I believe that you should try them. Implementation
|
+11
thanks for the great contest! i really liked problem H. |
+11
It’s down now. What happened? |
+10
Macedonia:
We don't have a fourth (yet) :( |
+10
In case you are talking about Permutation Cycle Queries. My Opinion In my opinion purpose of sample cases are for contestants to verify if they understood th problem statement correctly or not, I dont think it has anything to do with guessing or not. If one sample case serves the purpose then it should be fine. |
+10
This blog became more of an orz warks profile review than AMA! |
+10
|
+10
When you die, would you rather not exist at all or have a 99% chance of going to heaven and a 1% chance of going to hell for eternity? |
+9
LET'S GOOOOOOOOOOOOOOOOOOO |
+9
As a tester, I tested! |
+9
Do you recommend Blue Eyes Samurai? (I know it's not considered an anime in principle, but anyway) |
+9
Ricky Kaka |
+9
You can write contest from only one account and you can only have 1 account. |
+9
You create a vector of size 1e6 every test case. Since the number of the test cases may be up to 1e4, your code leads to TLE. |
+9
interesting bro. ples publish mor content |
+9
So you are proud of being a troll with no life? |
+9
Happy birthday! I hope you will enjoy the round :D |
Name |
---|