So I think everyone knows what happened in the previous contest. One of the problems was the same as one of the problems in an old contest. Now, I think this on its own is not an issue as it happens in almost every contest nowadays(maybe not exactly identical but the idea is the same) and if someone has studied that problem before it is fair for them to solve it. The huge issue was that people were mentioning that they have seen the problem somewhere in blogs and comments so people that have not seen that problem before were also informed. I think one idea is to remove the ability of posting comments and blogs during contests. This would have a great effect but it would not stop the cheatings completely. another improvement that can be done is to block the access to previous submissions on old problems THAT ARE NOT YOUR OWN SUBMISSIONS during a contest; With this method, people that have solved a problem before can still access it but people that just want to copy paste something can't. Now this does not solve the problem of coincidence with problems on another platform but these are two improvements that I only see pros on and not any cons. Feel free to share your ideas.
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
So I was looking at the ongoing contest standings and I noticed something. Is it considered as cheating if you are a div.1 and you use a secondary div2 account to submit your initial code for a problem in the div2 contest to get all the wrong answers etc and submit your correct code in the div.1 account ? because I always see some people that are only solving C/D/E problems in the div2 contest like this guy : VietnameseEagle now I cant be 100% percent sure that this guy is actually doing what I have mentioned but I am like 80% sure. Plus if you change the code just a little bit you probably wont get detected.
Does a graph with distinct weight on edges exists that prim and kruskal algorithm produce different trees ?
I wonder if anyone noticed that 858F - Wizard's Tour and 405E - Graph Cutting are same !
why my submission gives wrong output here while it works fine on my computer ? 31150639
Hello guys . I have a problem with reading editorials . I dont know how to read them . once I read the editorial I dont learn from it I just understand how to solve that problem . I feel like its an idea to solve just this problem and cant use it on others . does anyone has any suggestion ?
