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;
//Subtask 1: D[i] == i
void exploreCave(int N)
{
int S[N];
for(int i = 0; i < N; i++) S[i] = 0;
int D[N];
for(int i = 0; i < N; i++) D[i] = i;
int q;
while(1)
{
q = tryCombination(S);
if(q == -1)
{
answer(S, D);
return;
}
else S[q] = !S[q];
}
}
# | 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... |