이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 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... |