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;
const int MAX = 5000 + 7;
namespace Subtask1 {
int swit[MAX], door[MAX];
void exploreCave(int N) {
iota(door, door + N, 0);
fill(swit, swit + N, 0);
while (true) {
int i = tryCombination(swit);
if (i == -1)
break;
swit[i] ^= 1;
}
answer(swit, door);
}
}
void exploreCave(int N) {
Subtask1::exploreCave(N);
}
# | 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... |