Problems such as maximum flow, min-cost flow and two-sat have multiple, non-deterministic answers. These problems cannot be verified with AtCoder test cases and answers. We can use Library Checker problems, where local, real judge works, but it doesn't fully cover ALPC problems. Maybe AOJ problems fill the rest?
toyboot4e
commented
3 weeks ago
Problems such as maximum flow, min-cost flow and two-sat have multiple, non-deterministic answers. These problems cannot be verified with AtCoder test cases and answers. We can use Library Checker problems, where local, real judge works, but it doesn't fully cover ALPC problems. Maybe AOJ problems fill the rest?