OJ Board

Hi, I'm sorry, may be my question is little bit out of topic

this is my code so far for this problem

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include ...

yeah, I read mf's post after I submit my code.
But I haven't tried his solution because I just wonder in what case my graph construction will be fail

@Brianfry713 Sorry if i'm not post my full code, because I think the problem is in my graph construction.
I'mm only using template for the max flow. here is my code:

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib ...

I had tried all testcase in this post, and got the correct answer

also I got correct answer for my other testcase:

1
4 5
5 1 1 1 5 5
4 1 3 3 5
4 1 4 4 5
4 2 2 2 2


that has correct answer:
Case #1: 4

but it still get verdict wrong answer in oj :(

my graph is divided in 3 part and that ...