+119
IOI 2024 Team Russia
|
+100
WHY IS THERE EVEN AN OPTION TO ASK QUESTIONS IF YOU AREN'T GOING TO FUCKING ANSWER THEM??? |
+89
Now PinkieRabbit was skipped and got a -220 rating. Glad to see that. |
+87
Ukraine's team:
|
+86
Japan's team:
|
+86
China 56 300s. |
+83
Greetings from our team! Share your team photos too! P.S: Guess who is who :) |
+75
This has been talked about before and the general consensus seems to be that while these last problems of Div. 2 contests may be hard, they are also too standard to be suitable for a Div. 1 contest. |
+75
Team Slovakia:
Surprisingly, each of us has 6 letters in the first name and 8 letters in the surname. Our IOI statistics page is going to look super neat :) |
+64
why put B in contest, nice ACD problems though |
+63
Vietnam's team:
|
+60
I think this was recently skipped too. He was mentioned as master in the round announcement. |
+51
[Unofficial rankings] Please add your scores in this spreadsheet |
+42
No commment. |
On
atcoder_official →
Panasonic Programming Contest 2024(AtCoder Beginner Contest 354) Announcement, 45 hours ago
+37
D is created only to give pain and trauma :skull: |
+36
This is in meme territory. |
+35
Asia-Pacific Graphs Olympiad Anyway, I think problems were cool |
+34
This code prints |
+34
Some may be standard for IGMs and LGMs, but I don't think it holds true for most Masters and low reds. Many, not all, Div 2 rounds are definitely suitable for a "Div 1.5" and the coordinator should be able to decide this. |
+34
well-balanced div3 round, GL for all participants 🏆 |
+34
It's clear as day that he was banned for contribution farming. Sadly, reporting cheaters wasn't his only blogs/comments activity. |
+33
For me personally, the latest div3 tasks were very useful when I was a specialist/expert. And I think that only by solving them, I was able to quickly improve from 1500 to 1900 (you can look at the graph and make sure). Therefore, I think that it is necessary to look for such tasks where it will be possible to pump your skills quickly with a minimum of effort. And one of these tasks for beginners is div3/div4, just get out of your comfort zone. |
On
Shayan →
Codesprint Los Angeles 2024 | Vlog | 6th place in total, 1st amongst universities, 12 hours ago
+32
Sam is our best in implementing hard-to-implement tasks. |
+31
UZB top 6 Sunnatov — 100 + 40 + 5 = 145 |
+30
bump |
+29
As a tester, I hope you to enjoy the contest. Tasks are quite interesting and educational. Good luck! |
+28
How is your IOI? |
+27
Its not about it being too mathematical. That is perfectly fine. It is not about it being purely solvable on paper. That is also fine. All good problems are purely solvable on paper (by solvable on paper i mean write algorithm and verify correctness, only bad problems need you to experiment with the computer or non provable complexities) It is about it being very obvious but yet a lot of effort to actually find the formulas, that too for so many cases. |
+26
|
+26
I never understood such comments "I honestly don't understand what problems of this type do in programming contests", You are writing contest where you solve algorithmic/math puzzle problems, programming is side dish. |
+25
Just too complicated Movable rated boundaries make much more sense than this partial rated thing. But the issue with movable rated boundaries is its very subjective. |
+25
As a tester, I encourage you to read all the problems.GL and Happy Coding. |
+25
Pakistan top 6 Ghulam_Junaid 100+0+100=200 |
+24
Umanity will win EJOI 2024 |
+24
Completely deserved ,My request to Mikey to never un-ban him |
+23
how is your codeton 6? |
+23
After more than one hour dealing with mathematics, I finally get B accepted. Somehow I thought that I was attending a mathematics exam :D |
+23
Good job by Mike and Co. Clearly he was farming contribution with cringe blogposts and comments. |
+21
the current format is more educational than competitive which i like for lower divisions and when u get to div 1 where competition starts then its fair for everybody i think divisions which target lower rated participants should focus more on the educational side than the competition side |
+21
In general, yes. |
+21
Wow, how dare you get full points on problem C :) |
+21
wishing to get my Pupil back |
+20
In short, you can't see the activities which were aimed at farm that I meant, but I started to notice them before he delete it. (For more obvious evidence, you can compare his activity it to much more upvoted activity of Dominater069 and see an unexpected difference in contribution.) |
+19
In some cases, this actually seems useful for finding a balance between time and memory. For example, it seems that it is better to use flat_map when storing edges at the node of a trie. As far as I understand this is just an implementation like vector<pair<Key, Value>> with sorted Keys. And it works great with cache. |
+19
Good round, come and participate. |
+18
Please write suffix array template and never submit hashing solution again |
+18
Also TimDee and TimaDegt was skipped too. Probably MikeMirzayanov will post something. |
+18
hoping to return back the blue handle |
+17
Croatia:
|
+16
Deducing this, std::flat_map, std::print |
+16
Wansur will win EJOI2024 |
+16
According to regulation schedule, the contest window is over. But is it truly over? Are there anyone who didn't participate? |
+16
When will ranking come out |
+16
why do we need to wait 2-3 days |
+16
The contest starts in 8 minutes! |
+15
|
+15
If a person from each country replied with the scores of their official participants there would be less trolling |
+15
Another Vladosiya round!!! |
+15
As a participant I have to say im excited. |
+15
Reporting is a feature only for 1900+ users, so it's highly unlikely that he was banned by the cheaters he keeps harping on about, as they are mostly about the same people and greens/grays. Most likely his constant posting just annoyed enough high rated people over a while as his posts just fill up Recent actions and push down more deserving content. People's patience is a limited resource, so the ban is probably deserved and he should take this as a lesson. |
+15
Really ? In the screenshot above, 3 mentioned were capable of reporting :) peaked at Candidate at least. What about the fact that one of them runs a 5K member TG group ? so you think all these reports won't suffice to trick the system into fake read only mode and content removal ? It seems there is also other reason for banning, some spammy posts as per Vladosiya, but I honestly feel it is somehow an exaggerated move to ban cuz of this ? |
+14
I follow a different philosophy. But yes, I have noticed that lately competitive programming became less about programming and more about math, which is unfortunate for people like me. |
+13
I have some trouble understanding the given proof for the $$$O(1)$$$ solution for Problem A. I'll explain how I got that solution. Let us take an optimal solution (i.e., a solution with the max possible number of draws that corresponds to the given values of $$$p_1$$$, $$$p_2$$$, and $$$p_3$$$). The total number of games played is $$$\frac{p_1 + p_2 + p_3}{2}$$$. Let $$$a$$$, $$$b$$$, and $$$c$$$ denote the number of draws in the $$$A_1$$$ vs. $$$A_2$$$, $$$A_2$$$ vs. $$$A_3$$$, and $$$A_1$$$ vs. $$$A_3$$$ matches respectively, where the names of the players are $$$A_1$$$, $$$A_2$$$, and $$$A_3$$$. Since this is an optimal solution, the correct answer to the problem is $$$a+b+c$$$. Now, if it so happens that more than one of these players had wins (say, $$$A_1$$$ and $$$A_2$$$ both had nonzero wins — say, $$$k_1$$$ and $$$k_2$$$) — then, we could have repurposed them as $$$\min(k_1,k_2)$$$ more draws in $$$A_1$$$ vs. $$$A_2$$$ games, and one of them having $$$\mid k_2 - k_1 \mid$$$ wins instead, contradicting the optimality of our solution. Therefore, we may assume that only one of these players had wins (if any), say $$$w$$$ of them, in our optimal solution. Suppose $$$A_3$$$ is the player who had all $$$w$$$ wins ($$$w \geq 0$$$) in our optimal solution. Then, $$$p_1 = a + c$$$, $$$p_2 = a + b$$$, and $$$p_3 = b + c + 2w$$$. Solving for $$$a$$$, $$$b$$$, and $$$c$$$, we get $$$a = \frac{p_1 + p_2 - p_3 + 2w}{2}$$$, $$$b = \frac{p_2 + p_3 - p_1 - 2w}{2}$$$, and $$$c = \frac{p_1 + p_3 - p_2 - 2w}{2}$$$. Verify that these values for $$$a$$$, $$$b$$$, and $$$c$$$ will be the same even if you assume $$$A_1$$$ or $$$A_2$$$ won all $$$w$$$ games! Note that we get integral solutions for $$$a$$$, $$$b$$$, and $$$c$$$, iff the number of odd numbers in $$${p_1, p_2, p_3}$$$ is even. If this is not the case, we output $$$-1$$$, and finish. Now, thanks to $$$p_1 \leq p_2 \leq p_3$$$, $$$w = 0$$$ (i.e., all games are draws) leads to a valid (i.e., nonnegative integer) solution for $$$b$$$ and $$$c$$$, and a valid solution for $$$a$$$ only if $$$p_1 + p_2 \geq p_3$$$. That is, if $$$p_1 + p_2 \geq p_3$$$, the answer we must output is $$$\frac{p_1 + p_2 + p_3}{2}$$$. The case left to deal with is when $$$p_1 + p_2 < p_3$$$. To make the value of $$$a$$$ nonnegative, the minimal value of $$$w$$$ to be set (we want a minimal value for $$$w$$$ as we want maximum draws) is $$$\frac{p_3 - p_1 - p_2}{2}$$$. With this setting of $$$w$$$, we get a valid solution $$$a = 0$$$, $$$b = p_2$$$, and $$$c = p_1$$$, so that the answer is $$$a + b + c = p_1 + p_2$$$. I wrote this solution (sadly, after the contest) and it was accepted. |
+13
Separate things properly. If PinkieRabbit really is a cheater, he should be punished accordingly. And that doesn't invalidate the good deeds he had done, if any. Those two are completely independent topics, and none would outshadow the other. You can't use your good past as an excuse for your present wrongdoing. And vice versa, your present good deeds might earn people's respect, but they don't fully delete any sins in your past — at least their marks for remembrance and atonement will always stand. |
+13
We should thank CheaterExposer too. As he played a great role in this! |
+13
funny how I could predict who wrote this comment before seeing profile name on the right |
+13
Hey there. I am heap and sorry for this long comment. I apologise for this post then delete farming behavior, I did it as a form of troll or joke. (not much tho) You have a point, but I wanna raise a serious problem with the system that I still got absurd read-only modes on reporting cheaters, and maybe this caused me getting banned on the previous Heap_OverFlow. After mass downvoting by them, they are even so absurd that they downvoted a blog poster who asked for help regarding his IDE, saying thanks after I helped him (https://i.imgur.com/JoA4gQK.png) I don't know if this BAN action, can be reversed but I hope so and I really refrained from this behavior ,you say the ban is for, heap had some valuable info in talks, drafts about some cheaters, high rated ones too, that weren't yet exposed. I aspire that MikeMirzayanov reverse this ban. I still helped the system and caught some serious cheaters. I again redeclare my apologies for any farming (post, then delete) that happened. Thanks! ✪ω✪ |
+12
Nah man don't hate the player. Pretty much all cheaters, excluding the ones providing the solutions ofc, can't seem to get to specialist so there's really nothing to worry about. Their performance is so bad that it oftentimes inflates ratings. I'd like to add that the cheaters who are actually selling the solutions would be much better off spending their time passing OAs for people. How much could they possibly be making by selling codeforces solutions? |
+12
I can barely contain my excitement! I hope this will be a good one! GLHF! |
+12
он реально шарит в этом P.S: Take a look to second from left's t-shirt |
+11
Thank you! |
On
atcoder_official →
Panasonic Programming Contest 2024(AtCoder Beginner Contest 354) Announcement, 39 hours ago
+11
My post contest discussion stream Also, can someone hack my solution for G? |
+11
Cool. Nice to see justice being served in both cases. Thanks MikeMirzayanov! |
+11
What if someone creates a website where everyone enters their results? |
+11
Sorry for repeating this for the third time, but I think I have not received any solid objections yet. Why can't we make Div. 2 partially rated for Div. 1 contestants? For example, it might mean that, if you are not in Div. 2, your rating change is lower: specifically, if you are rated $$$2100+d$$$, your rating change is multiplied by $$$e^{-d/400}$$$.
About some contests I've coordinated:
Of course, this can be generalized to Div. 3 and Div. 4. |
+11
Good and interesting problems, thanks for the good round! |
+10
Great problems! |
+10
Most of this blog is copy-pasted from an uncredited geeksforgeeks article. |
+10
*800 *1000 *1300 *1600 *1900 *2100 is more true for div2 than *800 *1300 *1700 *2100 *2500 *3000. Div2 is rated for ~1899, and no 1899 can solve *3000(except for future GM). Difficult div2 often feels like div1.5, which may be good for M or CM, but is disastrous for E. Creating difficult well-made task is very difficult, and I think it is impossible for the rated participants of div2 to solve *2500 or harder task. Why not save the most difficult task for div1? Wouldn't it be satisfactory for everyone if put in a moderately easy problem(yes, around *1000~*1500) instead? |
+10
sir, i am so sorry if i cause you any inconvenience :(( but this cheater 1_2_3_4_5_9 had to be exposed and we expect his ban not banning the ONE WHO REPORTED! |
Stfu, nothing is clear, this isn't a true statement, do not spread hate from Iran to the world, it's not a correct place for such blogs remove it |
+10
as a tester , i hope you enjoy the round , a realy very good round <3 |
+9
I thought that was the point of educational rounds, to learn to be able to use techniques and algs that you wouldn't be able to use on problems like game theory. |
+9
Syria top 6 Abito — 115 edogawa_something — 115 aminsh — 115 FarhanHY — 110 NeroZein — 110 YazanAlattar — 110 CPNurd — 110 Amr.7 — 110 |
+9
based :D he is in fact the clownish dumb. I think because they are many according to this comment, the 1_2_3_4_5_9 TG group has about 5k members. |
+9
I think it is related to the number of read-only modes, and that's why I say it was unfair to ban him! because there had been fake read-only modes caused by high rated cheaters, he reported (master and cand). the reason said by vlad, is
|
On
atcoder_official →
Panasonic Programming Contest 2024(AtCoder Beginner Contest 354) Announcement, 47 hours ago
+8
Hope to ak! |
On
atcoder_official →
Panasonic Programming Contest 2024(AtCoder Beginner Contest 354) Announcement, 44 hours ago
+8
This time I solved problem F much faster than usual(maybe 15 minutes), because I have met a similar one, https://codeforces.com/contest/650/problem/D , during my virtual participation. This makes me believe again that hard work will pay off sooner or later. |
+8
When will every country participated and I can discuss problems? |
+8
Yeah, so lets take an example, lets say the array is this - Spoiler Here $$$p[2] = 1$$$, so we try to make values at odd indices local maximums. The values at odd indices are $$${5, 6, 4}$$$. Since we are going to iterate over increasing values, we go in the order $$$4 \rightarrow 5 \rightarrow 6$$$. So we first Spoiler Then we perform Spoiler Then we finally perform Spoiler And we are done! |
+8
Will we play volleyball again? :D |
+8
Thank you for the round, interesting problems as always! |
+8
Since people are apparently too childish, please reply to the comment with your scores and I will add you manually. Thanks. |
+8
You wrote the whole essey on a simple yes/no question. Looks like someone is indeed triggered |
+8
the definition of rating X is that on an average you can solve problems with rating X. It thus does not make sense that someone rated 1.8k can solve problems with a rating of 2.1k consistently |
+8
People who got 115 got 100-10-5 , and who got 110 got 100-5-5 |
+8
Can you correct the country name of the Uzb participants in excel? (mine and rshohruh's) |
+8
But why contradicting yourself ? If you weren't triggered then why create such a cheap temp acc in the 1st place to try frame heap and say complete non-sense having contribution -33. admit it that you are so dumb. :D |
+8
hopefully :) Will find out in a week See you at ioi24! |