Submission #729502

#TimeUsernameProblemLanguageResultExecution timeMemory
729502Jean7동굴 (IOI13_cave)C++14
12 / 100
9 ms396 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...