Submission #1310707

#	Time	Username	Problem	Language	Result	Execution time	Memory
1310707		aleksandre	동굴 (IOI13_cave)	C++20	0 / 100	28 ms	512 KiB

cave

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

void exploreCave(int N) {
    int S[N], P[N];
    for (int i = 0; i < N; i++) {
        S[i] = 0;
        P[i] = -1;
    }
    vector<int> r;
    for (int i = 0; i < N; i++) r.push_back(i);
    while (true) {
        int d = tryCombination(S);
        if (d == -1) break;
        for (int i = 0; i < (int)r.size(); i++) {
            int idx = r[i];
            S[idx] = 1 - S[idx];
            int res = tryCombination(S);
            if (res > d) {
                P[d] = idx;
                r.erase(r.begin() + i);
                break;
            } else {
                S[idx] = 1 - S[idx];
            }
        }
    }
    answer(S, P);
}

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