# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988725 | lalig777 | Cave (IOI13_cave) | C++14 | 85 ms | 352 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.
#include"cave.h"
#include <iostream>
#include <vector>
using namespace std;
void exploreCave(int N){
bool confirmat[N]={false};
int comb[N]={0};
int porta[N]={-1};
bool funcionaba, funciona;
int act;
for (int i=0; i<N; i++){
int doorsleft=N-i, left=0, right=N-1;
for (int i=0; i<N; i++){
if (confirmat[i]!=true){
left=i;
break;
}
}for (int i=N-1; i>=0; i--){
if (confirmat[i]!=true){
right=i;
break;
}
}act=tryCombination(comb);
if (act!=i) funcionaba=true;
else funcionaba=false;
int r=N-1;
while (left!=right){
int sobra=doorsleft%2;
Compilation message (stderr)
# | 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... |