Submission #475693

#TimeUsernameProblemLanguageResultExecution timeMemory
475693Blobo2_Blobo2Carnival (CEOI14_carnival)C++14
20 / 100
123 ms404 KiB
/* Editor: Abdelrahman Hossam Nickname: Blobo2_Blobo2 IOI next year isA :) */ /*#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")*/ #include<bits/stdc++.h> using namespace std; #define int long long //#define endl "\n" #define all(v) v.begin(),v.end() #define gen(arr,n,nxt) generate(arr,arr+n,nxt) #define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0); #define EPS 0.00000001 const int mo=1e9+7,INF=1e18; int nxt(){int x;cin>>x;return x;} int ask(int x,int y){ cout<<2<<' '<<x<<' '<<y<<endl; return nxt(); } signed main(){ //Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty int n=nxt(); map<int,int>mp; vector<int>v; int x = ask(1,2); if(x == 1){ v.push_back(1); mp[1]=1; mp[2]=1; } else v.push_back(1),v.push_back(2),mp[1]=1,mp[2]=2; int idx=mp[2]+1; for(int i=3;i<=n;i++){ bool ok=0; for(auto x:v){ int y = ask(x,i); if(y == 1){ ok=1; mp[i]=mp[x]; break; } } if(!ok){ v.push_back(i); mp[i]=idx; idx++; } } cout<<0<<' '; for(int i=1;i<=n;i++)cout<<mp[i]<<' '; cout<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...