# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Hello there :)
In past contest(Codeforces Round #519 by Botan Investments) in Problem D i wanted to hack a solution and i wrote a code that make a text file and when i submitted that file, I found that it can't be more than 256 KB so i wrote this (My code) code for generating test and i get this error Validator 'validator.exe' returns exit code 3 [FAIL Expected EOLN (stdin)]
. I don't have any idea what is it, so could you help me?
I was thinking on a problem and i figure out an interesting problem that i can't solve it so could you help me?
We have an undirected weighted graph and Q queries. Each query has two vertices u and v. For each query erase all of edges between one of the path from v to u, so that sum of all weight of edges that has been erased from all queries become maximized.
I have no idea about time complexity, so there is no limit for n and Q. And if you have seen this problem before please give me the URL.
Thanks. :)
UPD : We want that sum of all queries become minimized.
Name |
---|