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 <iostream>
#include <vector>
using namespace std;
const int N = 160;
int n, a, b, pos, mid, res, prv, now;
int ans[N];
vector <int> v;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for(int i = 1; i <= n; i++) {
cout << i << ' ';
for(int j = 1; j <= i; j++) {
cout << j << ' ';
}
cout << endl;
cin >> now;
if(now != prv) {
v.push_back(i);
ans[i] = now;
prv = now;
continue;
}
a = 0, b = v.size() - 1;
while(a != b) {
mid = (a+b) / 2;
cout << mid + 2 << ' ';
for(int i = 0; i <= mid; i++) {
cout << v[i] << ' ';
}
cout << i << endl;
cin >> res;
if(res < mid + 2) {
b = mid - 1;
pos = mid;
}
else {
a = mid + 1;
}
}
ans[i] = ans[v[pos]];
}
for(int i = 0; i <= n; i++) {
cout << ans[i] << ' ';
}
cout << endl;
return 0;
}
# | 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... |