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 ;
int s[5000] , d[5000] ;
void exploreCave ( int n ) {
for ( int i = 0 ; i < n ; i++ ) {
d[i] = i ;
s[i] = 0 ;
}
for ( int i = 0 ; i < n ; i++ ) {
int x = tryCombination(s) ;
if ( x == -1 ) {
break ;
}
s[x] = 1 ;
}
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... |