#include using namespace std; #define int long long #define rep(i, n) for(int (i)=0;(i)<(n);(i)++) #define rrep(i, n) for(int (i)=((n)-1);(i)>=0;(i)--) #define itn int #define miele(v) min_element(v.begin(), v.end()) #define maele(v) max_element(v.begin(), v.end()) #define SUM(v) accumulate(v.begin(), v.end(), 0LL) #define lb(a, key) lower_bound(a.begin(),a.end(),key) #define ub(a, key) upper_bound(a.begin(),a.end(),key) #define COUNT(a, key) count(a.begin(), a.end(), key) #define BITCOUNT(x) __builtin_popcount(x) #define pb push_back #define all(x) (x).begin(),(x).end() #define F first #define S second using P = pair; using WeightedGraph = vector>; using UnWeightedGraph = vector>; using Real = long double; using Point = complex; //Point and Vector2d is the same! // p.real() or real(p) -> x軸, p.imag() or imag(p) -> y軸 using Vector2d = complex; const int MOD = 1000000007; const long long INF = 1LL << 60; const double EPS = 1e-15; const double PI = 3.14159265358979323846; template int getIndexOfLowerBound(vector &v, T x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); } template int getIndexOfUpperBound(vector &v, T x) { return upper_bound(v.begin(), v.end(), x) - v.begin(); } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } #define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++) istream &operator>>(istream &is, Point &p) { Real a, b; is >> a >> b; p = Point(a, b); return is; } template istream &operator>>(istream &is, pair &p_var) { is >> p_var.first >> p_var.second; return is; } template istream &operator>>(istream &is, vector &vec) { for (T &x : vec) is >> x; return is; } template ostream &operator<<(ostream &os, pair &pair_var) { os << pair_var.first << ' ' << pair_var.second; return os; } template ostream &operator<<(ostream &os, vector &vec) { for (int i = 0; i < vec.size(); i++) os << vec[i] << ' '; return os; } template ostream &operator<<(ostream &os, vector> &vec) { for (int i = 0; i < vec.size(); i++) os << vec[i] << '\n'; return os; } template ostream &operator<<(ostream &os, vector> &df) { for (auto &vec : df) os << vec; return os; } template ostream &operator<<(ostream &os, map &map_var) { repi(itr, map_var) { os << *itr << ' '; itr++; itr--; } return os; } template ostream &operator<<(ostream &os, set &set_var) { repi(itr, set_var) { os << *itr << ' '; itr++; itr--; } return os; } void print() { cout << endl; } template void print(Head &&head, Tail &&... tail) { cout << head; if (sizeof...(tail) != 0) cout << " "; print(forward(tail)...); } bool isOk(int mid, int c) { if(3 * mid >= c) return true; else return false; } template unordered_map compression(vector tmp){ sort(tmp.begin(), tmp.end()); tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end()); unordered_map ma; for(int i=0;i> &G, 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(vector > &G, vector &used, int v, int t, int f){ if(v==t) return f; used[v] = true; for(int i=0;i 0){ int d = dfs(G, used, e.to, t, min(f,e.cap)); if(d>0){ e.cap -= d; G[e.to][e.rev].cap += d; return d; } } } return 0; } int max_flow(vector > &G, vector &used, int s, int t){ int flow = 0; for(;;){ vector tmp(used.size()); used = tmp; int f = dfs(G, used, s,t,INF); if(f == 0) return flow; flow += f; } } signed main(void) { cin.tie(0); ios::sync_with_stdio(false); int h, w; cin>>h>>w; vector numbers(h*w); vector > a(h,vector (w)); rep(i, h) { rep(j, w) { cin>>a[i][j]; numbers[i*w + j] = a[i][j]; } } unordered_map ma = compression(numbers); vector >> data(ma.size(),vector >()); rep(i, h) rep(j, w) data[ma[a[i][j]]].pb({i, j}); int ans = 0; for (int i = 1; i < ma.size(); ++i) { vector > g(1002); int start = 1000, goal = 1001; for (auto p : data[i]) { add_edge(g, p.first, p.second+500, 1); } for (int i = 0; i < 500; ++i) { add_edge(g, start, i, 1); add_edge(g, i+500, goal, 1); } vector used(1002); int add = max_flow(g, used, 1000, 1001); ans += add; } print(ans); }