| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298415 | gesp3011v2 | Cave (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> b;
void exploreCave(int N){
int a[N];
b.resize(N);
iota(b.begin(),b.end(),0);
memset(a,0,sizeof a);
do{
int ans=tryCombination(a);
if(ans==-1)break;
a[res]=1;
}while(1);
answer(a,b);
}
