Submission #984225

#TimeUsernameProblemLanguageResultExecution timeMemory
984225stdfloatCave (IOI13_cave)C++17
13 / 100
11 ms600 KiB
#include <bits/stdc++.h>
#include "cave.h"
//#include "grader.c"
using namespace std;

void exploreCave(int N) {
    int a[N], b[N];
    for (int i = 0; i < N; i++)
        a[i] = b[i] = 0;

    for (int i = 0; i < N; i++) {
        a[i] = 1;

        b[i] = tryCombination(a);

        a[i] = 0;
    }

    answer(a, b);

    /*sub1:
    int a[N];
    for (int i = 0; i < N; i++)
        a[i] = 0;

    for (int i = 0; i < N; i++)
        if (tryCombination(a) == i) a[i] = 1;

    int b[N];
    iota(b, b + N, 0);

    answer(a, b);
    */
}
#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...