제출 #607649

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
607649		jairRS	동굴 (IOI13_cave)	C++17	12 / 100	28 ms	520 KiB

cave

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

const int MAXN = 5'000;
int switches[MAXN];

// door triggered by switchID
int door[MAXN];

void exploreCave(int N)
{
    for (int curSearching = 0; curSearching < N; curSearching++)
    {
        door[curSearching] = curSearching;
        int firstClosed = tryCombination(switches);
        if (firstClosed == curSearching)
            switches[curSearching] = !switches[curSearching];
    }

    answer(switches, door);
}

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