Submission #574926

#TimeUsernameProblemLanguageResultExecution timeMemory
574926MajidCarnival (CEOI14_carnival)C++17
100 / 100
25 ms300 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; using db = double; #define pb push_back #define sz(vec) ((ll)vec.size()) #define all(vec) vec.begin(), vec.end() #define f first #define s second const int MOD = 1e9 + 7; const ll BIGINF = ((ll)1e18) + 7; #define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL); int main(){ ll n, col = 1, old = 0; cin>>n; vector<ll> ans(n+1); // map<ll, bool> newcol; // set<ll> sett; vector<ll> newcol; for(ll i = 1; i <= n; i++){ cout<<i<<" "; for(ll j = 1; j <= i; j++){ cout<<j<<" "; } cout<<endl; ll x; cin>>x; if(x!=old){ ans[i] = col; col++; newcol.pb(i); } old = x; } for(ll i = 1; i <= n; i++){ if(ans[i])continue; for(auto y: newcol){ if(y >= i)break; cout<<"2 "<<y<<" "<<i<<endl; ll x; cin>>x; if(x==1){ ans[i] = ans[y]; break; } } } cout<<"0 "; for(ll i = 1; i <= n; i++)cout<<ans[i]<<" "; cout<<endl; return 0; // 1 3 1 }
#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...