Submission #2756277

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <functional>
#include <map>
#include <set>
#include <cmath>
#include <string>
#define SIZE 4910
#define INF 10000005

using namespace std;
typedef long long int ll;
typedef pair <int,int> P;

int n;
int X,Y,E;
ll K;

struct edge{int to,cap,rev;};

vector<edge> G[SIZE];
bool used[SIZE];

//グラフ追加: from -> to (cap)
void add_edge(int from, int to, int cap){
	G[from].push_back((edge){to,cap,(int)G[to].size()});
	G[to].push_back((edge){from,0,(int)G[from].size()-1});
}

//パスを一本見つける
int dfs(int v, int t, int f){
	if(v==t)return f;
	used[v] = true;
	for(int i=0;i<G[v].size();i++){
		edge &e = G[v][i];
		if(!used[e.to] && e.cap>0){
			int d = dfs(e.to,t,min(f,e.cap));
			if(d>0){ //v -> G[v][i].toにd流す
				e.cap -= d;
				G[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}

int max_flow(int s,int t){
	int flow = 0;
	for(;;){
		memset(used,0,sizeof(used));
		int f = dfs(s,t,INF);
		if(f==0)return flow;
		flow += f;
	}
}

bool ad[2][70][70];
int S[70][70]; // 変える必要なし:0 (0->1):1 (1->0):2

int main()
{
	int r,c;
	int cnt=0;
	int a;
	scanf("%d %d",&r,&c);
	for(int k=0;k<2;k++){
		for(int i=0;i<r;i++){
			for(int j=0;j<c;j++){
				scanf("%d",&a);
				if(a==1)ad[k][i][j]=true;
				else ad[k][i][j]=false;
				if(k==1){
					if(ad[0][i][j]==true&&ad[1][i][j]==false){
						S[i][j]=2;cnt++;
					}else if(ad[0][i][j]==false&&ad[1][i][j]==true){
						S[i][j]=1;cnt++;
					}else S[i][j]=0;
				}
			}
		}
	}
	for(int i=0;i<r;i++){
		for(int j=0;j<(c-1);j++){
			if((S[i][j]==1&&S[i][j+1]==2) || (S[i][j]==2&&S[i][j+1]==1)){
				if((i+j)%2==0)add_edge(i*c+j,i*c+j+1,1);
				else add_edge(i*c+j+1,i*c+j,1);
			}
			if((i+j)%2==0)add_edge(4900,i*c+j,1);
			else add_edge(i*c+j,4901,1);
		}
	}
	for(int i=0;i<r;i++){
		if((c-1+i)%2==0)add_edge(4900,i*c+c-1,1);
		else add_edge(i*c+c-1,4901,1);
	}

	for(int i=0;i<c;i++){
		for(int j=0;j<(r-1);j++){
			if((S[j][i]==1&&S[j+1][i]==2) || (S[j][i]==2&&S[j+1][i]==1)){
				if((i+j)%2==0)add_edge(j*c+i,(j+1)*c+i,1);
				else add_edge((j+1)*c+i,j*c+i,1);
			}
		}
	}
	int ans = max_flow(4900,4901);
	printf("%d\n",cnt-ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:70:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&r,&c);
                      ^
./Main.cpp:74:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&a);
                   ^

Judge Result