# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164479 | oolimry | Carnival (CEOI14_carnival) | C++14 | 20 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> unique;
int answer[n+1];
for(int i = 1;i <= n;i++){
cout << unique.size() + 1 << " ";
for(int x : unique) cout << x << " ";
cout << i << " ";
cout << endl;
int no;
cin >> no;
if(no == unique.size()){
int low = -1;
int high = unique.size();
while(true){
if(low == high - 1) break;
int s = (low + high) / 2;
cout << s + 2 << " ";
for(int j = 0;j <= s;j++){
cout << unique[j] << " ";
}
cout << i << " ";
cout << endl;
int no;
cin >> no;
if(no == s + 1){
high = s; ///overlap
}
else{
low = s; ///i is diff from 0...s
}
}
answer[i] = high;
}
else{
answer[i] = unique.size();
unique.push_back(i);
}
}
cout << "0 ";
for(int i = 1;i <= n;i++){
cout << answer[i] + 1 << " ";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |