OJ Board

My code runs in about 0.5 secs, but it gets WA, though I tested it on all the inputs from the forum. Still can't figure out what I did wrong.

Could someone please take the time and spot why I keep getting WA?
My algorithm works like this:
- first build a collection of points which lie on the same line, and store every such set of points as a bitmask;
- next, do a basic search for the minimum number of cuts, where gmin(K,MSK) returns the ...

I keep getting WA on this problem. I spent hours testing my code, but no luck. I used simple preflow push algorithm. Can anyone spot what I did wrong?

#include "stdio.h"
#include "stdlib.h"

#define MAXN 501

long C[MAXN][MAXN], F[MAXN][MAXN], E[MAXN], H[MAXN];
int N;
int S, T, CC;

bool read ...