Submission #678702

#	Time	Username	Problem	Language	Result	Execution time	Memory
678702		SamNguyen	동굴 (IOI13_cave)	C++14	12 / 100	10 ms	428 KiB

cave

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

const int MAX = 5000 + 7;

namespace Subtask1 {
    int swit[MAX], door[MAX];

    void exploreCave(int N) {
        iota(door, door + N, 0);
        fill(swit, swit + N, 0);

        while (true) {
            int i = tryCombination(swit);
            if (i == -1)
                break;
            swit[i] ^= 1;
        }

        answer(swit, door);
    }
}

void exploreCave(int N) {
    Subtask1::exploreCave(N);
}

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