Submission #766345

#	Time	Username	Problem	Language	Result	Execution time	Memory
766345		zsombor	Cave (IOI13_cave)	C++17	100 / 100	667 ms	468 KiB

cave

#include <iostream>
#include <vector>
#include "cave.h"
using namespace std;

void exploreCave(int N) {
    int S[N];
    int D[N];
    vector <bool> done(N, false);
    for (int d = 0; d < N; d++) {
        for (int i = 0; i < N; i++) if (!done[i]) S[i] = 0;
        int o = (tryCombination(S) != d ? 0 : 1), s = 0;
        for (int j = 0; j < 13; j++) {
            for (int i = 0; i < N; i++) if (!done[i]) S[i] = (i & (1 << j) ? o : 1 - o);
            if (tryCombination(S) != d) s += (1 << j);
        }
        S[s] = o;
        D[s] = d;
        done[s] = true;
    }
    answer(S, D);
}

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24