| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 166548 | degelo | Carnival (CEOI14_carnival) | C++17 | 28 ms | 380 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 maxn 160
int resp[maxn];
using namespace std;
int teste(int cur,int ini,int fim){
vector<int> t;
for(int i=ini;i<=fim;i++){
if(resp[i]==0&&i!=cur&&i!=-cur){
t.push_back(i);
}
}
if(cur>0) t.push_back(cur);
if(t.size()==1) return 1;
cout<<t.size()<<" ";
for(int i=0;i<t.size();i++){
cout<<t[i]<<" ";
}
cout<<endl;
int resp;
cin>>resp;
return resp;
}
void findc(int cur,int ini,int fim){
int r1=0,r2=0;
r1=teste(cur,ini,fim);
if(r1==1){
for(int i=ini;i<=fim;i++){
if(resp[i]==0) resp[i]=resp[cur];
}
}
else r2=teste(-cur,ini,fim);
if(r1==r2){
int m=(ini+fim)/2;
findc(cur,ini,m);
findc(cur,m+1,fim);
}
}
int main(){
int n;
cin>>n;
int c=1;
for(int i=1;i<=n;i++){
if(resp[i]==0){
resp[i]=c;
findc(i,1,n);
c++;
}
}
cout<<"0"<<" ";
for(int i=1;i<=n;i++){
cout<<resp[i]<<" ";
}
}
Compilation 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... | ||||
