結果
問題 | No.1023 Cyclic Tour |
ユーザー | ttttan2 |
提出日時 | 2020-04-10 23:22:55 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,893 bytes |
コンパイル時間 | 1,983 ms |
コンパイル使用メモリ | 178,924 KB |
実行使用メモリ | 55,900 KB |
最終ジャッジ日時 | 2023-10-14 05:41:20 |
合計ジャッジ時間 | 37,516 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
10,592 KB |
testcase_01 | AC | 6 ms
10,408 KB |
testcase_02 | AC | 5 ms
10,396 KB |
testcase_03 | AC | 5 ms
10,464 KB |
testcase_04 | AC | 336 ms
31,792 KB |
testcase_05 | AC | 341 ms
31,900 KB |
testcase_06 | AC | 396 ms
34,540 KB |
testcase_07 | AC | 374 ms
32,908 KB |
testcase_08 | AC | 357 ms
33,708 KB |
testcase_09 | AC | 346 ms
33,320 KB |
testcase_10 | AC | 335 ms
32,608 KB |
testcase_11 | AC | 393 ms
34,956 KB |
testcase_12 | AC | 359 ms
33,344 KB |
testcase_13 | AC | 338 ms
31,940 KB |
testcase_14 | AC | 332 ms
31,860 KB |
testcase_15 | AC | 358 ms
33,060 KB |
testcase_16 | AC | 754 ms
50,868 KB |
testcase_17 | AC | 790 ms
51,936 KB |
testcase_18 | AC | 821 ms
52,636 KB |
testcase_19 | AC | 777 ms
50,924 KB |
testcase_20 | AC | 853 ms
53,212 KB |
testcase_21 | AC | 856 ms
53,644 KB |
testcase_22 | AC | 851 ms
52,564 KB |
testcase_23 | AC | 883 ms
54,204 KB |
testcase_24 | AC | 882 ms
54,352 KB |
testcase_25 | AC | 859 ms
53,112 KB |
testcase_26 | AC | 852 ms
52,804 KB |
testcase_27 | AC | 810 ms
51,052 KB |
testcase_28 | AC | 842 ms
53,468 KB |
testcase_29 | WA | - |
testcase_30 | AC | 890 ms
54,600 KB |
testcase_31 | AC | 781 ms
52,296 KB |
testcase_32 | AC | 822 ms
55,240 KB |
testcase_33 | AC | 848 ms
55,900 KB |
testcase_34 | AC | 812 ms
52,184 KB |
testcase_35 | AC | 855 ms
53,744 KB |
testcase_36 | AC | 844 ms
53,120 KB |
testcase_37 | AC | 808 ms
54,164 KB |
testcase_38 | AC | 786 ms
51,852 KB |
testcase_39 | AC | 838 ms
53,104 KB |
testcase_40 | AC | 819 ms
53,004 KB |
testcase_41 | AC | 814 ms
53,156 KB |
testcase_42 | WA | - |
testcase_43 | AC | 762 ms
50,484 KB |
testcase_44 | AC | 369 ms
32,428 KB |
testcase_45 | AC | 321 ms
43,600 KB |
testcase_46 | AC | 312 ms
43,412 KB |
testcase_47 | AC | 313 ms
40,300 KB |
testcase_48 | AC | 727 ms
54,816 KB |
testcase_49 | AC | 774 ms
54,792 KB |
testcase_50 | AC | 734 ms
54,680 KB |
testcase_51 | AC | 736 ms
54,740 KB |
testcase_52 | AC | 768 ms
54,692 KB |
ソースコード
#include<bits/stdc++.h> //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); //clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl; using namespace std; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<int,int> pii; typedef pair<pii,int> ppii; typedef pair<int,pii> pipi; typedef pair<ll,ll> pll; typedef pair<pll,ll> ppll; typedef pair<ll,pll> plpl; typedef pair<pii,pii> P; typedef tuple<ll,ll,ll> tl; typedef pair<double,double> pdd; typedef vector<vector<ll>> mat; ll mod=1000000007; ll mod2=998244353; ll mod3=1000003; ll mod4=998244853; ll mod5=1000000009; ll inf=1LL<<60; double pi=3.141592653589793238462643383279L; double eps=1e-14; #define rep(i,m,n) for(ll i=m;i<n;i++) #define rrep(i,n,m) for(ll i=n;i>=m;i--) #define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++) #define mrep(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++) #define Max(a,b) a=max(a,b) #define Min(a,b) a=min(a,b) int dh[4]={1,-1,0,0}; int dw[4]={0,0,1,-1}; int ddh[8]={-1,-1,-1,0,0,1,1,1}; int ddw[8]={-1,0,1,-1,1,-1,0,1}; struct custom_hash { static uint64_t splitmix64(uint64_t x) { // http://xorshift.di.unimi.it/splitmix64.c x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; #define umh unordered_map<ll,ll,custom_hash> ll gcd(ll a,ll b){ if(a<b)swap(a,b); if(b==0)return a; if(a%b==0)return b; return gcd(b,a%b); } ll lcm(ll a,ll b){ ll c=gcd(a,b); return a*b/c; } ll Pow(ll n,ll k){ ll ret=1; ll now=n; while(k>0){ if(k&1)ret*=now; now*=now; k/=2; } return ret; } ll beki(ll n,ll k,ll md){ ll ret=1; ll now=n; now%=md; while(k>0){ if(k%2==1){ ret*=now; ret%=md; } now*=now; now%=md; k/=2; } return ret; } ll gyaku(ll n,ll md){ return beki(n,md-2,md); } ll popcount(ll n){ ll ret=0; ll u=n; while(u>0){ ret+=u%2; u/=2; } return ret; } bool used[100001],used2[100001]; vector<int> v[100001],w[100001],vc[100001]; bool dfs(int now,int par,int c){ used2[now]=true; bool ret=false; if(c==1){ rep(i,0,v[now].size()){ int ne=v[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne])continue; used[ne]=true; ret=dfs(ne,now,1); if(ret)break; used[ne]=false; } rep(i,0,vc[now].size()){ int ne=vc[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne])continue; used[ne]=true; ret=dfs(ne,now,1); if(ret)break; used[ne]=false; } } else if(c==0){ rep(i,0,vc[now].size()){ int ne=vc[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne])continue; used[ne]=true; ret=dfs(ne,now,0); if(ret)break; used[ne]=false; } rep(i,0,v[now].size()){ int ne=v[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne])continue; used[ne]=true; ret=dfs(ne,now,1); if(ret)break; used[ne]=false; } rep(i,0,w[now].size()){ int ne=w[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne])continue; used[ne]=true; ret=dfs(ne,now,2); if(ret)break; used[ne]=false; } } else if(c==2){ rep(i,0,w[now].size()){ int ne=w[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne])continue; used[ne]=true; ret=dfs(ne,now,2); if(ret)break; used[ne]=false; } rep(i,0,vc[now].size()){ int ne=vc[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne])continue; used[ne]=true; ret=dfs(ne,now,2); if(ret)break; used[ne]=false; } } return ret; } int main(){ ios::sync_with_stdio(false);cin.tie(0); int n,m;cin>>n>>m; map<pii,int> mp,mp2; int win=0; rep(i,0,m){ int a,b,c;cin>>a>>b>>c; a--; b--; if(c==1){ if(a>b)swap(a,b); mp[{a,b}]++; if(mp[{a,b}]>=2||(mp[{a,b}]==1&&(mp2[{a,b}]>=1||mp2[{b,a}]>=1)))win=1; } else{ mp2[{a,b}]++; if(mp2[{a,b}]>=1&&mp2[{b,a}]>=1)win=1; if((mp[{min(b,a),max(a,b)}]>=1&&(mp2[{a,b}]>=1||mp2[{b,a}]>=1)))win=1; } if(c==1){ vc[a].push_back(b); vc[b].push_back(a); } else{ v[a].push_back(b); w[b].push_back(a); } } if(win){ cout<<"Yes"<<endl; return 0; } fill(used,used+n,false); fill(used2,used2+n,false); rep(i,0,n){ if(used2[i])continue; used[i]=true; bool ok=dfs(i,-1,0); if(ok){ cout<<"Yes"<<endl; return 0; } used[i]=false; } cout<<"No"<<endl; }