結果

問題 No.1479 Matrix Eraser
ユーザー optopt
提出日時 2021-04-16 21:12:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 277 ms / 3,000 ms
コード長 5,348 bytes
コンパイル時間 4,915 ms
コンパイル使用メモリ 276,920 KB
実行使用メモリ 23,440 KB
最終ジャッジ日時 2024-07-03 00:20:17
合計ジャッジ時間 12,100 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
14,852 KB
testcase_01 AC 9 ms
14,852 KB
testcase_02 AC 8 ms
14,928 KB
testcase_03 AC 8 ms
15,004 KB
testcase_04 AC 9 ms
15,000 KB
testcase_05 AC 8 ms
14,908 KB
testcase_06 AC 8 ms
14,900 KB
testcase_07 AC 41 ms
15,904 KB
testcase_08 AC 64 ms
16,416 KB
testcase_09 AC 123 ms
17,948 KB
testcase_10 AC 227 ms
20,264 KB
testcase_11 AC 143 ms
18,552 KB
testcase_12 AC 49 ms
16,108 KB
testcase_13 AC 63 ms
16,484 KB
testcase_14 AC 51 ms
15,948 KB
testcase_15 AC 17 ms
15,188 KB
testcase_16 AC 55 ms
16,104 KB
testcase_17 AC 274 ms
21,236 KB
testcase_18 AC 274 ms
21,044 KB
testcase_19 AC 274 ms
21,168 KB
testcase_20 AC 270 ms
21,036 KB
testcase_21 AC 274 ms
21,216 KB
testcase_22 AC 271 ms
21,244 KB
testcase_23 AC 275 ms
21,192 KB
testcase_24 AC 277 ms
21,104 KB
testcase_25 AC 272 ms
21,192 KB
testcase_26 AC 275 ms
21,264 KB
testcase_27 AC 132 ms
17,976 KB
testcase_28 AC 131 ms
18,052 KB
testcase_29 AC 131 ms
18,072 KB
testcase_30 AC 131 ms
17,976 KB
testcase_31 AC 131 ms
18,028 KB
testcase_32 AC 75 ms
23,284 KB
testcase_33 AC 75 ms
23,436 KB
testcase_34 AC 75 ms
23,288 KB
testcase_35 AC 75 ms
23,348 KB
testcase_36 AC 76 ms
23,440 KB
testcase_37 AC 23 ms
14,840 KB
testcase_38 AC 145 ms
16,936 KB
testcase_39 AC 253 ms
22,744 KB
testcase_40 AC 8 ms
14,796 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
// input and output of modint
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }
template<int m> istream &operator>>(istream &is, static_modint<m> &a) { long long v; is >> v; a = v; return is; }
template<int m> ostream &operator<<(ostream &os, const static_modint<m> &a) { return os << a.val(); }
template<int m> istream &operator>>(istream &is, dynamic_modint<m> &a) { long long v; is >> v; a = v; return is; }
template<int m> ostream &operator<<(ostream &os, const dynamic_modint<m> &a) { return os << a.val(); }
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), lim##i = (b); i < lim##i; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define drep_(i, a_, b_, a, b, ...) for (int i = (a)-1, lim##i = (b); i >= lim##i; --i)
#define drep(i, ...) drep_(i, __VA_ARGS__, __VA_ARGS__, __VA_ARGS__, 0)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <class Head, class... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
template<class T> using V = vector<T>;
using ll = long long;
using ld = long double;
using Vi = V<int>;  using VVi = V<Vi>;
using Vl = V<ll>;   using VVl = V<Vl>;
using Vd = V<ld>;   using VVd = V<Vd>;
using Vb = V<bool>; using VVb = V<Vb>;
template<class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
template<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class T> inline int sz(const T &x) { return x.size(); }
template<class T> inline bool chmin(T &a, const T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T &a, const T b) { if (a < b) { a = b; return true; } return false; }
template<class T1, class T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<class T, size_t n> istream &operator>>(istream &is, array<T, n> &v) { for (auto &e : v) is >> e; return is; }
template<class T, size_t n> ostream &operator<<(ostream &os, const  array<T, n> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> inline void deduplicate(vector<T> &a) { sort(all(a)); a.erase(unique(all(a)), a.end()); }
template<class T> inline int count_between(const vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline ll ceil_div(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y)
inline int floor_log2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x))
inline int ceil_log2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x))
inline int popcount(const ll x) { return __builtin_popcountll(x); }
inline void fail() { cout << -1 << '\n'; exit(0); }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
// const int INF  = (1<<30) - 1;
// const ll INFll = (1ll<<60) - 1;
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
// using mint = modint998244353;
// using mint = modint1000000007;
// using mint = modint;
// using Vm = V<mint>; using VVm = V<Vm>;


// compress vector: simple version
template<typename T>
void compress(vector<T> &v) {
  vector<T> t = v;
  sort(all(t));
  t.erase(unique(all(t)), t.end());
  int n = sz(v);
  rep(i, n) v[i] = lower_bound(all(t), v[i]) - t.begin();
}


// void solve() {
ll solve() {
  int h, w; cin >> h >> w;
  const int M = int(5e5) + 5;
  V<V<array<int, 2>>> idx(M);
  rep(i, h) rep(j, w) {
    int a; cin >> a;
    if (a) idx[a].push_back({i, j});
  }

  ll ans = 0;
  for (auto &id : idx) {
    if (sz(id) == 0) continue;
    Vi x, y;
    for (auto [i, j] : id) x.push_back(i), y.push_back(j);
    compress(x);
    compress(y);
    int h = *max_element(all(x)) + 1;
    int w = *max_element(all(y)) + 1;
    int m = sz(x);

    mf_graph<int> g(h+w+2);
    int s = h+w;
    int t = h+w+1;
    rep(i, m) g.add_edge(x[i], h+y[i], 1);
    rep(i, h) g.add_edge(s, i, 1);
    rep(j, w) g.add_edge(h+j, t, 1);
    ll res = g.flow(s, t);
    ans += res;
  }  
  return ans;
}


int main() {
  // solve();
  cout << solve() << '\n';
}
0