| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hi.
I did some testing using my own randomly generated IO, but was looking for a hosted one to be sure. If you happen to know of any classical weighted assignment problems/min-cost max-flow problems in an OJ, please let me know in the comments.
So far I know about this one: https://www.spoj.com/problems/BABY/
Best.
To test my implementation, I used SWERC 2017 — G: Cordon Bleu
Two problems from codeforces that I've solved using MCMF: https://codeforces.net/problemset/problem/237/E https://codeforces.net/problemset/problem/277/E
From Kattis: https://open.kattis.com/problems/mincostmaxflow
Kattis — Cordon Bleu
Kattis — Raging River
Kattis — Mission Improbable
Kattis — Aqueduct Construction
Kattis — Hexagon
Kattis — Min Cost Max Flow