제출 #1280556

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280556		darele	동굴 (IOI13_cave)	C++20	46 / 100	21 ms	492 KiB

cave

#include "cave.h"

void exploreCave(int N) {
    int puerta[N];
    int pos[N];
    bool vis[N];
    for (int i = 0; i < N; i++) {
        pos[i] = 0;
        puerta[i] = -1;
        vis[i] = 0;
    }
    int prev = tryCombination(pos);
    int ans;
    while (prev != -1) {
        for (int i = 0; i < N; i++) {
            if (vis[i]) continue;
            pos[i] = 1;
            ans = tryCombination(pos);
            if (ans > prev || ans == -1) {
                vis[i] = 1;
                prev = ans;
                break;
            }
            if (ans < prev) {
                vis[i] = 1;
            }
            pos[i] = 0;
        }
    }
    for (int i = 0; i < N; i++) {
        pos[i] = (pos[i] + 1) % 2;
        int ans = tryCombination(pos);
        puerta[i] = ans;
        pos[i] = (pos[i] + 1) % 2;
    }
    answer(pos, puerta);
}

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