Submission #519142

#TimeUsernameProblemLanguageResultExecution timeMemory
519142JomnoiCave (IOI13_cave)C++17
12 / 100
22 ms412 KiB
#include <bits/stdc++.h>
#include "cave.h"
#define DEBUG 0
using namespace std;

const int MX = 5e3 + 10;

int S[MX], D[MX];

void exploreCave(int N) {
    for(int i = 0; i < N; i++) {
        int res = tryCombination(S);
        if(res == i) {
            S[i] = 1;
        }
        else {
            S[i] = 0;
        }
    }

    for(int i = 0; i < N; i++) {
        D[i] = i;
    }
    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...