#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef LOCAL # include "debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define rrep(i,n) for(int i=(n)-1; i>=0; i--) #define FOR(i,a,b) for(int i=(a); i<(b); i++) #define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define pb push_back using ll = long long; using D = double; using LD = long double; using P = pair; template using PQ = priority_queue>; template using minPQ = priority_queue, greater>; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } void in() {} template void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } void outr() {} template void outr(const T &t, const U &...u) { cout << t; outr(u...); } #include "atcoder/maxflow.hpp" int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int h,w; in(h,w); int a[h][w]; rep(i,h)rep(j,w) in(a[i][j]); vector bin; rep(i,h)rep(j,w) { if(a[i][j] == 0) continue; bin.pb(a[i][j]); } sort(ALL(bin)); UNIQUE(bin); rep(i,h)rep(j,w){ if(a[i][j] == 0) continue; a[i][j] = lower_bound(ALL(bin), a[i][j]) - bin.begin() + 1; } int m = bin.size(); vector> pos(m+1); rep(i,h)rep(j,w){ pos[a[i][j]].pb({i,j}); } ll ans = 0; FOR(i,1,m+1){ if(pos[i].empty()) continue; set mh, mw; for(auto &[x,y] : pos[i]){ mh.insert(x); mw.insert(y); } int nh = mh.size(), nw = mw.size(); vector vx(nh),vy(nw); int now = 0; for(auto x : mh){ vx[now] = x; now++; } now = 0; for(auto y : mw){ vy[now] = y; now++; } map mph,mpw; rep(i,nh) mph[vx[i]] = i; rep(i,nw) mpw[vy[i]] = i; int sz = nh+nw; atcoder::mf_graph g(2*sz+2); for(auto &[x,y] : pos[i]){ int nx = mph[x]; int ny = mpw[y]; g.add_edge(nx,nh+ny,1); } rep(i,nh) g.add_edge(2*sz, i, 1); rep(i,nw) g.add_edge(i+nh, 2*sz+1, 1); ans += g.flow(2*sz ,2*sz+1); } out(ans); }