結果

問題 No.1479 Matrix Eraser
ユーザー haruki_Kharuki_K
提出日時 2021-04-16 20:42:57
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,007 ms / 3,000 ms
コード長 6,359 bytes
コンパイル時間 2,436 ms
コンパイル使用メモリ 221,800 KB
実行使用メモリ 32,676 KB
最終ジャッジ日時 2023-09-15 21:46:34
合計ジャッジ時間 17,198 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 93 ms
6,924 KB
testcase_08 AC 160 ms
9,104 KB
testcase_09 AC 339 ms
15,068 KB
testcase_10 AC 744 ms
24,360 KB
testcase_11 AC 388 ms
17,068 KB
testcase_12 AC 55 ms
7,636 KB
testcase_13 AC 113 ms
9,128 KB
testcase_14 AC 62 ms
8,104 KB
testcase_15 AC 9 ms
4,484 KB
testcase_16 AC 92 ms
8,392 KB
testcase_17 AC 938 ms
27,848 KB
testcase_18 AC 932 ms
27,948 KB
testcase_19 AC 937 ms
27,832 KB
testcase_20 AC 932 ms
27,876 KB
testcase_21 AC 918 ms
27,736 KB
testcase_22 AC 940 ms
27,912 KB
testcase_23 AC 948 ms
27,796 KB
testcase_24 AC 935 ms
27,784 KB
testcase_25 AC 956 ms
27,844 KB
testcase_26 AC 945 ms
27,944 KB
testcase_27 AC 60 ms
11,024 KB
testcase_28 AC 59 ms
11,008 KB
testcase_29 AC 59 ms
10,736 KB
testcase_30 AC 60 ms
10,924 KB
testcase_31 AC 61 ms
10,960 KB
testcase_32 AC 27 ms
9,588 KB
testcase_33 AC 26 ms
9,536 KB
testcase_34 AC 26 ms
9,548 KB
testcase_35 AC 27 ms
9,644 KB
testcase_36 AC 26 ms
9,580 KB
testcase_37 AC 16 ms
5,084 KB
testcase_38 AC 50 ms
9,084 KB
testcase_39 AC 1,007 ms
32,676 KB
testcase_40 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
vector<int> &operator--(vector<int> &v) { for (int &x : v) --x; return v; }
vector<int> &operator++(vector<int> &v) { for (int &x : v) ++x; return v; }
// <<<
// >>> bipartite matching
struct BMatching {
    vector<int32_t> used, p, q;
    vector<vector<int32_t>> g;
    BMatching(int L, int R) : used(L, 0), p(L, -1), q(R, -1), g(L) {}
    void add_edge(int x, int y) { g[x].push_back(y);}
    bool dfs(int32_t x) {
        if (used[x]) return false;
        used[x] = 1;
        for (int y : g[x]) {
            if (q[y] < 0 or dfs(q[y])) {
                p[x] = y, q[y] = x;
                return true;
            }
        }
        return false;
    }
    int run() {
        int match = 0, update = 1;
        while (update) {
            update = 0; fill(used.begin(), used.end(), 0);
            rep (i, p.size()) if (p[i] < 0 and dfs(i)) update = 1, ++match;
        }
        return match;
    }
};
// <<<

int32_t main() {
    int n, m; cin >> n >> m;
    auto a = make_v<int, 2>(n, m); cin >> a;

    map<int, vector<pair<int, int>>> pos;
    rep (i, n) rep (j, m) if (a[i][j] > 0) pos[-a[i][j]].eb(i, j);

    int ans = 0;
    for (auto const& [_, v] : pos) {
        BMatching bm(n, m);
        for (auto [x, y] : v) bm.add_edge(x, y);
        ans += bm.run();
    }
    cout << ans << '\n';

}
0