# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1210952 | LIA | Cave (IOI13_cave) | C++17 | 0 ms | 0 KiB |
void exploreCave(int n) {
ll s[n];
loop(i,0,n) {
s[i] = 0;
}
ll loc[n];
vb of_prev(n, false);
loop(i,0,n) {
loop(j,0,n) {
if (of_prev[j] == false) {
ll cop[n];
loop(c,0,n) cop[c] = s[c];
cop[j] = 1;
ll cs = tryCombination(s), ccop = tryCombination(cop);
if (cs==-1) cs = n;
if (ccop==-1) ccop = n;
if (cs==i) {// if 1 is coorect here - ccop
of_prev[j] = 1;
s[j] = 1;
loc[j] = i;
break;
}
if (ccop==i) {// if 0 is coorect here - cs
of_prev[j] = 1;
s[j] = 0;
loc[j] = i;
break;
}
}
}
}
answer(s, loc);
}