Submission #574773

#TimeUsernameProblemLanguageResultExecution timeMemory
574773m_fenaisCarnival (CEOI14_carnival)C++14
0 / 100
121 ms304 KiB
#include <bits/stdc++.h> //#define endl '\n' #define mk make_pair #define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) typedef long long ll; using namespace std; const int N = 1e6 + 10; const int mod = 1e9 + 7; map<int, int> mp; map<int, int> ans; int main() { FAST; int n; cin>>n; for(int i=1; i<=n; i++) mp[i] = i; for(int i=1; i<n; i++) { for(int j=i+1; j<=n; j++) { if(i != j){ cout<<2<<' '<<i<<' '<<j<<endl; int x; cin>>x; if(x == 1) { mp[j] = mp[i]; } } } } int cnt = 1; for(int i=1; i<=n; i++) { for(int j=i+1; j<=n; j++) { if(mp[j] == mp[i]) ans[j] = cnt; } if(ans[i] == 0){ ans[i] = cnt; cnt++; } } cout<<0<<' '; for(int i=1; i<=n; i++) { cout<<mp[i]<<' '; } 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...