| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357687 | ezzzay | 동굴 (IOI13_cave) | C11 | 0 ms | 0 KiB |
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
void exploreCave(int N) {
int con[N];
bool fnd[N], col[N];
for(int i=0;i<N;i++){
col[i]=0;
fnd[i]=0;
}
int k=0;
while(k!=N){
for(int i=0;i<N;i++){
if(fnd[i]==0){
int g= tryCombination(col);
if(g==-1){
col[i]^=1;
g=tryCombination(col);
}
col[i]^=1;
int h= tryCombination(col);
if(h==-1){
con[i]=g;
fnd[i]=1;
k++;
continue;
}
if(g<h){
con[i]=g;
fnd[i]=1;
k++;
continue;
}
if(h<g){
con[i]=h;
fnd[i]=1;
col[i]^=1;
k++;
continue;
}
}
}
}
answer(col,con);
}
