Submission #1216812

#TimeUsernameProblemLanguageResultExecution timeMemory
1216812nataliaaCave (IOI13_cave)C++20
0 / 100
52 ms328 KiB
#include "cave.h" #include<bits/stdc++.h> using namespace std; void exploreCave(int N) { int v[N]; int a[N] ={}; for(int i = 0; i < N; i++) v[i]= i; for(int i = 0; i < N; i++) { int l = 0, r= N-1; while(l<=r) { int m = (l+r)/2; for(int j = 0; j <= m; j++) { if(a[i]) a[i]=0; else a[i]=1; } int k = tryCombination(a); if(k >= a[i]) r = m-1; else l=m+1; } a[i] =l; } answer( a,v); }
#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...