제출 #855964

#제출 시각아이디문제언어결과실행 시간메모리
855964Huseyn123동굴 (IOI13_cave)C++17
0 / 100
268 ms572 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N){ int c[N]; int d[N]; int res[N]; int res1[N]; int h1=0; for(int i=0;i<N;i++){ c[i]=0; d[i]=-1; } int h=tryCombination(c); if(h!=0){ h1=1; } for(int i=0;i<N;i++){ int l,r; l=0,r=N-1; while(l<r){ int m=(l+r)/2; for(int j=0;j<N;j++){ if(d[j]==-1){ c[j]=h1; } else{ c[j]=d[j]; } } for(int j=l;j<=m;j++){ if(d[j]==-1){ c[j]=1-h1; } } h=tryCombination(c); if(h>i || h==-1){ r=m; } else{ l=m+1; } } res[l]=i; res1[l]=1-h1; h1=1-h1; } answer(res,res1); }
#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...