Submission #507202

#TimeUsernameProblemLanguageResultExecution timeMemory
507202amukkalirCave (IOI13_cave)C++17
13 / 100
19 ms420 KiB
#include "cave.h"
#include <bits/stdc++.h> 
using namespace std; 

void exploreCave(int N) {
    int S[N], D[N]; 
    for(int i=0; i<N; i++){
        S[i] = 0; 
        D[i] = i; 
    }

    for(int i=0; i<N; i++) {
        S[i] = 1; 
        int rep = tryCombination(S); 
        D[i] = rep; 
        S[i] = 0; 
    }

    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...