| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298446 | scalifrastico_098 | Cave (IOI13_cave) | C++20 | 9 ms | 500 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++){a[i]=0; b[i]=-1;} int s=0;
int i=tryCombination(a);
while(i!=-1)
{
for(int j=0; j<n; j++)
{
a[j]=1; int u=tryCombination(a);
if(u>i||u==-1){ i=u; break;} a[j]=0;
}
}
for(int i=0; i<n; i++)
{
if(a[i]==0)a[i]=1; else a[i]=0;
int u=tryCombination(a);b[i]=u; if(a[i]==1)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... | ||||
