farnasirim's blog

Looking for OJ to test MCMF and/or Hungarian method implementations
By farnasirim, history, 6 years ago, In English

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.

  • Vote: I like it
  • +3
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it +3 Vote: I do not like it

To test my implementation, I used SWERC 2017 — G: Cordon Bleu

→ Reply
»
6 years ago, # |
  Vote: I like it +14 Vote: I do not like it

Two problems from codeforces that I've solved using MCMF: https://codeforces.net/problemset/problem/237/E https://codeforces.net/problemset/problem/277/E

→ Reply
»
6 years ago, # |
  Vote: I like it +3 Vote: I do not like it

From Kattis: https://open.kattis.com/problems/mincostmaxflow

→ Reply
»
6 years ago, # |
← Rev. 2   Vote: I like it +6 Vote: I do not like it

Kattis — Cordon Bleu

Kattis — Raging River

Kattis — Mission Improbable

Kattis — Aqueduct Construction

Kattis — Hexagon

Kattis — Min Cost Max Flow

→ Reply