結果

問題 No.1479 Matrix Eraser
ユーザー srtubakisrtubaki
提出日時 2022-07-24 22:20:01
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 167 ms / 3,000 ms
コード長 6,154 bytes
コンパイル時間 2,707 ms
コンパイル使用メモリ 230,836 KB
実行使用メモリ 35,724 KB
最終ジャッジ日時 2024-07-06 17:37:54
合計ジャッジ時間 7,488 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
14,944 KB
testcase_01 AC 6 ms
14,956 KB
testcase_02 AC 7 ms
14,952 KB
testcase_03 AC 7 ms
14,976 KB
testcase_04 AC 7 ms
14,896 KB
testcase_05 AC 7 ms
14,956 KB
testcase_06 AC 7 ms
14,848 KB
testcase_07 AC 15 ms
16,040 KB
testcase_08 AC 23 ms
16,896 KB
testcase_09 AC 52 ms
19,064 KB
testcase_10 AC 109 ms
22,468 KB
testcase_11 AC 61 ms
19,712 KB
testcase_12 AC 18 ms
16,384 KB
testcase_13 AC 23 ms
16,880 KB
testcase_14 AC 20 ms
16,384 KB
testcase_15 AC 10 ms
15,320 KB
testcase_16 AC 22 ms
16,560 KB
testcase_17 AC 145 ms
24,064 KB
testcase_18 AC 146 ms
23,916 KB
testcase_19 AC 145 ms
24,052 KB
testcase_20 AC 151 ms
24,000 KB
testcase_21 AC 156 ms
23,964 KB
testcase_22 AC 148 ms
24,064 KB
testcase_23 AC 149 ms
24,064 KB
testcase_24 AC 149 ms
23,936 KB
testcase_25 AC 150 ms
24,064 KB
testcase_26 AC 145 ms
23,936 KB
testcase_27 AC 136 ms
23,004 KB
testcase_28 AC 136 ms
23,040 KB
testcase_29 AC 136 ms
22,784 KB
testcase_30 AC 137 ms
22,844 KB
testcase_31 AC 137 ms
23,016 KB
testcase_32 AC 81 ms
35,544 KB
testcase_33 AC 81 ms
35,620 KB
testcase_34 AC 81 ms
35,724 KB
testcase_35 AC 83 ms
35,516 KB
testcase_36 AC 82 ms
35,648 KB
testcase_37 AC 23 ms
16,896 KB
testcase_38 AC 167 ms
21,196 KB
testcase_39 AC 76 ms
24,696 KB
testcase_40 AC 9 ms
14,976 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region template
#include <bits/stdc++.h>

using namespace std;

// clang-format off
using ll  = long long;    using vl   = vector<ll>;  using vvl   = vector<vl>;
using ld  = long double;  using vld  = vector<ld>;  using vvld  = vector<vld>;
using pll = pair<ll, ll>; using vpll = vector<pll>; using vvpll = vector<vpll>;
using vb = vector<bool>; using vvb = vector<vector<bool>>;
using vs = vector<string>;
using mll = map<ll, ll>;
template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; template <class T> using VVV = V<VV<T>>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
constexpr ll inf = 3001001000100100100LL;
#define endl '\n'

#define  _overload(_1, _2, _3, name, ...) name
#define   rep(...) _overload(__VA_ARGS__,   _rep,   _rep2,)(__VA_ARGS__)
#define  repc(...) _overload(__VA_ARGS__,  _repc,  _repc2,)(__VA_ARGS__)
#define  repr(...) _overload(__VA_ARGS__,  _repr,  _repr2,)(__VA_ARGS__)
#define reprc(...) _overload(__VA_ARGS__, _reprc, _reprc2,)(__VA_ARGS__)
#define   _rep(i,k,n) for(ll i=(k)  , i##_xxxx=(n); i < i##_xxxx; ++i)
#define  _repc(i,k,n) for(ll i=(k)  , i##_xxxx=(n); i <=i##_xxxx; ++i)
#define  _repr(i,k,n) for(ll i=(n)-1, i##_xxxx=(k); i >=i##_xxxx; --i)
#define _reprc(i,k,n) for(ll i=(n)  , i##_xxxx=(k); i >=i##_xxxx; --i)
#define   _rep2(i,n)   _rep(i,0,n)
#define  _repc2(i,n)  _repc(i,1,n)
#define  _repr2(i,n)  _repr(i,0,n)
#define _reprc2(i,n) _reprc(i,1,n)

