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 <bits/stdc++.h>
using namespace std;
#ifndef ARTHUR_LOCAL
#include "cave.h"
#endif
void exploreCave(int n)
{
int D[n]; // we need to answer these
int S[n];
for(int i=0; i<n; i++)
{
S[i]=0;
D[i]=0;
}
vector<bool> lock(n);
for(int i=0; i<n; i++) // work out door i
{
int cur = tryCombination(S); // should be >= i unless it's -1
for(int j=0; j<n; j++) // mess with switch j
{
if(lock[j]) continue;
S[j]=1-S[j];
int new_thing = tryCombination(S);
if((cur==i && new_thing!=i) || (cur!=i && new_thing==i))
{
if(new_thing==i) S[j]=1-S[j];
D[j]=i;
lock[j]=1;
break;
}
else S[j]=1-S[j];
}
}
answer(S,D);
}
# | 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... |