| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1338421 | Newtonabc | 사육제 (CEOI14_carnival) | C++20 | 2 ms | 420 KiB |
#include<bits/stdc++.h>
using namespace std;
int ret[160];
vector<int> g;
int ask(int l,int r,int x){
int k=r-l+1;
cout<<k+1 <<" ";
for(int j=l;j<=r;j++) cout<<g[j] <<" ";
cout<<x;
cout<<endl;
int ret; cin>>ret;
return ret;
}
int main(){
int n; cin>>n;
for(int i=1;i<=n;i++){
int sz=g.size();
int l=0,r=sz-1;
g.push_back(i);
int tmp=ask(l,r,i);
g.pop_back();
if(tmp==sz+1){
g.push_back(i);
ret[i]=sz;
continue;
}
while(l<r){
int mid=(l+r)/2;
if(ask(l,mid,i)==mid-l+1) r=mid;
else l=mid+1;
}
ret[i]=l;
}
cout<<"0 ";
for(int i=1;i<=n;i++) cout<<ret[i]+1 <<" ";
}| # | 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... | ||||
