| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
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://mirror.codeforces.com/problemset/problem/237/E https://mirror.codeforces.com/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