結果
問題 | No.1479 Matrix Eraser |
ユーザー | 👑 AngrySadEight |
提出日時 | 2023-10-04 18:21:47 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 435 ms / 3,000 ms |
コード長 | 4,442 bytes |
コンパイル時間 | 6,191 ms |
コンパイル使用メモリ | 244,444 KB |
実行使用メモリ | 27,988 KB |
最終ジャッジ日時 | 2024-07-26 14:50:49 |
合計ジャッジ時間 | 19,930 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 175 ms
15,020 KB |
testcase_01 | AC | 174 ms
15,116 KB |
testcase_02 | AC | 188 ms
15,040 KB |
testcase_03 | AC | 186 ms
15,008 KB |
testcase_04 | AC | 190 ms
15,048 KB |
testcase_05 | AC | 185 ms
15,028 KB |
testcase_06 | AC | 185 ms
15,028 KB |
testcase_07 | AC | 197 ms
16,200 KB |
testcase_08 | AC | 221 ms
16,964 KB |
testcase_09 | AC | 284 ms
19,152 KB |
testcase_10 | AC | 372 ms
22,628 KB |
testcase_11 | AC | 301 ms
19,820 KB |
testcase_12 | AC | 211 ms
16,488 KB |
testcase_13 | AC | 238 ms
17,012 KB |
testcase_14 | AC | 207 ms
16,472 KB |
testcase_15 | AC | 180 ms
15,388 KB |
testcase_16 | AC | 219 ms
16,840 KB |
testcase_17 | AC | 423 ms
23,956 KB |
testcase_18 | AC | 426 ms
24,020 KB |
testcase_19 | AC | 435 ms
24,068 KB |
testcase_20 | AC | 423 ms
24,140 KB |
testcase_21 | AC | 424 ms
23,956 KB |
testcase_22 | AC | 408 ms
24,072 KB |
testcase_23 | AC | 414 ms
24,056 KB |
testcase_24 | AC | 412 ms
24,108 KB |
testcase_25 | AC | 413 ms
24,112 KB |
testcase_26 | AC | 414 ms
24,116 KB |
testcase_27 | AC | 327 ms
23,016 KB |
testcase_28 | AC | 326 ms
23,084 KB |
testcase_29 | AC | 327 ms
23,116 KB |
testcase_30 | AC | 319 ms
22,872 KB |
testcase_31 | AC | 331 ms
22,976 KB |
testcase_32 | AC | 267 ms
27,988 KB |
testcase_33 | AC | 255 ms
27,928 KB |
testcase_34 | AC | 262 ms
27,820 KB |
testcase_35 | AC | 267 ms
27,864 KB |
testcase_36 | AC | 259 ms
27,924 KB |
testcase_37 | AC | 207 ms
22,736 KB |
testcase_38 | AC | 368 ms
21,296 KB |
testcase_39 | AC | 394 ms
24,840 KB |
testcase_40 | AC | 175 ms
15,084 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } ll my_pow(ll x, ll n, ll mod) { // 繰り返し二乗法.x^nをmodで割った余り. ll ret; if (n == 0) { ret = 1; } else if (n % 2 == 1) { ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod; } else { ret = my_pow((x * x) % mod, n / 2, mod); } return ret; } ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); } int main() { ll H, W; cin >> H >> W; vector<vector<ll>> A(H, vector<ll>(W)); for (ll i = 0; i < H; i++) { for (ll j = 0; j < W; j++) { cin >> A[i][j]; } } vector<vector<pll>> vals(500005, vector<pll>(0)); for (ll i = 0; i < H; i++) { for (ll j = 0; j < W; j++) { vals[A[i][j]].push_back(pll(i, j)); } } ll ans = 0; for (ll i = 1; i <= 500000; i++) { // 座標圧縮 map<ll, ll> mpx; map<ll, ll> mpy; for (ll j = 0; j < vals[i].size(); j++) { mpx[vals[i][j].first]++; mpy[vals[i][j].second]++; } ll nowx = 1; ll nowy = 1; for (auto itr = mpx.begin(); itr != mpx.end(); itr++) { itr->second = nowx; nowx++; } for (auto itr = mpy.begin(); itr != mpy.end(); itr++) { itr->second = nowy; nowy++; } mf_graph<ll> graph(nowx + nowy + 2); for (ll j = 0; j < nowx; j++) { graph.add_edge(nowx + nowy, j, 1); } for (ll j = 0; j < nowy; j++) { graph.add_edge(nowx + j, nowx + nowy + 1, 1); } for (ll j = 0; j < vals[i].size(); j++) { graph.add_edge(mpx[vals[i][j].first], nowx + mpy[vals[i][j].second], 1); } ll fl = graph.flow(nowx + nowy, nowx + nowy + 1); ans += fl; } cout << ans << endl; }