Submission #104439

#TimeUsernameProblemLanguageResultExecution timeMemory
104439BadralCave (IOI13_cave)C++17
0 / 100
6 ms512 KiB
#include "cave.h"
#include<bits/stdc++.h>
 
using namespace std;
 
void exploreCave(int N) {
    int a[N+1];
    int d[N+1];
    memset(a, 0, sizeof(a));
    
    for(int i = 0; i < N; i++) {
        d[i] = i;
        if(tryCombination(a) == i) {
            continue;
        }else {
            a[i] = 1;
        }
    }
    answer(a, 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...