| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 225287 | 2020-04-20T07:37:09 Z | kshitij_sodani | 도서관 (JOI18_library) | C++17 | 0 ms | 0 KB |
#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;
int co=0;
void solve(int ind,int l,int r){
//cout<<l<<" "<<r<<endl;
if(l==r){
if(ind==l){
co+=1;
ll=-1;
}
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){
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 and i!=ind){
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;
while(le){
int y=x;
ll=-2;
solve(x,0,n-1);
if(co==2){
int pp=1/0;
}
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[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(4);
return 0;
}*/