OJ Board

@brianfry713: http://ideone.com/f5iN3M

I made the graph using this function :
void build_graph()
{
int i,j;
nodes=0;
vector <pii> in,out;
FOR(i,1,n)
{
int src = ++nodes;
int sink = ++nodes;
if(i>1)
{
cap[sink][src]=1000000;
adj[sink].push_back(src);
}
FOR(j,1,m)
{
nodes++;
if(mp[i].count(j))
{
if(mp[i][j]==1)
continue ...