# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306390 | amunduzbaev | Cave (IOI13_cave) | C++14 | 77 ms | 512 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 <bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
int s[n],d[n];
memset(s,0,sizeof(s));
bool ok=0;
int st;
for(int i=0;i<n-1;i++){
st=i;
s[i]=0;
s[i+1]=0;
int x = tryCombination(s);
if(x==-1){
ok=1;
break;
}
s[i+1]=1;
int y = tryCombination(s);
if(y==-1){
ok=1;
break;
}
if(x==y){
s[i]=1;
}else{
s[i]=1;
int a=tryCombination(s);
if(a==-1){
ok=1;
break;
}
s[i]=0;
}
}
int id=tryCombination(s);
if(id!=-1){
s[n-1]=(s[n-1]?0:1);
}
for(int i=0;i<n;i++){
s[i]=(s[i]? 0:1);
int ind=tryCombination(s);
d[i]=ind;
s[i]=(s[i]? 0:1);
}
answer(s,d);
}
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... |