| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298413 | scalifrastico_098 | Cave (IOI13_cave) | C++20 | 11 ms | 512 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
int a[n], b[n], c[n];
for(int i=0; i<n; i++){b[i]=i;} int s=0;
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)c[i]=0; for(int i=0; i<n; i++)c[i]=a[i];
int u=tryCombination(c);
if(u==-1||u>i){a[i]=0;}
else{a[i]=1;}
}
answer(a, b);
}
| # | 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... | ||||
