#include <iostream>
#include <bits/stdc++.h>
#include "library.h"
using namespace std;
#define pb push_back
typedef long long llo;
#define a first
#define b second
int n;
vector<int> aa;
vector<int> bb;
/*
void Answer(vector<int> cc){
for(auto j:cc)
{ cout<<j<<" ";
}
cout<<endl;
}
int Query(vector<int> cc){
for(auto j:cc){
cout<<j<<" ";
}
cout<<endl;
int xx;
cin>>xx;
return xx;
}*/
int ll;
void solve(int ind,int l,int r){
//cout<<l<<" "<<r<<endl;
if(l==r){
if(aa[l]==0){
ll=-1;
while(true){
continue;
}
return ;
}
/* if(ind==l){
ll=-1;
while(true){
continue;
}
}
else{*/
for(int i=0;i<n;i++){
if((ind==i or i==l)){
bb[i]=1;
}
else{
bb[i]=0;
}
}
int yy=Query(bb);
if(yy==1){
aa[l]=0;
ll=l;
}
else{
ll=-1;
}
//}
}
else{
int mid=(l+r)/2;
int co=0;
for(int i=0;i<n;i++){
bb[i]=0;
}
for(int i=l;i<=mid;i++){
if(aa[i]==2){
bb[i]=1;
co+=1;
}
}
if(co==0){
solve(ind,mid+1,r);
}
else{
bb[ind]=1;
int yy=Query(bb);
bb[ind]=0;
int zz=Query(bb);
if(yy==zz){
solve(ind,l,mid);
}
else{
solve(ind,mid+1,r);
}
}
}
}
void Solve(int nn){
n=nn;
for(int i=0;i<n;i++){
aa.pb(2);
bb.pb(0);
}
int x=0;
deque<int> ans;
ans.push_back(0);
int st=0;
int kk=0;
int le=n-1;
aa[0]=0;
int cco=0;
while(le and cco<2*n){
cco+=1;
int y=x;
ll=-2;
solve(x,0,n-1);
if(ll!=-1){
le-=1;
}
x=ll;
if(x==-1){
x=0;
st=1;
kk+=1;
}
else{
if(st==0){
ans.push_back(x);
}
else{
ans.push_front(x);
}
}
aa[x]=0;
aa[y]=0;
}
vector<int> fin;
for(int i=0;i<n;i++){
int x=ans.front();
ans.pop_front();
fin.pb(x+1);
}
Answer(fin);
}
/*int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
Solve(5);
return 0;
}*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3052 ms |
384 KB |
Time limit exceeded |
2 |
Correct |
59 ms |
256 KB |
# of queries: 2901 |
3 |
Correct |
45 ms |
384 KB |
# of queries: 3084 |
4 |
Correct |
50 ms |
256 KB |
# of queries: 3038 |
5 |
Correct |
59 ms |
384 KB |
# of queries: 3062 |
6 |
Correct |
62 ms |
256 KB |
# of queries: 3074 |
7 |
Execution timed out |
3034 ms |
384 KB |
Time limit exceeded |
8 |
Execution timed out |
3044 ms |
256 KB |
Time limit exceeded |
9 |
Correct |
49 ms |
384 KB |
# of queries: 3079 |
10 |
Incorrect |
61 ms |
256 KB |
Wrong Answer [5] |
11 |
Correct |
4 ms |
256 KB |
# of queries: 0 |
12 |
Correct |
5 ms |
256 KB |
# of queries: 1 |
13 |
Correct |
5 ms |
384 KB |
# of queries: 5 |
14 |
Correct |
5 ms |
384 KB |
# of queries: 9 |
15 |
Correct |
6 ms |
384 KB |
# of queries: 104 |
16 |
Execution timed out |
3077 ms |
256 KB |
Time limit exceeded |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3052 ms |
384 KB |
Time limit exceeded |
2 |
Correct |
59 ms |
256 KB |
# of queries: 2901 |
3 |
Correct |
45 ms |
384 KB |
# of queries: 3084 |
4 |
Correct |
50 ms |
256 KB |
# of queries: 3038 |
5 |
Correct |
59 ms |
384 KB |
# of queries: 3062 |
6 |
Correct |
62 ms |
256 KB |
# of queries: 3074 |
7 |
Execution timed out |
3034 ms |
384 KB |
Time limit exceeded |
8 |
Execution timed out |
3044 ms |
256 KB |
Time limit exceeded |
9 |
Correct |
49 ms |
384 KB |
# of queries: 3079 |
10 |
Incorrect |
61 ms |
256 KB |
Wrong Answer [5] |
11 |
Correct |
4 ms |
256 KB |
# of queries: 0 |
12 |
Correct |
5 ms |
256 KB |
# of queries: 1 |
13 |
Correct |
5 ms |
384 KB |
# of queries: 5 |
14 |
Correct |
5 ms |
384 KB |
# of queries: 9 |
15 |
Correct |
6 ms |
384 KB |
# of queries: 104 |
16 |
Execution timed out |
3077 ms |
256 KB |
Time limit exceeded |
17 |
Runtime error |
679 ms |
480 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Correct |
600 ms |
376 KB |
# of queries: 19485 |
19 |
Execution timed out |
3098 ms |
376 KB |
Time limit exceeded |
20 |
Execution timed out |
3094 ms |
384 KB |
Time limit exceeded |
21 |
Runtime error |
656 ms |
500 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
22 |
Runtime error |
678 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
23 |
Execution timed out |
3053 ms |
256 KB |
Time limit exceeded |
24 |
Runtime error |
335 ms |
376 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
25 |
Runtime error |
769 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
26 |
Runtime error |
709 ms |
632 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
27 |
Execution timed out |
3024 ms |
256 KB |
Time limit exceeded |
28 |
Correct |
272 ms |
376 KB |
# of queries: 11067 |
29 |
Correct |
328 ms |
376 KB |
# of queries: 11060 |
30 |
Correct |
325 ms |
384 KB |
# of queries: 11067 |