Submission #2325975

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;

template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

struct bipartite_matching{
    static const int MAX_V=5000;
    vector<int>G[MAX_V];
    int match[MAX_V];
    bool used[MAX_V];

    void add_edge(int u,int v){
        G[u].push_back(v);
        G[v].push_back(u);
    }

    bool dfs(int v){
        used[v]=true;
        for(int i=0;i<G[v].size();i++){
            int u=G[v][i],w=match[u];
            if(w<0||!used[w]&&dfs(w)){
                match[v]=u;
                match[u]=v;
                return true;
            }
        }
        return false;
    }

    int matching(){
        int res=0;
        memset(match,-1,sizeof(match));
        for(int v=0;v<MAX_V;v++){
            if(match[v]<0){
                memset(used,0,sizeof(used));
                if(dfs(v))res++;
            }
        }
        return res;
    }
};

int H,W;
int A[77][77],B[77][77];

signed main(){
    cin>>H>>W;
    rep(i,H)rep(j,W)cin>>A[i][j];
    rep(i,H)rep(j,W)cin>>B[i][j];

    bipartite_matching latte;

    int ans=0;
    rep(i,H)rep(j,W){
        if(A[i][j]==B[i][j])continue;
        ans++;
        if(i+1<H){
            if(A[i+1][j]!=B[i+1][j]&&A[i][j]!=A[i+1][j])latte.add_edge(i*W+j,(i+1)*W+j);
        }
        if(j+1<W){
            if(A[i][j+1]!=B[i][j+1]&&A[i][j]!=A[i][j+1])latte.add_edge(i*W+j,i*W+j+1);
        }
    }

    cout<<ans-latte.matching()<<endl;
    return 0;
}

Submission Info

Judge Result