| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1310869 | nataliaa | Cave (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int v[N]={};
int a[N] ={};
int vis[N]={};
for(int i = 0; i < N; i++) {
for(int j =0; j < N; j++) {
if(vis[j]==0) a[j] = 0;
}
int ind = 0;
int k = tryCombination(a);
if(k==i) ind = 1;
for(int j =0; j < N; j++) {
if(vis[j]==0) a[j] = 1-ind;
}
for(int i = 0; i < N; i++) v[i] = i;
vis[ok] = 1;
a[ok] = ind;
v[ok] =i;
}
answer( a,v);
}
