Submission #995225

#	Time	Username	Problem	Language	Result	Execution time	Memory
995225		coolboy19521	Cave (IOI13_cave)	C++17	25 / 100	35 ms	564 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

void exploreCave(int N) {
    int s[N], d[N];

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

    for (int i = 0; i < N; i += 4) {
        int d = min(N - i, 4);

        for (int j = 0; j < (1 << d); j ++) {
            for (int k = 0; k < d; k ++) {
                if (j & (1 << k)) {
                    s[i + k] = 1;
                }
            }

            int r = tryCombination(s);

            if (r >= i + d || -1 == r) {
                break;
            }

            for (int k = 0; k < d; k ++) {
                if (j & (1 << k)) {
                    s[i + k] = 0;
                }
            }
        }
    }

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

        d[i] = tryCombination(s);
        s[i] ^= 1;
    }

    answer(s, d);
}

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