| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1350580 | feyza | Cave (IOI13_cave) | C++20 | 5 ms | 496 KiB |
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
int n;
void exploreCave(int N)
{
n=N;
int ans[N],bit[N];
for(int i=0;i<N;i++)
{
bit[i]=i%2;
ans[i]=i;
}
int mx=tryCombination(bit);
int curr;
for(int i=0;i<N;i++)
{
bit[i]=1-bit[i];
curr=tryCombination(bit);
if(curr==-1)
break;
if(curr>mx)
{
mx=curr;
continue;
}
bit[i]=1-bit[i];
}
answer(bit,ans);
}| # | 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... | ||||
