# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757222 | KALARRY | Cave (IOI13_cave) | C++14 | 1 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//chockolateman
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N)
{
int seq[N+5];
int ans[N+5];
for(int i =0 ; i < N ; i++)
seq[i] = 0;
bool used[N+5];
for(int i = 0 ; i < N ; i++)
used[i] = false;
for(int i = 0 ; i < N ; i++)
{
int res = tryCombination(seq);
if(res>i||res==-1)
{
for(int i = 0 ; i < N ; i++)
if(!used[i])
{
if(seq[i])
seq[i] = 0;
else
seq[i] = 1;
}
}
# | 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... |