結果
問題 | No.1254 補強への架け橋 |
ユーザー | ei1333333 |
提出日時 | 2021-04-18 02:23:16 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 137 ms / 2,000 ms |
コード長 | 6,625 bytes |
コンパイル時間 | 3,753 ms |
コンパイル使用メモリ | 226,880 KB |
実行使用メモリ | 26,468 KB |
最終ジャッジ日時 | 2023-09-17 07:31:33 |
合計ジャッジ時間 | 15,010 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,384 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 2 ms
4,376 KB |
testcase_18 | AC | 2 ms
4,376 KB |
testcase_19 | AC | 1 ms
4,380 KB |
testcase_20 | AC | 1 ms
4,376 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 2 ms
4,380 KB |
testcase_23 | AC | 1 ms
4,376 KB |
testcase_24 | AC | 1 ms
4,380 KB |
testcase_25 | AC | 1 ms
4,380 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 1 ms
4,376 KB |
testcase_28 | AC | 2 ms
4,376 KB |
testcase_29 | AC | 1 ms
4,380 KB |
testcase_30 | AC | 1 ms
4,384 KB |
testcase_31 | AC | 2 ms
4,380 KB |
testcase_32 | AC | 2 ms
4,376 KB |
testcase_33 | AC | 2 ms
4,376 KB |
testcase_34 | AC | 2 ms
4,380 KB |
testcase_35 | AC | 1 ms
4,376 KB |
testcase_36 | AC | 1 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 2 ms
4,384 KB |
testcase_39 | AC | 2 ms
4,376 KB |
testcase_40 | AC | 1 ms
4,380 KB |
testcase_41 | AC | 1 ms
4,376 KB |
testcase_42 | AC | 1 ms
4,380 KB |
testcase_43 | AC | 2 ms
4,376 KB |
testcase_44 | AC | 2 ms
4,380 KB |
testcase_45 | AC | 2 ms
4,380 KB |
testcase_46 | AC | 2 ms
4,376 KB |
testcase_47 | AC | 2 ms
4,504 KB |
testcase_48 | AC | 2 ms
4,380 KB |
testcase_49 | AC | 1 ms
4,376 KB |
testcase_50 | AC | 2 ms
4,376 KB |
testcase_51 | AC | 2 ms
4,376 KB |
testcase_52 | AC | 2 ms
4,384 KB |
testcase_53 | AC | 2 ms
4,384 KB |
testcase_54 | AC | 2 ms
4,384 KB |
testcase_55 | AC | 2 ms
4,380 KB |
testcase_56 | AC | 2 ms
4,380 KB |
testcase_57 | AC | 2 ms
4,376 KB |
testcase_58 | AC | 2 ms
4,380 KB |
testcase_59 | AC | 2 ms
4,376 KB |
testcase_60 | AC | 2 ms
4,380 KB |
testcase_61 | AC | 3 ms
4,380 KB |
testcase_62 | AC | 2 ms
4,376 KB |
testcase_63 | AC | 9 ms
5,424 KB |
testcase_64 | AC | 4 ms
4,380 KB |
testcase_65 | AC | 6 ms
4,472 KB |
testcase_66 | AC | 5 ms
4,440 KB |
testcase_67 | AC | 3 ms
4,380 KB |
testcase_68 | AC | 5 ms
4,556 KB |
testcase_69 | AC | 7 ms
4,576 KB |
testcase_70 | AC | 4 ms
4,376 KB |
testcase_71 | AC | 3 ms
4,376 KB |
testcase_72 | AC | 7 ms
4,760 KB |
testcase_73 | AC | 4 ms
4,376 KB |
testcase_74 | AC | 7 ms
4,632 KB |
testcase_75 | AC | 5 ms
4,384 KB |
testcase_76 | AC | 2 ms
4,376 KB |
testcase_77 | AC | 5 ms
4,388 KB |
testcase_78 | AC | 8 ms
5,120 KB |
testcase_79 | AC | 9 ms
4,952 KB |
testcase_80 | AC | 7 ms
4,652 KB |
testcase_81 | AC | 8 ms
4,984 KB |
testcase_82 | AC | 8 ms
5,020 KB |
testcase_83 | AC | 112 ms
23,588 KB |
testcase_84 | AC | 103 ms
18,744 KB |
testcase_85 | AC | 56 ms
14,292 KB |
testcase_86 | AC | 88 ms
20,124 KB |
testcase_87 | AC | 97 ms
19,320 KB |
testcase_88 | AC | 14 ms
6,460 KB |
testcase_89 | AC | 111 ms
20,516 KB |
testcase_90 | AC | 64 ms
14,216 KB |
testcase_91 | AC | 46 ms
12,496 KB |
testcase_92 | AC | 23 ms
8,832 KB |
testcase_93 | AC | 85 ms
18,116 KB |
testcase_94 | AC | 75 ms
18,580 KB |
testcase_95 | AC | 73 ms
18,340 KB |
testcase_96 | AC | 108 ms
23,432 KB |
testcase_97 | AC | 37 ms
10,036 KB |
testcase_98 | AC | 103 ms
18,468 KB |
testcase_99 | AC | 56 ms
15,672 KB |
testcase_100 | AC | 124 ms
24,592 KB |
testcase_101 | AC | 21 ms
7,544 KB |
testcase_102 | AC | 11 ms
5,768 KB |
testcase_103 | AC | 22 ms
8,268 KB |
testcase_104 | AC | 32 ms
10,660 KB |
testcase_105 | AC | 80 ms
17,480 KB |
testcase_106 | AC | 44 ms
12,612 KB |
testcase_107 | AC | 115 ms
25,392 KB |
testcase_108 | AC | 112 ms
20,828 KB |
testcase_109 | AC | 83 ms
17,596 KB |
testcase_110 | AC | 72 ms
16,984 KB |
testcase_111 | AC | 79 ms
16,660 KB |
testcase_112 | AC | 31 ms
9,404 KB |
testcase_113 | AC | 72 ms
17,668 KB |
testcase_114 | AC | 45 ms
12,936 KB |
testcase_115 | AC | 14 ms
6,176 KB |
testcase_116 | AC | 51 ms
14,432 KB |
testcase_117 | AC | 34 ms
10,104 KB |
testcase_118 | AC | 102 ms
21,324 KB |
testcase_119 | AC | 56 ms
15,248 KB |
testcase_120 | AC | 98 ms
22,192 KB |
testcase_121 | AC | 26 ms
8,320 KB |
testcase_122 | AC | 50 ms
13,860 KB |
testcase_123 | AC | 1 ms
4,380 KB |
testcase_124 | AC | 136 ms
26,468 KB |
testcase_125 | AC | 137 ms
26,352 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 1e9 + 7; // const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } template< typename T = int > struct Edge { int from, to; T cost; int idx; Edge() = default; Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {} operator int() const { return to; } }; template< typename T = int > struct Graph { vector< vector< Edge< T > > > g; int es; Graph() = default; explicit Graph(int n) : g(n), es(0) {} size_t size() const { return g.size(); } void add_directed_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es++); } void add_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es); g[to].emplace_back(to, from, cost, es++); } void read(int M, int padding = -1, bool weighted = false, bool directed = false) { for(int i = 0; i < M; i++) { int a, b; cin >> a >> b; a += padding; b += padding; T c = T(1); if(weighted) cin >> c; if(directed) add_directed_edge(a, b, c); else add_edge(a, b, c); } } }; template< typename T = int > using Edges = vector< Edge< T > >; /** * @brief Namori-Graph * @docs docs/namori-graph.md */ template< typename T = int > struct NamoriGraph : Graph< T > { public: using Graph< T >::Graph; using Graph< T >::g; vector< Graph< T > > forest; Edges< T > loop_edges; struct Info { int forest_id, id; }; Info operator[](const int &k) const { return (Info) {mark_id[k], id[k]}; } int inv(int forest_id, int k) { return iv[forest_id][k]; } size_t loop_size() { return forest.size(); } void build() { int n = (int) g.size(); vector< int > deg(n), used(n); queue< int > que; for(int i = 0; i < n; i++) { deg[i] = (int) g[i].size(); if(deg[i] == 1) { que.emplace(i); used[i] = true; } } while(not que.empty()) { int idx = que.front(); que.pop(); for(auto &e : g[idx]) { if(used[e.to]) { continue; } --deg[e.to]; if(deg[e.to] == 1) { que.emplace(e.to); used[e.to] = true; } } } int mx = 0; for(auto &edges : g) { for(auto &e : edges) mx = max(mx, e.idx); } vector< int > edge_used(mx + 1); vector< int > loop; for(int v = 0; v < n; v++) { if(!used[v]) { for(bool update = true; update;) { update = false; loop.emplace_back(v); for(auto &e : g[v]) { if(used[e.to] or edge_used[e.idx]) { continue; } edge_used[e.idx] = true; loop_edges.emplace_back(loop.size() - 1, loop.size(), e.cost, e.idx); v = e.to; update = true; break; } } break; } } loop.pop_back(); loop_edges.back().to = 0; mark_id.resize(n); id.resize(n); int ptr = 0; for(int i = 0; i < (int) loop.size(); i++) { int pre = loop[(i + loop.size() - 1) % loop.size()]; int nxt = loop[(i + 1) % loop.size()]; int sz = 0; mark_id[loop[i]] = ptr; iv.emplace_back(); id[loop[i]] = sz++; iv.back().emplace_back(loop[i]); for(auto &e : g[loop[i]]) { if(e.to != pre and e.to != nxt) { mark_dfs(e.to, loop[i], ptr, sz); } } Graph< T > tree(sz); for(auto &e : g[loop[i]]) { if(e.to != pre and e.to != nxt) { tree.g[id[loop[i]]].emplace_back(id[loop[i]], id[e.to], e.cost, e.idx); tree.g[id[e.to]].emplace_back(id[e.to], id[loop[i]], e.cost, e.idx); build_dfs(e.to, loop[i], tree); } } forest.emplace_back(tree); } } private: vector< vector< int > > iv; vector< int > mark_id, id; void mark_dfs(int idx, int par, int k, int &l) { mark_id[idx] = k; id[idx] = l++; iv.back().emplace_back(idx); for(auto &e : g[idx]) { if(e.to != par) { mark_dfs(e.to, idx, k, l); } } } void build_dfs(int idx, int par, Graph< T > &tree) { for(auto &e : g[idx]) { if(e.to != par) { tree.g[id[idx]].emplace_back(id[idx], id[e.to], e.cost, e.idx); tree.g[id[e.to]].emplace_back(id[e.to], id[idx], e.cost, e.idx); build_dfs(e.to, idx, tree); } } } }; int main() { int N; cin >> N; NamoriGraph< int > g(N); g.read(N); g.build(); vector< int > ans; for(auto &e : g.loop_edges) { ans.emplace_back(e.idx + 1); } sort(begin(ans), end(ans)); cout << ans.size() << "\n"; cout << ans << "\n"; }