제출 #720317

#제출 시각아이디문제언어결과실행 시간메모리
720317hoainiemCarnival (CEOI14_carnival)C++14
100 / 100
9 ms324 KiB
#include <bits/stdc++.h> #define fi first #define se second #define lc id<<1 #define rc id<<1^1 using namespace std; typedef pair<int, int> pii; int n, k, ans[308]; vector<int>cur{1}, ds; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; ans[1] = 1; for (int i = 2; i <= n; i++){ cout << cur.size() + 1 << ' '; for (int tmp : cur) cout << tmp << ' '; cout << i << endl; cin >> k; if (k == (int)cur.size() + 1){ cur.push_back(i); ans[i] = cur.size(); } else ds.push_back(i); } for (int tmp : ds){ int l = 0, mid, r = cur.size() - 1; random_shuffle(cur.begin(), cur.end()); while (l < r){ mid = (l + r) >> 1; cout << mid + 2 << ' '; for (int i = 0; i <= mid; i++) cout << cur[i] << ' '; cout << tmp << endl; cin >> k; if (k == mid + 1) r = mid; else l = mid + 1; } ans[tmp] = ans[cur[l]]; } 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...