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>
#include "cave.h"
using namespace std;
void exploreCave(int N)
{
int n = N;
int s[n];
int feedback = 0;
while(true)
{
feedback = tryCombination(s);
//cout << feedback << endl;
if(feedback == -1)break;
else
{
s[feedback] = 1;
}
}
int c[n], d[n];
for (int i = 0; i < n; ++ i)
c[i] = s[i];
for (int i = 0; i < n; ++ i)
{
c[i] = 1 - c[i];
feedback = tryCombination(c);
d[i] = feedback;
c[i] = 1 - c[i];
}
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... |