結果
問題 | No.1023 Cyclic Tour |
ユーザー | satashun |
提出日時 | 2020-11-19 04:50:42 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 156 ms / 2,000 ms |
コード長 | 4,071 bytes |
コンパイル時間 | 2,951 ms |
コンパイル使用メモリ | 223,000 KB |
実行使用メモリ | 28,620 KB |
最終ジャッジ日時 | 2024-07-23 09:42:44 |
合計ジャッジ時間 | 11,582 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 47 ms
14,860 KB |
testcase_05 | AC | 46 ms
14,748 KB |
testcase_06 | AC | 50 ms
15,712 KB |
testcase_07 | AC | 48 ms
14,868 KB |
testcase_08 | AC | 76 ms
18,264 KB |
testcase_09 | AC | 73 ms
18,580 KB |
testcase_10 | AC | 76 ms
17,876 KB |
testcase_11 | AC | 79 ms
18,512 KB |
testcase_12 | AC | 88 ms
19,972 KB |
testcase_13 | AC | 74 ms
19,040 KB |
testcase_14 | AC | 79 ms
19,056 KB |
testcase_15 | AC | 83 ms
19,836 KB |
testcase_16 | AC | 156 ms
21,492 KB |
testcase_17 | AC | 144 ms
21,748 KB |
testcase_18 | AC | 147 ms
20,320 KB |
testcase_19 | AC | 136 ms
19,764 KB |
testcase_20 | AC | 76 ms
16,668 KB |
testcase_21 | AC | 77 ms
17,152 KB |
testcase_22 | AC | 101 ms
18,136 KB |
testcase_23 | AC | 110 ms
18,444 KB |
testcase_24 | AC | 137 ms
21,200 KB |
testcase_25 | AC | 77 ms
16,708 KB |
testcase_26 | AC | 77 ms
17,932 KB |
testcase_27 | AC | 74 ms
16,144 KB |
testcase_28 | AC | 123 ms
19,948 KB |
testcase_29 | AC | 130 ms
20,648 KB |
testcase_30 | AC | 123 ms
21,292 KB |
testcase_31 | AC | 119 ms
19,780 KB |
testcase_32 | AC | 122 ms
20,924 KB |
testcase_33 | AC | 118 ms
20,460 KB |
testcase_34 | AC | 86 ms
16,812 KB |
testcase_35 | AC | 78 ms
16,980 KB |
testcase_36 | AC | 88 ms
17,468 KB |
testcase_37 | AC | 107 ms
20,536 KB |
testcase_38 | AC | 123 ms
20,532 KB |
testcase_39 | AC | 111 ms
18,448 KB |
testcase_40 | AC | 110 ms
18,680 KB |
testcase_41 | AC | 109 ms
18,788 KB |
testcase_42 | AC | 78 ms
16,896 KB |
testcase_43 | AC | 122 ms
21,208 KB |
testcase_44 | AC | 45 ms
15,464 KB |
testcase_45 | AC | 94 ms
28,620 KB |
testcase_46 | AC | 85 ms
26,228 KB |
testcase_47 | AC | 45 ms
15,472 KB |
testcase_48 | AC | 76 ms
17,212 KB |
testcase_49 | AC | 77 ms
17,464 KB |
testcase_50 | AC | 75 ms
17,036 KB |
testcase_51 | AC | 74 ms
17,076 KB |
testcase_52 | AC | 76 ms
16,916 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; } template <class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; } template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif class unionfind { vector<int> par, rank; public: void init(int n) { par.resize(n); rank.resize(n); for (int i = 0; i < n; i++) { par[i] = i; rank[i] = 0; } } int find(int x) { if (par[x] == x) return x; else return par[x] = find(par[x]); } void unite(int x, int y) { x = find(x); y = find(y); if (x == y) return; if (rank[x] < rank[y]) par[x] = y; else { par[y] = x; if (rank[x] == rank[y]) ++rank[x]; } } bool same(int x, int y) { return (find(x) == find(y)); } }; struct SCC { int n; VV<int> g, rg; V<int> vs, cmp; V<bool> vis; SCC() {} SCC(int n) : n(n) { g = rg = VV<int>(n); vs = cmp = V<int>(n); vis = V<bool>(n); } void add_edge(int from, int to) { g[from].push_back(to); rg[to].push_back(from); } void dfs(int v) { vis[v] = true; for (int to : g[v]) { if (!vis[to]) { dfs(to); } } vs.push_back(v); } void rdfs(int v, int k, V<int>& vec) { vis[v] = true; cmp[v] = k; vec.push_back(v); for (int to : rg[v]) { if (!vis[to]) { rdfs(to, k, vec); } } } VV<int> calc() { rep(v, n) if (!vis[v]) dfs(v); fill(vis.begin(), vis.end(), false); int k = 0; reverse(vs.begin(), vs.end()); VV<int> vcomp; for (int v : vs) { if (!vis[v]) { V<int> vec; rdfs(v, k++, vec); vcomp.push_back(vec); } } return vcomp; } }; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int N, M; cin >> N >> M; unionfind uf; uf.init(N); V<pii> es; bool ok = 0; rep(i, M) { int a, b, c; cin >> a >> b >> c; --a, --b; if (c == 1) { if (uf.same(a, b)) ok = 1; uf.unite(a, b); } else { es.eb(a, b); } } SCC g(N); for (auto [a, b] : es) { a = uf.find(a), b = uf.find(b); g.add_edge(a, b); } auto v = g.calc(); for (auto [a, b] : es) { a = uf.find(a), b = uf.find(b); if (g.cmp[a] == g.cmp[b]) ok = 1; } cout << (ok ? "Yes" : "No") << endl; return 0; }