Submission #574860

#TimeUsernameProblemLanguageResultExecution timeMemory
574860m_fenaisCarnival (CEOI14_carnival)C++17
100 / 100
21 ms336 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> use; int main() { FAST; int n; cin>>n; int prev = 1, cnt = 2; use[1] = 1; mp[1] = 1; for(int i=2; i<=n; i++) { cout<<i<<' '; for(int j=1; j<=i; j++) { cout<<j<<' '; } cout<<endl; int x; cin>>x; if(x != prev){ mp[i] = cnt; use[i] = 1; cnt++; } prev = x; } for(int i=1; i<=n; i++) { if(mp[i] == 0) { for(int j=1; j<i; j++) { if(use[j]) { cout<<2<<' '<<i<<' '<<j<<endl; int x; cin>>x; if(x == 1){ mp[i] = mp[j]; break; } } } } } 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...