Submission #569086

#TimeUsernameProblemLanguageResultExecution timeMemory
569086beaconmcCarnival (CEOI14_carnival)C++14
100 / 100
9 ms428 KiB
#include <bits/stdc++.h> typedef long long ll; #define FOR(i,x,y) for(ll i=x; i<y; i++) #define FORNEG(i,x,y) for(ll i=x; i>y; i--) using namespace std; int main(){ ll n; cin >> n; ll c; cout<< n << " "; FOR(i,1,n+1) cout << i << " " ; cout << endl; cin >> c; vector<vector<ll>> tings(c); set<ll> sussy; ll prev = c; FORNEG(i,n-1,0){ ll sus = 0; cout << i << " "; FOR(j,1,i+1){ cout << j << " "; } cout << endl; cin >> sus; if (sus != prev){ sussy.insert(i+1); tings[c-prev].push_back(i+1); prev = sus; } } tings[c-1].push_back(1); sussy.insert(1); FOR(i,1,n+1){ if (sussy.count(i)) continue; ll lo = 0; ll hi = c-1; while (lo<hi){ ll mid = (lo+hi)/2; cout << mid-lo+2 << " "; cout << i << " "; FOR(j,lo,mid+1){ cout << tings[j][0] << " "; } cout << endl; ll idk; cin >> idk; if (idk < mid-lo+2){ hi = mid; }else{ lo = mid + 1; } } tings[lo].push_back(i); } vector<ll> ans(n); FOR(i,0,c){ for (auto&j : tings[i]){ ans[j-1] = i+1; } } cout << 0 << " "; for (auto&i : ans){ cout << i << " "; } cout << endl; }
#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...