| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1216726 | lizi14 | Cave (IOI13_cave) | C++20 | 8 ms | 328 KiB |
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cstdio>
#include "cave.h"
using namespace std;
void exploreCave(int N) {
int x[N];
fill(x,x+N,0);
int an=0;
while(true){
int a=tryCombination(x);
if(a==-1){
break;
}
if(a>an){
an=a-1;
}
x[a]=1-x[a];
}
int c[N];
for(int i=0; i<N; i++)c[i]=i;
return answer(x, c);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
