結果
問題 | No.3107 Listening |
ユーザー | 👑 binap |
提出日時 | 2024-04-01 21:50:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,468 bytes |
コンパイル時間 | 4,383 ms |
コンパイル使用メモリ | 282,392 KB |
実行使用メモリ | 109,640 KB |
最終ジャッジ日時 | 2024-09-30 22:21:07 |
合計ジャッジ時間 | 11,642 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
10,496 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | TLE | - |
testcase_04 | AC | 254 ms
22,972 KB |
testcase_05 | AC | 581 ms
27,696 KB |
testcase_06 | AC | 351 ms
28,096 KB |
testcase_07 | AC | 1,616 ms
64,516 KB |
testcase_08 | AC | 907 ms
37,632 KB |
testcase_09 | AC | 1,219 ms
63,508 KB |
testcase_10 | TLE | - |
testcase_11 | TLE | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} //https://ei1333.github.io/library/graph/flow/gabow-edmonds.hpp.html // https://qiita.com/Kutimoti_T/items/5b579773e0a24d650bdf /** * @brief Gabow Edmonds(一般グラフの最大マッチング) * @docs docs/gabow-edmonds.md */ struct GabowEdmonds { struct edge { int to, idx; }; vector< vector< edge > > g; vector< pair< int, int > > edges; vector< int > mate, label, first; queue< int > que; GabowEdmonds(int n) : g(n + 1), mate(n + 1), label(n + 1, -1), first(n + 1) {} void add_edge(int u, int v) { ++u, ++v; g[u].push_back((edge) {v, (int) (edges.size() + g.size())}); g[v].push_back((edge) {u, (int) (edges.size() + g.size())}); edges.emplace_back(u, v); } int find(int x) { if(label[first[x]] < 0) return first[x]; first[x] = find(first[x]); return first[x]; } void rematch(int v, int w) { int t = mate[v]; mate[v] = w; if(mate[t] != v) return; if(label[v] < (int)g.size()) { mate[t] = label[v]; rematch(label[v], t); } else { int x = edges[label[v] - g.size()].first; int y = edges[label[v] - g.size()].second; rematch(x, y); rematch(y, x); } } void assign_label(int x, int y, int num) { int r = find(x); int s = find(y); int join = 0; if(r == s) return; label[r] = -num; label[s] = -num; while(true) { if(s != 0) swap(r, s); r = find(label[mate[r]]); if(label[r] == -num) { join = r; break; } label[r] = -num; } int v = first[x]; while(v != join) { que.push(v); label[v] = num; first[v] = join; v = first[label[mate[v]]]; } v = first[y]; while(v != join) { que.push(v); label[v] = num; first[v] = join; v = first[label[mate[v]]]; } } bool augment_check(int u) { que = queue< int >(); first[u] = 0; label[u] = 0; que.push(u); while(!que.empty()) { int x = que.front(); que.pop(); for(auto e : g[x]) { int y = e.to; if(mate[y] == 0 && y != u) { mate[y] = x; rematch(x, y); return true; } else if(label[y] >= 0) { assign_label(x, y, e.idx); } else if(label[mate[y]] < 0) { label[mate[y]] = x; first[mate[y]] = y; que.push(mate[y]); } } } return false; } vector< pair< int, int > > max_matching() { for(int i = 1; i < (int)g.size(); i++) { if(mate[i] != 0) continue; if(augment_check(i)) label.assign(g.size(), -1); } vector< pair< int, int > > ret; for(int i = 1; i < (int)g.size(); i++) { if(i < mate[i]) ret.emplace_back(i - 1, mate[i] - 1); } return ret; } }; int main() { int N, M; cin >> N >> M; GabowEdmonds flow(N); map<pair<int, int>, int> ma; for(int i = 0; i < M; i++) { int a, b; cin >> a >> b; a--; b--; ma[make_pair(a, b)] = i; ma[make_pair(b, a)] = i; flow.add_edge(a, b); } auto ret = flow.max_matching(); cout << ret.size() << endl; for(auto &p : ret) cout << ma[p] + 1 << endl; }