№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.
Название |
---|