| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 237348 | jam_xd_ | 동굴 (IOI13_cave) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "cave.h"
using namespace std;
void exploreCave(int N) {
int ggnomas[N]={}, S[N] = {};//inician en 0
int D[N];
for(int i=0;i<n;i++){
// crear el array del si switchs estan encendidos o apagados
int prb[N];
for(int j=0,j<N;j++){
if(ggnomas[j] != 0) prb[j] = S[j];
else prb[j] = 1;
}
int uwu = tryCombination(prb);
int afirmo = 1;
if(uwu<=i and uwu!=-1) afirmo = 0;
// Posicion del switch q quiero
int minimo=0, maximo=n-1;
int medio;
//binary search del stack adaptado xd xd
while(minimo <= maximo){
medio = (minimo + maximo)/2;
for(int j=0;j <= medio;i++){
if(ggnomas[j] != 0) prb[j] = S[j];
else prb[j] = afirmo;
}
for(int k= medio+1;k< N;j++){
if(ggnomas[k] != 0) prb[k] = S[k];
else prb[k] = 1 - afirmo;
}
uwu = tryCombination(prb);
if(uwu > i or uwu== -1){
maximo = medio-1;
}
else {
medio++;
minimo = medio;
}
}
ggnomas[medio] = 1;
S[medio] = afirmo;
D[medio] = i;
}
answer(S,D);
}