제출 #984293

#제출 시각아이디문제언어결과실행 시간메모리
984293stdfloatCave (IOI13_cave)C++17
13 / 100
9 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;

    if (N <= (int)1e2) {
        while (true) {
            int x = tryCombination(a);

            if (x == -1) break;

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

                a[i] = 1;

                int y = tryCombination(a);
                if (x != y) {
                    b[i] = x;
                    break;
                }

                a[i] = 0;
            }
        }

        for (int i = 0; i < N; i++) {
            if (!a[i]) {
                a[i] = 1;
                b[i] = tryCombination(a);
                a[i] = 0;
            }
        }
    }
    else {
        for (int i = 0; i < N; i++) {
            a[i] = 1;

            b[i] = tryCombination(a);

            a[i] = 0;
        }
    }

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

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