| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298439 | gesp3011v2 | Cave (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N){
int a[N];
memset(a,0,sizeof a);
int b[N];
for(int i=0;i<N;i++){
int x=tryCombination(a);
if(x==-1)break;
for(int j=0;j<N;j++){
if(a[j]==1)continue;
a[j]=1;
int y=tryCombination(a);
a[j]=0;
if(y>x || y==-1){
a[j]=1;
break;
}
}
}
//int z=tryCombination(a);
for(int i=0;i<n;i++){
a[i]=abs(a[i]-1);
int x=tryCombination(a);
a[i]=abs(a[i]-1);
b[i]=x;
}
answer(a,b);
}
