結果
問題 | No.1479 Matrix Eraser |
ユーザー |
👑 ![]() |
提出日時 | 2021-04-16 20:34:52 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 601 ms / 3,000 ms |
コード長 | 6,987 bytes |
コンパイル時間 | 4,189 ms |
コンパイル使用メモリ | 228,544 KB |
最終ジャッジ日時 | 2025-01-20 18:53:33 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 39 |
ソースコード
//#define _GLIBCXX_DEBUG#include<bits/stdc++.h>using namespace std;#define endl '\n'#define lfs cout<<fixed<<setprecision(10)#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()#define spa << " " <<#define fi first#define se second#define MP make_pair#define MT make_tuple#define PB push_back#define EB emplace_back#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)using ll = long long;using ld = long double;const ll MOD1 = 1e9+7;const ll MOD9 = 998244353;const ll INF = 1e18;using P = pair<ll, ll>;template<typename T> using PQ = priority_queue<T>;template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}template<typename T>void rearrange(vector<int>&ord, vector<T>&v){auto tmp = v;for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];}template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){rearrange(ord, head);rearrange(ord, tail...);}template<typename T> vector<int> ascend(const vector<T>&v){vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});return ord;}template<typename T> vector<int> descend(const vector<T>&v){vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});return ord;}ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());int popcount(ll x){return __builtin_popcountll(x);};int poplow(ll x){return __builtin_ctzll(x);};int pophigh(ll x){return 63 - __builtin_clzll(x);};template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};template< typename T = int >struct edge {int to;T cost;int id;edge() = default;edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}operator int() const { return to; }};template<typename T>using Graph = vector<vector<edge<T>>>;template<typename T>Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){Graph<T> ret(n);for(int es = 0; es < m; es++){int u,v,w=1;cin>>u>>v;u-=indexed,v-=indexed;if(weighted)cin>>w;ret[u].emplace_back(v,w,es);if(!directed)ret[v].emplace_back(u,w,es);}return ret;}template<typename T>Graph<T> readParent(int n,int indexed=1,bool directed=true){Graph<T>ret(n);for(int i=1;i<n;i++){int p;cin>>p;p-=indexed;ret[p].emplace_back(i);if(!directed)ret[i].emplace_back(p);}return ret;}struct HopcroftKarp {vector< vector< int > > graph;vector< int > dist, match;vector< bool > used, vv;HopcroftKarp(int n, int m) : graph(n), match(m, -1), used(n) {}void add_edge(int u, int v) {graph[u].push_back(v);}void bfs() {dist.assign(graph.size(), -1);queue< int > que;for(int i = 0; i < graph.size(); i++) {if(!used[i]) {que.emplace(i);dist[i] = 0;}}while(!que.empty()) {int a = que.front();que.pop();for(auto &b : graph[a]) {int c = match[b];if(c >= 0 && dist[c] == -1) {dist[c] = dist[a] + 1;que.emplace(c);}}}}bool dfs(int a) {vv[a] = true;for(auto &b : graph[a]) {int c = match[b];if(c < 0 || (!vv[c] && dist[c] == dist[a] + 1 && dfs(c))) {match[b] = a;used[a] = true;return (true);}}return (false);}int bipartite_matching() {int ret = 0;while(true) {bfs();vv.assign(graph.size(), false);int flow = 0;for(int i = 0; i < graph.size(); i++) {if(!used[i] && dfs(i)) ++flow;}if(flow == 0) return (ret);ret += flow;}}void output() {for(int i = 0; i < match.size(); i++) {if(~match[i]) {cout << match[i] << "-" << i << endl;}}}};template<typename T>map<T,ll> compress(vector<T> &v){sort(ALL(v));v.erase(unique(ALL(v)),v.end());map<T, ll> ret;for(ll i=0;i<(ll)v.size();i++)ret[v[i]]=i;return ret;}int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;ll h,w;cin>>h>>w;map<ll,vector<P>>mp;rep(i,0,h)rep(j,0,w){ll a;cin>>a;mp[a].EB(i,j);}for(auto zz:mp){if(zz.fi==0)continue;auto &v=zz.se;vector<ll>mx,my;for(auto z:v){mx.PB(z.fi);my.PB(z.se);}auto mpx=compress(mx);auto mpy=compress(my);ll sx=mpx.size();ll sy=mpy.size();HopcroftKarp hop(sx,sy);for(auto z:v)hop.add_edge(mpx[z.fi],mpy[z.se]);//cout<<zz.fi spa hop.bipartite_matching()<<endl;res+=hop.bipartite_matching();}cout<<res<<endl;return 0;}