結果
問題 | No.1254 補強への架け橋 |
ユーザー | siman |
提出日時 | 2023-06-12 14:49:19 |
言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,825 bytes |
コンパイル時間 | 21,514 ms |
コンパイル使用メモリ | 96,776 KB |
実行使用メモリ | 26,624 KB |
最終ジャッジ日時 | 2023-09-02 09:46:30 |
合計ジャッジ時間 | 22,375 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 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 | 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,380 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 2 ms
4,376 KB |
testcase_15 | AC | 2 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,384 KB |
testcase_19 | AC | 2 ms
4,384 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,376 KB |
testcase_24 | AC | 2 ms
4,380 KB |
testcase_25 | AC | 2 ms
4,380 KB |
testcase_26 | AC | 2 ms
4,376 KB |
testcase_27 | AC | 2 ms
4,376 KB |
testcase_28 | AC | 2 ms
4,384 KB |
testcase_29 | AC | 2 ms
4,380 KB |
testcase_30 | AC | 2 ms
4,380 KB |
testcase_31 | AC | 2 ms
4,380 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,380 KB |
testcase_40 | AC | 2 ms
4,376 KB |
testcase_41 | AC | 2 ms
4,376 KB |
testcase_42 | AC | 2 ms
4,380 KB |
testcase_43 | AC | 3 ms
4,376 KB |
testcase_44 | AC | 2 ms
4,380 KB |
testcase_45 | AC | 2 ms
4,376 KB |
testcase_46 | AC | 3 ms
4,380 KB |
testcase_47 | AC | 3 ms
4,380 KB |
testcase_48 | AC | 3 ms
4,376 KB |
testcase_49 | AC | 2 ms
4,380 KB |
testcase_50 | AC | 3 ms
4,380 KB |
testcase_51 | AC | 3 ms
4,376 KB |
testcase_52 | AC | 3 ms
4,380 KB |
testcase_53 | AC | 3 ms
4,380 KB |
testcase_54 | AC | 3 ms
4,380 KB |
testcase_55 | AC | 3 ms
4,380 KB |
testcase_56 | AC | 2 ms
4,384 KB |
testcase_57 | AC | 3 ms
4,380 KB |
testcase_58 | AC | 3 ms
4,380 KB |
testcase_59 | AC | 2 ms
4,380 KB |
testcase_60 | AC | 2 ms
4,380 KB |
testcase_61 | AC | 3 ms
4,376 KB |
testcase_62 | AC | 2 ms
4,380 KB |
testcase_63 | AC | 21 ms
5,856 KB |
testcase_64 | AC | 6 ms
4,384 KB |
testcase_65 | AC | 12 ms
5,152 KB |
testcase_66 | AC | 12 ms
4,888 KB |
testcase_67 | AC | 5 ms
4,376 KB |
testcase_68 | AC | 11 ms
4,880 KB |
testcase_69 | AC | 14 ms
5,212 KB |
testcase_70 | AC | 6 ms
4,440 KB |
testcase_71 | AC | 5 ms
4,380 KB |
testcase_72 | AC | 19 ms
5,312 KB |
testcase_73 | AC | 6 ms
4,376 KB |
testcase_74 | AC | 15 ms
5,196 KB |
testcase_75 | AC | 10 ms
4,932 KB |
testcase_76 | AC | 4 ms
4,384 KB |
testcase_77 | AC | 9 ms
4,760 KB |
testcase_78 | AC | 20 ms
5,556 KB |
testcase_79 | AC | 17 ms
5,728 KB |
testcase_80 | AC | 14 ms
5,460 KB |
testcase_81 | AC | 16 ms
5,736 KB |
testcase_82 | AC | 19 ms
5,616 KB |
testcase_83 | AC | 422 ms
26,140 KB |
testcase_84 | AC | 377 ms
25,500 KB |
testcase_85 | AC | 173 ms
17,116 KB |
testcase_86 | AC | 314 ms
22,708 KB |
testcase_87 | AC | 296 ms
24,356 KB |
testcase_88 | AC | 31 ms
6,836 KB |
testcase_89 | AC | 333 ms
25,828 KB |
testcase_90 | AC | 215 ms
17,908 KB |
testcase_91 | AC | 155 ms
15,008 KB |
testcase_92 | AC | 70 ms
9,472 KB |
testcase_93 | AC | 217 ms
21,620 KB |
testcase_94 | AC | 286 ms
19,764 KB |
testcase_95 | AC | 270 ms
19,764 KB |
testcase_96 | AC | 336 ms
24,728 KB |
testcase_97 | AC | 117 ms
13,160 KB |
testcase_98 | AC | 307 ms
25,048 KB |
testcase_99 | AC | 180 ms
16,604 KB |
testcase_100 | AC | 364 ms
26,624 KB |
testcase_101 | AC | 62 ms
8,936 KB |
testcase_102 | AC | 27 ms
6,276 KB |
testcase_103 | AC | 56 ms
9,464 KB |
testcase_104 | AC | 80 ms
11,792 KB |
testcase_105 | AC | 249 ms
21,708 KB |
testcase_106 | AC | 137 ms
14,208 KB |
testcase_107 | AC | 435 ms
26,108 KB |
testcase_108 | AC | 294 ms
25,684 KB |
testcase_109 | AC | 332 ms
21,348 KB |
testcase_110 | AC | 189 ms
19,752 KB |
testcase_111 | AC | 297 ms
20,824 KB |
testcase_112 | AC | 95 ms
11,304 KB |
testcase_113 | AC | 275 ms
19,232 KB |
testcase_114 | AC | 127 ms
13,880 KB |
testcase_115 | AC | 36 ms
7,108 KB |
testcase_116 | AC | 184 ms
15,540 KB |
testcase_117 | AC | 94 ms
11,312 KB |
testcase_118 | AC | 298 ms
24,792 KB |
testcase_119 | AC | 165 ms
16,588 KB |
testcase_120 | AC | 265 ms
24,000 KB |
testcase_121 | AC | 66 ms
10,244 KB |
testcase_122 | AC | 148 ms
15,284 KB |
testcase_123 | AC | 2 ms
4,380 KB |
testcase_124 | RE | - |
testcase_125 | -- | - |
ソースコード
#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 = 100000; 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]) { 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 { int minV = INT_MAX; vector<int> res; for (int v : path) { vector<int> p = cycle_detection(v, G); int s = p.size(); if (minV > s) { minV = s; res = p; } } int L = res.size(); vector<int> ids; for (int i = 0; i < L; ++i) { int u = res[i]; int v = res[(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; }