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=1e5;
void exploreCave(int N)
{
/* ... */
int cur,arr[MAX],other[MAX];
for(int A=1;A<=N;A++)
arr[A]=0,other[A]=A;
while(true)
{
cur=tryCombination(arr);
if(cur==-1)
{
answer(arr,other);
return ;
}
arr[cur]^=1;
}
return ;
}
# | 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... |