| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 248950 | REALITYNB | Cave (IOI13_cave) | C++14 | 0 ms | 0 KiB |
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;
cin>> n ;
int a[n] ;
memset(a,0,sizeof a) ;
int door = 0 ;
for(;door<n;door++){
int ans = tryCombination(a) ;
if(ans==door){
a[door] = 1 ;
}
}
int aa[n] ;
for(int i=0;i<n;i++)aa[i] = i ;
answer(a,aa) ;
return ;
}