結果
問題 | No.1023 Cyclic Tour |
ユーザー | hiroaki0615 |
提出日時 | 2020-04-10 23:12:04 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,284 bytes |
コンパイル時間 | 1,799 ms |
コンパイル使用メモリ | 95,416 KB |
実行使用メモリ | 31,388 KB |
最終ジャッジ日時 | 2023-10-14 04:41:14 |
合計ジャッジ時間 | 11,015 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 28 ms
5,584 KB |
testcase_05 | AC | 29 ms
5,436 KB |
testcase_06 | AC | 32 ms
5,324 KB |
testcase_07 | AC | 30 ms
5,408 KB |
testcase_08 | AC | 124 ms
14,828 KB |
testcase_09 | AC | 115 ms
14,372 KB |
testcase_10 | AC | 116 ms
14,684 KB |
testcase_11 | AC | 131 ms
15,172 KB |
testcase_12 | AC | 171 ms
18,632 KB |
testcase_13 | AC | 160 ms
17,808 KB |
testcase_14 | AC | 149 ms
17,780 KB |
testcase_15 | AC | 168 ms
17,732 KB |
testcase_16 | AC | 248 ms
20,428 KB |
testcase_17 | AC | 251 ms
20,636 KB |
testcase_18 | AC | 244 ms
19,140 KB |
testcase_19 | AC | 250 ms
19,228 KB |
testcase_20 | AC | 71 ms
7,352 KB |
testcase_21 | AC | 74 ms
7,528 KB |
testcase_22 | AC | 137 ms
11,088 KB |
testcase_23 | AC | 156 ms
11,732 KB |
testcase_24 | AC | 232 ms
17,224 KB |
testcase_25 | AC | 75 ms
7,372 KB |
testcase_26 | AC | 75 ms
7,464 KB |
testcase_27 | AC | 64 ms
7,116 KB |
testcase_28 | AC | 214 ms
16,408 KB |
testcase_29 | AC | 245 ms
18,632 KB |
testcase_30 | AC | 209 ms
15,964 KB |
testcase_31 | AC | 179 ms
15,216 KB |
testcase_32 | AC | 206 ms
19,172 KB |
testcase_33 | AC | 193 ms
15,936 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 107 ms
8,604 KB |
testcase_37 | AC | 162 ms
15,108 KB |
testcase_38 | AC | 213 ms
18,352 KB |
testcase_39 | AC | 160 ms
12,324 KB |
testcase_40 | AC | 168 ms
13,256 KB |
testcase_41 | AC | 163 ms
13,112 KB |
testcase_42 | AC | 70 ms
7,440 KB |
testcase_43 | AC | 225 ms
17,220 KB |
testcase_44 | AC | 33 ms
5,508 KB |
testcase_45 | AC | 163 ms
31,348 KB |
testcase_46 | AC | 161 ms
31,388 KB |
testcase_47 | AC | 27 ms
5,336 KB |
testcase_48 | AC | 58 ms
7,356 KB |
testcase_49 | AC | 59 ms
7,376 KB |
testcase_50 | AC | 54 ms
7,160 KB |
testcase_51 | AC | 56 ms
7,328 KB |
testcase_52 | AC | 55 ms
7,252 KB |
ソースコード
#include<iostream> #include<vector> #include<string> #include<set> #include<map> #define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i) #define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i) #define all(x) (x).begin(), (x).end() using namespace std; using ll = long long; template<typename T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return 0;} template<typename T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return 0;} class UnionFind { private: vector<int> parent_; vector<int> node_rank_; vector<int> sizes_; public: UnionFind(int node_num): parent_(vector<int>(node_num)), node_rank_(vector<int>(node_num)), sizes_(vector<int>(node_num)) { for (int i = 0; i < node_num; ++i) { parent_[i] = i; node_rank_[i] = 0; sizes_[i] = 1; } } int getRoot(int u) { return parent_[u] == u ? u : parent_[u] = getRoot(parent_[u]); } bool isSame(int u, int v) { return getRoot(u) == getRoot(v); } void unite(int u, int v) { u = getRoot(u); v = getRoot(v); if (u == v) return; if (node_rank_[u] < node_rank_[v]) { parent_[u] = v; sizes_[v] += sizes_[u]; } else { parent_[v] = u; sizes_[u] += sizes_[v]; if (node_rank_[u] == node_rank_[v]) { node_rank_[u]++; } } } int getSize(int u) { return sizes_[getRoot(u)]; } }; void dfs(const vector<vector<int>>& graph, vector<bool>& seen, vector<bool>& finished, int node, bool& pos) { seen[node] = true; for (auto& next_node : graph[node]) { if (finished[next_node]) { continue; } if (seen[next_node] && !finished[next_node]) { pos = true; return; } dfs(graph, seen, finished, next_node, pos); if (pos) { return; } } finished[node] = true; } int main() { cin.tie(0); ios::sync_with_stdio(false); int N, M; cin >> N >> M; vector<int> A(M), B(M), C(M); rep(i, 0, M) { cin >> A[i] >> B[i] >> C[i]; --A[i], --B[i]; } UnionFind uf(N); rep(i, 0, M) { if (C[i] == 1) { uf.unite(A[i], B[i]); } } set<int> S; rep(i, 0, N) { S.insert(uf.getRoot(i)); } map<int, int> node_map; int node = 0; for (auto s : S) { node_map[s] = node++; } vector<vector<int>> graph(node); rep(i, 0, M) { if (C[i] == 2) { int u = node_map[uf.getRoot(A[i])]; int v = node_map[uf.getRoot(B[i])]; graph[u].push_back(v); } } vector<bool> seen(node, false), finished(node, false); rep(i, 0, node) { if (!finished[i]) { bool pos = false; dfs(graph, seen, finished, i, pos); if (pos) { cout << "Yes" << endl; return 0; } } } cout << "No" << endl; return 0; }