Submission #1310677

#	Time	Username	Problem	Language	Result	Execution time	Memory
1310677		aleksandre	동굴 (IOI13_cave)	C++20	0 / 100	102 ms	480 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int S[N];
    int P[N];
    for (int i = 0; i < N; i++) {
        S[i] = 0;
        P[i] = -1;
    }
    while (true) {
        int j = tryCombination(S);
        if (j == -1) break;
        for (int i = 0; i < N; i++) {
            if (find(P, P+N, i) != P+N) continue;
            int old = S[i];
            S[i] = 1 - S[i];
            int res = tryCombination(S);
            if (res > j) {
                P[j] = i;
                break;
            } else {
                S[i] = old;
            }
        }
    }
    answer(S, P);
}

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