| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 239280 | aggu_01000101 | 사육제 (CEOI14_carnival) | C++14 | 11 ms | 384 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>
#define int long long
#define INF 1000000000000000
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
#define mid(l, u) ((l+u)/2)
#define x(p) p.first
#define y(p) p.second
#define MOD 998244353
using namespace std;
int q(vector<int> &curr, int i, int l, int r){
cout<<((r-l+1) + 1)<<" ";
for(int j = l;j<=r;j++) cout<<curr[j]<<" ";
cout<<i<<endl;
int tr;
cin>>tr;
return tr;
}
signed main(){
int n;
cin>>n;
int arr[n+1];
int nextdist = 2;
arr[1] = 1;
vector<int> curr = {1};
for(int i = 2;i<=n;i++){
int dist = q(curr, i, 0, curr.size()-1);
if(dist == nextdist){
arr[i] = nextdist++;
curr.push_back(i);
continue;
}
//There is a duplicate
int lo = 0;
int hi = curr.size() - 1;
int ans = 0;
while(lo<hi){
int mid = mid(lo, hi);
dist = q(curr, i, lo, mid);
if(dist == ((mid - lo + 1) + 1)){
lo = mid + 1;
continue;
}
else hi = mid;
}
//lo is the index of the duplicate
//cout<<"i is same as "<<lo<<endl;
arr[i] = curr[lo];
}
cout<<"0 ";
for(int i = 1;i<n;i++) cout<<arr[i]<<" ";
cout<<arr[n-1]<<endl;
}
//2 1 2 3 1Compilation 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... | ||||
