結果
問題 | No.1254 補強への架け橋 |
ユーザー | siman |
提出日時 | 2023-06-12 15:10:08 |
言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 380 ms / 2,000 ms |
コード長 | 1,723 bytes |
コンパイル時間 | 17,869 ms |
コンパイル使用メモリ | 93,796 KB |
実行使用メモリ | 35,332 KB |
最終ジャッジ日時 | 2023-09-02 10:02:03 |
合計ジャッジ時間 | 20,574 ms |
ジャッジサーバーID (参考情報) |
judge16 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,384 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 2 ms
4,376 KB |
testcase_15 | AC | 2 ms
4,384 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 2 ms
4,376 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 2 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 2 ms
4,380 KB |
testcase_23 | AC | 2 ms
4,380 KB |
testcase_24 | AC | 2 ms
4,384 KB |
testcase_25 | AC | 2 ms
4,380 KB |
testcase_26 | AC | 2 ms
4,384 KB |
testcase_27 | AC | 2 ms
4,384 KB |
testcase_28 | AC | 2 ms
4,376 KB |
testcase_29 | AC | 1 ms
4,380 KB |
testcase_30 | AC | 2 ms
4,380 KB |
testcase_31 | AC | 2 ms
4,376 KB |
testcase_32 | AC | 2 ms
4,380 KB |
testcase_33 | AC | 2 ms
4,380 KB |
testcase_34 | AC | 2 ms
4,380 KB |
testcase_35 | AC | 2 ms
4,380 KB |
testcase_36 | AC | 2 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 2 ms
4,380 KB |
testcase_39 | AC | 2 ms
4,376 KB |
testcase_40 | AC | 2 ms
4,380 KB |
testcase_41 | AC | 2 ms
4,376 KB |
testcase_42 | AC | 1 ms
4,376 KB |
testcase_43 | AC | 3 ms
4,380 KB |
testcase_44 | AC | 2 ms
4,380 KB |
testcase_45 | AC | 2 ms
4,380 KB |
testcase_46 | AC | 3 ms
4,380 KB |
testcase_47 | AC | 2 ms
4,380 KB |
testcase_48 | AC | 2 ms
4,380 KB |
testcase_49 | AC | 2 ms
4,380 KB |
testcase_50 | AC | 2 ms
4,380 KB |
testcase_51 | AC | 2 ms
4,380 KB |
testcase_52 | AC | 3 ms
4,380 KB |
testcase_53 | AC | 2 ms
4,376 KB |
testcase_54 | AC | 3 ms
4,380 KB |
testcase_55 | AC | 2 ms
4,380 KB |
testcase_56 | AC | 2 ms
4,380 KB |
testcase_57 | AC | 2 ms
4,380 KB |
testcase_58 | AC | 2 ms
4,380 KB |
testcase_59 | AC | 2 ms
4,376 KB |
testcase_60 | AC | 3 ms
4,376 KB |
testcase_61 | AC | 3 ms
4,376 KB |
testcase_62 | AC | 2 ms
4,376 KB |
testcase_63 | AC | 16 ms
5,884 KB |
testcase_64 | AC | 5 ms
4,380 KB |
testcase_65 | AC | 10 ms
5,108 KB |
testcase_66 | AC | 9 ms
4,924 KB |
testcase_67 | AC | 4 ms
4,384 KB |
testcase_68 | AC | 9 ms
4,888 KB |
testcase_69 | AC | 11 ms
5,244 KB |
testcase_70 | AC | 6 ms
4,532 KB |
testcase_71 | AC | 5 ms
4,380 KB |
testcase_72 | AC | 12 ms
5,352 KB |
testcase_73 | AC | 5 ms
4,400 KB |
testcase_74 | AC | 11 ms
5,276 KB |
testcase_75 | AC | 9 ms
5,008 KB |
testcase_76 | AC | 3 ms
4,380 KB |
testcase_77 | AC | 8 ms
4,760 KB |
testcase_78 | AC | 14 ms
5,652 KB |
testcase_79 | AC | 14 ms
5,660 KB |
testcase_80 | AC | 12 ms
5,404 KB |
testcase_81 | AC | 14 ms
5,824 KB |
testcase_82 | AC | 13 ms
5,516 KB |
testcase_83 | AC | 249 ms
26,156 KB |
testcase_84 | AC | 250 ms
25,568 KB |
testcase_85 | AC | 133 ms
17,168 KB |
testcase_86 | AC | 212 ms
22,676 KB |
testcase_87 | AC | 229 ms
24,224 KB |
testcase_88 | AC | 22 ms
6,832 KB |
testcase_89 | AC | 273 ms
25,888 KB |
testcase_90 | AC | 153 ms
17,892 KB |
testcase_91 | AC | 103 ms
14,992 KB |
testcase_92 | AC | 46 ms
9,512 KB |
testcase_93 | AC | 182 ms
21,624 KB |
testcase_94 | AC | 174 ms
19,736 KB |
testcase_95 | AC | 184 ms
19,772 KB |
testcase_96 | AC | 250 ms
24,820 KB |
testcase_97 | AC | 86 ms
13,140 KB |
testcase_98 | AC | 243 ms
25,112 KB |
testcase_99 | AC | 133 ms
16,644 KB |
testcase_100 | AC | 273 ms
26,608 KB |
testcase_101 | AC | 42 ms
9,004 KB |
testcase_102 | AC | 20 ms
6,284 KB |
testcase_103 | AC | 49 ms
9,424 KB |
testcase_104 | AC | 72 ms
11,824 KB |
testcase_105 | AC | 184 ms
21,580 KB |
testcase_106 | AC | 106 ms
14,208 KB |
testcase_107 | AC | 261 ms
26,040 KB |
testcase_108 | AC | 254 ms
25,556 KB |
testcase_109 | AC | 205 ms
21,360 KB |
testcase_110 | AC | 171 ms
19,836 KB |
testcase_111 | AC | 207 ms
20,892 KB |
testcase_112 | AC | 64 ms
11,296 KB |
testcase_113 | AC | 168 ms
19,320 KB |
testcase_114 | AC | 93 ms
13,936 KB |
testcase_115 | AC | 26 ms
7,148 KB |
testcase_116 | AC | 110 ms
15,520 KB |
testcase_117 | AC | 67 ms
11,300 KB |
testcase_118 | AC | 252 ms
24,840 KB |
testcase_119 | AC | 141 ms
16,532 KB |
testcase_120 | AC | 244 ms
23,972 KB |
testcase_121 | AC | 60 ms
10,328 KB |
testcase_122 | AC | 116 ms
15,364 KB |
testcase_123 | AC | 2 ms
4,380 KB |
testcase_124 | AC | 380 ms
35,332 KB |
testcase_125 | AC | 376 ms
35,216 KB |
ソースコード
#include <algorithm> #include <iostream> #include <stack> #include <string.h> #include <vector> #include <map> #include <climits> using namespace std; typedef vector <vector<int>> Graph; const int MAX_N = 100001; int root; bool visited[MAX_N]; bool finished[MAX_N]; void dfs(int u, int parent, const Graph &G, stack<int> &path) { visited[u] = true; path.push(u); for (int v : G[u]) { if (v == parent) continue; if (finished[v]) continue; if (visited[v] && !finished[v]) { path.push(v); root = v; return; } dfs(v, u, G, path); if (root != -1) return; } path.pop(); finished[u] = true; } vector<int> cycle_detection(int start, const Graph &G) { root = -1; memset(visited, false, sizeof(visited)); memset(finished, false, sizeof(finished)); stack<int> path; dfs(start, -1, G, path); vector<int> res; while (!path.empty()) { res.push_back(path.top()); path.pop(); } return res; } int main() { int N; cin >> N; Graph G(N + 1); map<int, map<int, int>> E; int a, b; for (int i = 0; i < N; ++i) { cin >> a >> b; E[a][b] = i + 1; E[b][a] = i + 1; G[a].push_back(b); G[b].push_back(a); } vector<int> path = cycle_detection(1, G); if (path.empty()) { cout << -1 << endl; } else { while (path[0] != path.back()) { path.pop_back(); } path.pop_back(); int L = path.size(); vector<int> ids; for (int i = 0; i < L; ++i) { int u = path[i]; int v = path[(i + 1) % L]; ids.push_back(E[u][v]); } sort(ids.begin(), ids.end()); cout << L << endl; for (int id : ids) { cout << id << " "; } cout << endl; } return 0; }