結果
問題 | No.1479 Matrix Eraser |
ユーザー |
![]() |
提出日時 | 2021-04-16 21:52:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 878 ms / 3,000 ms |
コード長 | 3,075 bytes |
コンパイル時間 | 2,777 ms |
コンパイル使用メモリ | 217,472 KB |
最終ジャッジ日時 | 2025-01-20 19:48:57 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 39 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/maxflow>using namespace std;using namespace atcoder;#define REP(i,n) for(ll i=0;i<(ll)n;i++)#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";#define spa << " " <<#define fi first#define se second#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()using ld = long double;using ll = long long;using ull = unsigned long long;using pii = pair<int, int>;using pll = pair<ll, ll>;using pdd = pair<ld, ld>;template<typename T> using V = vector<T>;template<typename T> using P = pair<T, T>;template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }void fail() { cout << -1 << '\n'; exit(0); }inline int popcount(const int x) { return __builtin_popcount(x); }inline int popcount(const ll x) { return __builtin_popcountll(x); }template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];for(ll i=1;i<n;i++)cerr spa v[i];cerr<<"\n";};const ll INF = (1ll<<62);// const ld EPS = 1e-10;// const ld PI = acos(-1.0);const ll mod = (int)1e9 + 7;//const ll mod = 998244353;int main(){ll H, W;cin >> H >> W;auto A = make_vec(H, W, 0ll);V<V<pll>> vals(505050);REP(i, H){REP(j, W){cin >> A[i][j];vals[A[i][j]].emplace_back(i, j);}}ll res = 0;REP(x, 505050){if(x != 0 and !vals[x].empty()){mf_graph<ll> G(H+W+2);ll s = H+W;ll t = s+1;// dump(vals[x])V<ll> row, col;for(auto p: vals[x]){G.add_edge(p.first, H+p.second, 1);row.push_back(p.first);col.push_back(H+p.second);}UNIQUE(row);UNIQUE(col);for(auto v: row) G.add_edge(s, v, 1);for(auto v: col) G.add_edge(v, t, 1);res += G.flow(s, t);}}cout << res << endl;return 0;}