Submission #918183

#TimeUsernameProblemLanguageResultExecution timeMemory
918183vjudge1Carnival (CEOI14_carnival)C++17
100 / 100
5 ms596 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int N=2e5+5, mod=1e9+7; int col[N] , per[N]; int main() { int n; cin >> n; col[1] = 1; per[1] = 1; int cur = 1; for(int i = 2; i <= n; i++) { cout << cur + 1 << ' '; for (int j = 1; j <= cur; j++) cout << per[j] << ' '; cout << i << endl; int res; cin >> res; if(res == cur + 1) { col[i] = ++cur; per[cur] = i; continue; } int l = 1; int r = cur; while(l < r) { int mid = (l + r) >> 1; cout << mid + 1 << ' '; for (int j = 1; j <= mid; j++) { cout << per[j] << ' '; } cout << i << endl; int res; cin >> res; if(res == mid + 1) { l = mid + 1; } else { r = mid; } } per[l] = i; col[i] = l; } cout << 0 << ' '; for(int i = 1; i <= n; i++) { cout << col[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...