結果
問題 | No.1023 Cyclic Tour |
ユーザー |
![]() |
提出日時 | 2020-04-11 00:09:53 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 851 ms / 2,000 ms |
コード長 | 6,148 bytes |
コンパイル時間 | 1,791 ms |
コンパイル使用メモリ | 180,332 KB |
実行使用メモリ | 56,180 KB |
最終ジャッジ日時 | 2023-10-14 08:58:56 |
合計ジャッジ時間 | 36,810 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
10,808 KB |
testcase_01 | AC | 6 ms
10,596 KB |
testcase_02 | AC | 5 ms
10,304 KB |
testcase_03 | AC | 6 ms
10,748 KB |
testcase_04 | AC | 342 ms
31,772 KB |
testcase_05 | AC | 338 ms
31,984 KB |
testcase_06 | AC | 389 ms
34,616 KB |
testcase_07 | AC | 361 ms
32,964 KB |
testcase_08 | AC | 356 ms
33,780 KB |
testcase_09 | AC | 350 ms
33,312 KB |
testcase_10 | AC | 338 ms
32,840 KB |
testcase_11 | AC | 411 ms
34,980 KB |
testcase_12 | AC | 378 ms
33,592 KB |
testcase_13 | AC | 353 ms
32,044 KB |
testcase_14 | AC | 325 ms
31,780 KB |
testcase_15 | AC | 359 ms
33,224 KB |
testcase_16 | AC | 719 ms
50,820 KB |
testcase_17 | AC | 740 ms
52,092 KB |
testcase_18 | AC | 757 ms
52,552 KB |
testcase_19 | AC | 718 ms
50,760 KB |
testcase_20 | AC | 810 ms
53,468 KB |
testcase_21 | AC | 812 ms
53,676 KB |
testcase_22 | AC | 784 ms
52,768 KB |
testcase_23 | AC | 839 ms
54,384 KB |
testcase_24 | AC | 834 ms
54,576 KB |
testcase_25 | AC | 774 ms
53,376 KB |
testcase_26 | AC | 789 ms
52,900 KB |
testcase_27 | AC | 767 ms
51,160 KB |
testcase_28 | AC | 803 ms
53,576 KB |
testcase_29 | AC | 785 ms
51,916 KB |
testcase_30 | AC | 827 ms
54,852 KB |
testcase_31 | AC | 749 ms
52,340 KB |
testcase_32 | AC | 770 ms
55,352 KB |
testcase_33 | AC | 835 ms
56,180 KB |
testcase_34 | AC | 793 ms
52,260 KB |
testcase_35 | AC | 825 ms
53,820 KB |
testcase_36 | AC | 850 ms
53,284 KB |
testcase_37 | AC | 771 ms
54,112 KB |
testcase_38 | AC | 756 ms
52,076 KB |
testcase_39 | AC | 851 ms
53,196 KB |
testcase_40 | AC | 802 ms
53,188 KB |
testcase_41 | AC | 811 ms
53,316 KB |
testcase_42 | AC | 839 ms
54,504 KB |
testcase_43 | AC | 727 ms
50,496 KB |
testcase_44 | AC | 348 ms
32,512 KB |
testcase_45 | AC | 324 ms
43,500 KB |
testcase_46 | AC | 301 ms
43,500 KB |
testcase_47 | AC | 297 ms
40,648 KB |
testcase_48 | AC | 709 ms
55,020 KB |
testcase_49 | AC | 746 ms
55,060 KB |
testcase_50 | AC | 703 ms
54,924 KB |
testcase_51 | AC | 699 ms
54,936 KB |
testcase_52 | AC | 714 ms
54,952 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][3]; vector<int> v[100001],w[100001],vc[100001]; bool dfs(int now,int par,int c){ 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][1])continue; used[ne]=true; ret=dfs(ne,now,1); if(ret)break; used[ne]=false; used2[ne][c]=true; } rep(i,0,vc[now].size()){ int ne=vc[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne][1])continue; used[ne]=true; ret=dfs(ne,now,1); if(ret)break; used[ne]=false; used2[ne][c]=true; } } 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][0])continue; used[ne]=true; ret=dfs(ne,now,0); if(ret)break; used[ne]=false; used2[ne][0]=true; } rep(i,0,v[now].size()){ int ne=v[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne][1])continue; used[ne]=true; ret=dfs(ne,now,1); if(ret)break; used[ne]=false; used2[ne][1]=true; } rep(i,0,w[now].size()){ int ne=w[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne][2])continue; used[ne]=true; ret=dfs(ne,now,2); if(ret)break; used[ne]=false; used2[ne][2]=true; } } 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][c])continue; used[ne]=true; ret=dfs(ne,now,2); if(ret)break; used[ne]=false; used2[ne][c]=true; } rep(i,0,vc[now].size()){ int ne=vc[now][i]; if(par==ne)continue; if(used[ne]){ return true; } if(used2[ne][c])continue; used[ne]=true; ret=dfs(ne,now,2); if(ret)break; used[ne]=false; used2[ne][c]=true; } } 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); memset(used2,false,sizeof used2); rep(i,0,n){ if(used2[i][0])continue; used[i]=true; bool ok=dfs(i,-1,0); if(ok){ cout<<"Yes"<<endl; return 0; } used[i]=false; used2[i][0]=true; } cout<<"No"<<endl; }