| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1351169 | ElayV13 | 사육제 (CEOI14_carnival) | C++20 | 18 ms | 436 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF=1e18;
const int N=200005;
int n;
int ask(vector<int>v){
cout<<v.size()<<' ';
for(int x:v) cout<<x<<' ';
cout<<endl;
cout.flush();
int cnt;
cin>>cnt;
return cnt;
}
void solve(){
cin>>n;
vector<int>res(n+1,-1);
int cur=1;
for(int i=1;i<=n;i++){
if(res[i]!=-1) continue;
vector<int>f={i};
for(int j=i+1;j<=n;j++){
f.push_back(j);
if(ask(f)==2) f.pop_back();
}
for(int id:f) res[id]=cur;
++cur;
}
cout<<0<<' ';
for(int i=1;i<=n;i++) cout<<res[i]<<' ';
cout<<endl;
cout.flush();
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T=1;//cin>>T;
while(T--) solve();
}| # | 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... | ||||
