| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 678014 | hello_there_123 | Cave (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"
#include <bits/stdc++.h>
using namespace std;
int tryCombination(int S[]);
void answer(int A[],int B[]);
void exploreCave(int N) {
int comb[N+3];
int link[N+3];
memset(comb,-1,sizeof(comb));
memset(link,-1,sizeof(link));
for(int i=0;i<N;i++){
int tr[N+3];
for(int j=0;j<N;j++){
tr[j] = comb[j];
}
for(int j=0;j<N;j++){
if(tr[j] == -1) tr[j] = 0;
}
int cor;
if(tryCombination(tr)>i) cor = 0;
else cor = 1;
int lo = 0;
int hi = N-1;
while(lo<=hi){
int X = (lo+hi)/2;
for(int j=lo;j<X;j++){
if(comb[j] == -1) tr[j] = cor;
}
for(int j=X;j<hi;j++){
if(comb[j] == -1) tr[j] = 1-cor;
}
if(tryCombination(tr)>i){
hi = X-1;
}
else lo = X+1;
}
link[lo] = i;
comb[lo] = cor;
}
answer(comb, link);
}