Submission #429466

#TimeUsernameProblemLanguageResultExecution timeMemory
429466dariascCave (IOI13_cave)C++14
12 / 100
12 ms464 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int N) {
    int ans[N];
    memset(ans, 0, sizeof ans);
    
    for (int i = 0; i < N; i++) {
        ans[i] = 1;
        if (i == tryCombination(ans)) {
            ans[i] = 0;
        } else {
            ans[i] = 1;
        }
    }

    int conn[N];
    for (int i = 0; i < N; i++) {
        conn[i] = i;
    }

    answer(ans, conn);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...