Submission #1285839

#	Time	Username	Problem	Language	Result	Execution time	Memory
1285839		sunflower	동굴 (IOI13_cave)	C++17	12 / 100	13 ms	500 KiB

cave

#ifndef SUN
#include "cave.h"
#endif // SUN

#include <bits/stdc++.h>
using namespace std;

#ifdef SUN
void answer(int S[], int D[]) {
}

int tryCombination(int S[]) {

}
#endif // SUN

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

    for (int i = 0; i < n; ++i) d[i] = i, s[i] = 0;

    for (int step = 0; step < n; ++step) {
        int get = tryCombination(s);

        if (get == -1) {
            answer(s, d);
            return;
        }

        if (get < step + 1) s[step] ^= 1;
    }

    answer(s, d);
}

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