Submission #1137376

#TimeUsernameProblemLanguageResultExecution timeMemory
1137376Rainmaker2627Carnival (CEOI14_carnival)C++20
0 / 100
1 ms408 KiB
#include<bits/stdc++.h> using namespace std; int query(vector<int>& q, int l, int r, int v=-1) { cout << q.size() << ' '; for (int i = l-1; i < r; i++) { cout << q[i] << ' '; } if (v>-1) cout << v; cout << endl; int resp; cin >> resp; return resp; } int main() { int n, t=2; cin >> n; vector<int> ans(n+1, 0), rep{1}, todo; ans[1]=1; for (int i = 2; i <= n; i++) { rep.push_back(i); if (query(rep, 1, rep.size())<rep.size()) { rep.pop_back(); todo.push_back(i); } else ans[i]=t++; } for (auto i : todo) { int l=1, r=rep.size(); while (l<r) { int mid=(l+r)/2; if (query(rep, l, mid, i)==mid-l+1) r=mid; else l=mid+1; } ans[i]=ans[rep[l-1]]; } cout << 0 << ' '; for (int i = 1; i <= n; i++) { cout << ans[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...