제출 #882158

#제출 시각아이디문제언어결과실행 시간메모리
882158andro동굴 (IOI13_cave)C++14
0 / 100
5 ms348 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; /* int n; void answer(int S[],int D[]){ exit(0); } int tryCombination(int S[]){ cout<<"? "; for(int i=0;i<n;i++)cout<<S[i]<<" "; cout<<endl; int x; cin>>x; return x; }*/ void exploreCave(int N) { int S[N]; int D[N]; for(int i=0;i<N;i++){ D[i]=i; S[i]=0; } for(int i=0;i<N-1;i++){ if(tryCombination(S)>=i+1)S[i]=0; else S[i]=1; } if(tryCombination(S)==-1)S[N-1]=0; else S[N-1]=1; answer(S,D); }/* signed main(){ cin>>n; exploreCave(n); }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...