#define rall(o) rbegin(o), rend(o)
#define  all(o)  begin(o),  end(o)
template <class C> ll sz(const C& c) { return static_cast<ll>(c.size()); }
template <class T> bool chmax(T& m, const T& v){ if (m < v){ m = v; return true; } return false; }
template <class T> bool chmin(T& m, const T& v){ if (v < m){ m = v; return true; } return false; }
template <class T> T cdiv(const T& a, const T& b){ return (a + b - 1) / b; }
template <class T> T rdiv(const T& a, const T& b){ return (a + b / 2) / b; }
template <class T, class S>             string join(const T& v, const S& sep                  ){ stringstream ss; bool f = false; for (const auto& e : v){ if (f) ss << sep; f = true; ss << e;} return ss.str(); }
template <class T, class S, class... U> string join(const T& v, const S& sep, const U& ...args){ stringstream ss; bool f = false; for (const auto& c : v){ if (f) ss << sep; f = true; ss << join(c, args...); } return ss.str(); }
template <class T>            ostream& operator<<(ostream& os, const vector<T>&            seq){ os << '[' << join(seq, ",") << ']'; return os; } template <class T>            ostream& operator<<(ostream& os, const vector<vector<T>>&    seq){ os << '[' << join(seq, ",\n ") << ']'; return os; }
template <class T>            ostream& operator<<(ostream& os, const deque<T>&             seq){ os << '[' << join(seq, ",") << ']'; return os; }
template <class T>            ostream& operator<<(ostream& os, const set<T>&               seq){ os << '{' << join(seq, ",") << '}'; return os; }
template <class T , class TH> ostream& operator<<(ostream& os, const unordered_set<T, TH>& seq){ os << '{' << join(seq, ",") << '}'; return os; }
template <class TK, class TV> ostream& operator<<(ostream& os, const map<TK, TV>&          seq){ os << '{'; bool f = false; for (const auto& e : seq){ if (f) os << ','; f = true; os << e.first << ":" << e.second; } os << '}'; return os; }
template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>&          pa){ os << '(' << pa.first << ',' << pa.second << ')'; return os; }

#if LOCAL
#define debug(...) _debug(__VA_ARGS__, __LINE__)
#else
#define debug(...)
#endif
void print() { std::cout << '\n'; }
template <class S>             void  print(const S& a){ std::cout << a << '\n'; }
template <class S>             void _debug(const S& a){ std::cerr << "(L:" << std::setw(3) << a << ")\n"; }
template <class S, class... T> void  print(const S& a, const T&... args){ std::cout << a << ' ';  print(args...); }
template <class S, class... T> void _debug(const S& a, const T&... args){ std::cerr << a << ' '; _debug(args...); }

struct setup_main { setup_main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); std::cout << fixed << setprecision(15); } } setup_main_;
// clang-format on
#pragma endregion
#include <atcoder/maxflow>
#include <atcoder/mincostflow>

#ifdef LOCAL
const ll M = 10;
#else
const ll M = 500000;
#endif


template <class T>
struct Compress {
    vector<T> inv;
    Compress(vector<T> a = {}) : inv(a) {}

    void push(T val) { inv.push_back(val); }
    void compress() {
        sort(all(inv));
        inv.erase(unique(all(inv)), inv.end());
    }

    ll zip(T val) { return lower_bound(all(inv), val) - inv.begin(); }

    T unzip(ll idx) {
        assert(0 <= idx and idx < sz(inv));
        return inv[idx];
    }

    size_t size() { return inv.size(); }
};


void solve(ll H, ll W, vector<vector<ll>>& A) {
    vvpll B(M + 1);

    rep(y, H) rep(x, W) {
        if (A[y][x] != 0) B[A[y][x]].emplace_back(y, x);
    }

    ll ans = 0;
    for (auto& v : B) {
        if (sz(v) == 0) continue;
        if (sz(v) == 1) {
            ans++;
            continue;
        }

        Compress<ll> row, col;
        for (auto&& [y, x] : v) {
            row.push(y);
            col.push(x);
        }
        row.compress(), col.compress();

        ll h = row.size(), w = col.size();
        atcoder::mf_graph<ll> G(h + w + 2);
        ll s = h + w, t = s + 1;

        rep(y, h) G.add_edge(s, y, 1);
        rep(x, w) G.add_edge(x + h, t, 1);

        for (auto [y, x] : v) {
            y = row.zip(y);
            x = col.zip(x);
            G.add_edge(y, x + h, inf);
        }

        ll f = G.flow(s, t);
        debug(v, f);
        debug(G.min_cut(s));
        for (auto [from, to, cap, flow] : G.edges()) {
            debug(from, to, " ", cap, flow);
        }
        ans += f;
    }
    print(ans);
}


int main() {
    ll H, W;
    cin >> H >> W;
    vector<vector<ll>> A(H, vector<ll>(W));
    rep(j, H) {
        rep(i, W) {
            cin >> A[j][i];
        }
    }

    solve(H, W, A);
}
0