Submission #1221155

#TimeUsernameProblemLanguageResultExecution timeMemory
1221155FaresSTHCave (IOI13_cave)C++20
0 / 100
34 ms328 KiB
#include"bits/stdc++.h" #include"cave.h" using namespace std; using ll=long long; #define S second #define F first void exploreCave(int n){ bool v[n]={}; int s[n]={},d[n]={}; for(int i=0;i<n;i++){ int l=0,r=n-1; int in=tryCombination(s); while(l<r){ int m=(l+r)/2; for(int j=l;j<=m;j++)if(!v[j])s[j]=!s[j]; int cur=tryCombination(s); for(int j=l;j<=m;j++)if(!v[j])s[j]=!s[j]; if(in!=cur)r=m; else l=m+1; } // if(in==i)s[l]=!s[l]; s[l] = 0; if (tryCombination(s) != i) s[l] = 1; d[i]=l; v[l]=1; } answer(s,d); }
#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...