結果
問題 | No.1023 Cyclic Tour |
ユーザー | carrot46 |
提出日時 | 2020-04-10 22:41:53 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 182 ms / 2,000 ms |
コード長 | 2,294 bytes |
コンパイル時間 | 1,897 ms |
コンパイル使用メモリ | 175,540 KB |
実行使用メモリ | 18,176 KB |
最終ジャッジ日時 | 2024-09-15 21:20:08 |
合計ジャッジ時間 | 10,999 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
6,400 KB |
testcase_01 | AC | 5 ms
6,272 KB |
testcase_02 | AC | 5 ms
6,272 KB |
testcase_03 | AC | 4 ms
6,400 KB |
testcase_04 | AC | 81 ms
9,984 KB |
testcase_05 | AC | 81 ms
10,112 KB |
testcase_06 | AC | 86 ms
10,496 KB |
testcase_07 | AC | 84 ms
10,240 KB |
testcase_08 | AC | 91 ms
11,520 KB |
testcase_09 | AC | 90 ms
11,648 KB |
testcase_10 | AC | 89 ms
11,520 KB |
testcase_11 | AC | 99 ms
11,776 KB |
testcase_12 | AC | 93 ms
12,416 KB |
testcase_13 | AC | 88 ms
12,032 KB |
testcase_14 | AC | 85 ms
12,160 KB |
testcase_15 | AC | 91 ms
12,032 KB |
testcase_16 | AC | 159 ms
15,488 KB |
testcase_17 | AC | 164 ms
15,744 KB |
testcase_18 | AC | 171 ms
15,616 KB |
testcase_19 | AC | 162 ms
15,360 KB |
testcase_20 | AC | 164 ms
13,696 KB |
testcase_21 | AC | 167 ms
13,696 KB |
testcase_22 | AC | 170 ms
13,952 KB |
testcase_23 | AC | 179 ms
14,336 KB |
testcase_24 | AC | 182 ms
15,360 KB |
testcase_25 | AC | 164 ms
13,568 KB |
testcase_26 | AC | 164 ms
13,824 KB |
testcase_27 | AC | 159 ms
13,312 KB |
testcase_28 | AC | 175 ms
15,104 KB |
testcase_29 | AC | 168 ms
15,232 KB |
testcase_30 | AC | 177 ms
15,232 KB |
testcase_31 | AC | 166 ms
14,592 KB |
testcase_32 | AC | 170 ms
16,256 KB |
testcase_33 | AC | 180 ms
15,360 KB |
testcase_34 | AC | 66 ms
12,160 KB |
testcase_35 | AC | 144 ms
12,288 KB |
testcase_36 | AC | 168 ms
13,824 KB |
testcase_37 | AC | 171 ms
15,104 KB |
testcase_38 | AC | 162 ms
15,360 KB |
testcase_39 | AC | 176 ms
14,336 KB |
testcase_40 | AC | 172 ms
14,336 KB |
testcase_41 | AC | 172 ms
14,336 KB |
testcase_42 | AC | 163 ms
13,056 KB |
testcase_43 | AC | 155 ms
13,568 KB |
testcase_44 | AC | 85 ms
10,240 KB |
testcase_45 | AC | 101 ms
18,048 KB |
testcase_46 | AC | 101 ms
18,176 KB |
testcase_47 | AC | 86 ms
10,112 KB |
testcase_48 | AC | 168 ms
13,684 KB |
testcase_49 | AC | 168 ms
13,688 KB |
testcase_50 | AC | 163 ms
13,816 KB |
testcase_51 | AC | 160 ms
12,800 KB |
testcase_52 | AC | 168 ms
13,056 KB |
ソースコード
#include <bits/stdc++.h>#include <iomanip>using namespace std;#define reps(i,s,n) for(int i = s; i < n; i++)#define rep(i,n) reps(i,0,n)#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)#define Rrep(i,n) Rreps(i,n,0)#define ALL(a) a.begin(), a.end()#define fi first#define se secondtypedef long long ll;typedef vector<ll> vec;typedef vector<vec> mat;ll N,M,H,W,K,Q,A,B;string S;const ll MOD = 998244353;//const ll MOD = (1e+9) + 7;const ll INF = 1LL<<60;typedef pair<ll, ll> P;class union_find{vector<long> parent, tree_size;public:union_find(unsigned long _n) : parent(_n), tree_size(_n, 1){for(unsigned long i = 0; i < _n; ++i)parent[i] = i;}ll find(ll x){while(parent[x] != x)x = parent[x] = parent[parent[x]];return x;}void merge(ll a, ll b){a = find(a);b = find(b);if(a==b) return;if(tree_size[a] < tree_size[b])swap(a, b);tree_size[a] += tree_size[b];parent[b] = a;return;}bool same(ll a, ll b){a = find(a);b = find(b);return a == b;}ll p(ll a){return find(a);};};mat G(int(1e+5) + 1, vec(0));vec used(int(1e+5) + 10, 0);bool dfs(int v){used[v] = 1;for(ll to : G[v]){if(used[to] == 0) {if(dfs(to)) return true;}else if(used[to] == 1){return true;}}used[v] = 2;return false;}int main() {cin>>N>>M;union_find uf(N + 10);vec a(M), b(M), c(M);rep(i,M) {cin>>a[i]>>b[i]>>c[i];--a[i];--b[i];if(c[i] == 1){if(uf.same(a[i], b[i])){cout<<"Yes"<<endl;return 0;}uf.merge(a[i], b[i]);}}rep(i,M){if(c[i] == 2){ll pa = uf.p(a[i]), pb = uf.p(b[i]);if(uf.same(pa, pb)){cout<<"Yes"<<endl;return 0;}G[pa].push_back(pb);}}int k = 0;rep(i,N){if(used[i] == 0) {if (dfs(i)) {cout << "Yes" << endl;return 0;}}}cout<<"No"<<endl;}