№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
+278
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. |
+217
he's completing school years in reverse order — won't graduate until 1st grade |
+110
|
+104
We can do that after the world final. Before that, we all need each other in a healthy state. |
+93
1933 != 2200 |
+89
Instead of doing all that, you should run around with sticks and hit each other and see who is the last one standing. I believe that Shayan would win and it wouldn't be close. |
+81
Ok cheater |
+77
So you mean you've also violated codeforces rules and have another account right? |
+71
China's team:
Good luck to them! |
+70
I feel bad that qwerasdfzxcl didn't make it. |
+67
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 |
+66
dramaforces |
+61
What is your codeforces account's password ? |
+60
Argentina's team:
|
+55
owoovo_shih will win APIO 2024! |
+52
I recommend watching anime instead for the optimal skill boost |
+51
They brought guns to a fist fight. |
+45
South Korea:
|
+38
Kyrgyzstan Team:
(Can be one more attempt, the government has extended the school education system by one year) |
+37
4 attempts left excluding this IOI? That's amazing. Congratulations and good luck to all of you! |
+37
Iran's team:
All of them are participating for the first time at IOI, we wish them the bests, may the code be with them! |
+36
It's kind of ambigious this time (clearly because 555 wasn't competing), because our commitee decided to choose the team with %20 National OI and %80 Team Selection Contest score for the first time this year. But CMS was incredibly bad on the first day of the National OI, and there were tons of people who suffered from not being able to get feedback and not being able to submit for long periods of time. (If you were lucky enough like me, you could also get the special treatment of "We're going to accidentally cut your Ethernet cable and stall you for the next 3 hours.") This %20 is going to be the deciding factor for the 4th member, and there are still no official results, so it's up to you to choose your 5th placer. You can look into the unofficial results from this sheet made by tolbi using all the AP Statistics knowledge we've acquired the previous week. |
+35
As a tester, I enjoyed testing this round. Also, satyam343 orz |
+34
I think we should hire you as our coach for the world final. You seem to know how we should train. |
+34
As a tester, problems are: Spoiler |
+34
meanwhile you are just a troll with no life |
+31
NeverCompromise is one of his alt's which he accidentally doxxed here |
+29
I believe that partaking in such an event before the competition might prepare you better for mishaps that might happen during the competition. You wouldn't want to get hit in the face while you're solving the final problem and not know how to recover properly. Remember, "everyone has a plan until they get hit in the mouth" — Mike Tyson. Now, of course, getting hit in the face during the competition isn't likely, but I believe that training for such an occurrence is a more effective practice strategy than spamming out 1400-rated problems. |
+28
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 |
+28
United Kingdom's team:
|
+25
at uni |
+23
Spain's IOI team is:
|
+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? |
+22
Cuba's team:
I don't know if the entire team will be able to travel. |
+22
Not you sir |
+21
As a tester, I confirm! |
+20
|
+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
Sir, you can watch death note, It will definitely increase your skills of deception and give a boost to your intellectual abilities. |
+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
As a tester I am afraid to say that I'm no longer a specialist to make this round special |
+16
rainboy orz |
На
Hawkwatch_19 →
Error: non-aggregate type 'vector<int>' cannot be initialized with an initializer list, 33 часа назад
+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
Feet_McYeet will win IOI 2024! |
+16
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. |
+16
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? |
+15
This will also be the last contest of Taiwan's provincial team selection! Good luck to everyone competing for the last spot of Taiwan(Province of China)'s IOI team |
+15
As a tester, I tasted so you could enjoy. GLHF! |
+15
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 |
+15
I'll win. |
+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
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
shayan is awol lol |
+13
correct me if i'm wrong
|
+13
Boring Contest ever |
+13
От друзей |
+13
Great Problemset. I learned alot. |
+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
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 |
+11
I don't think they'd want to replicate the incident during the Turkish IOI camp.... |
+11
As a loyal tester, I wish you all the best! |
+11
As a tester, I enjoyed testing this round. |
+11
Plz.start on 17:05(UTC+08) :< |
+11
thanks for the great contest! i really liked problem H. |
+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
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? |
На
kostka →
Am I the only one that finds it ridiculous that ACPC got ICPC Outstanding Community Engagement Award..., 39 часов назад
+9
bump |
+9
LET'S GOOOOOOOOOOOOOOOOOOO |
+9
|
+9
Do you recommend Blue Eyes Samurai? (I know it's not considered an anime in principle, but anyway) |
+9
Ricky Kaka |
+9
Italy:
|
+9
You can write contest from only one account and you can only have 1 account. |
+9
It’s down now. What happened? |
+8
This is a serious suggestion btw cuz it is true shenanigans. Plus exercise increases cognitive ability, probably more so than solving problems 1000 points below your rating. Imma be mad disappointed if I click on the stream and I don't see something like this happening. |
+8
|
+8
This code is not working for negative values |
+8
This problem is solvable in $$$\Theta(N)$$$ via a greedy algorithm. Spoiler Let $$$(a, b, c)$$$ be three consecutive signals, satisfying $$$a, c \leq b$$$. You can replace it with a single signal with value $$$a - b + c$$$. The case where the largest signal is on the edge can be solved greedily. Source: Algorithmic Engagements 2010, Termites. |
+8
I don't like the idea of counting a compilation error as a submission. Still its not that bad, but counting in the rule of 1 minute pause is too bad. It can be so frustrating sometimes. |
+8
As a contestant, qwerasdfzxcl is handsome |
+8
I believe priority queue is better as it uses heap instead of a balanced BST, which makes it better in terms of time complexity(better as avl rotations have higher constant factor than extract max of heap) and space complexity(no need of pointer to left and right child as would have been needed in balanced tree for set). |
+8
Fuck it, it is 5:30 over here, we have to start in 3 hours and I couldn't sleep yet. I don't understand what is going on. I hope you haven't poisoned me guys. |
+8
Ice_man2.0 will win EJOI |
+8
I found the problem. It was on the 48-th line, because $$$j$$$ could be negative, which led to negative indexing. |
+8
TimDee has neither silver medal nor girlfriend |
+8
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. |
+7
He goes by the name of Winner, There also a lot of other people who are master and candidate master in that group, sharing solutions, there is also another group by the id of codenichecp which solutions get shared if there isn't a collision with any other platform contests and the owner is awake |
+7
one of the problem will be interactive |
+6
tigranmatsak_9 will win EJOI2024 |
+6
No, I don't think so. See this post. |
Название |
---|