| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1359326 | cansu_mutlu | Cave (IOI13_cave) | C++20 | 4 ms | 344 KiB |
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
int a[n];
for(int i=0;i<n;i++) a[i]=0;
int num = 0;
int b[n];
for(int i=0;i<n;i++) b[i]=i;
while(1)
{
num = tryCombination(a);
if(num==-1)
{
answer(a,b);
return;
}
a[num] = 1-a[num];
}
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
