Submission #1263239

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263239		blueviolet	Cave (IOI13_cave)	C++20	0 / 100	6 ms	580 KiB

cave

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



int s[5009], d[5009];
set<int> st;

void exploreCave(int N) {
    st.clear();
    for (int i = 0; i < N; i++) {
        s[i] = 0;
        d[i] = 0;
        st.insert(i);
    }

    while (true) {
        int firstClosed = tryCombination(s);
        if (firstClosed == -1) break;

        for (auto it = st.begin(); it != st.end();) {
            int pos = *it;
            s[pos] ^= 1;
            int pp = tryCombination(s);
            if (pp == -1) break;

            if (pp < firstClosed) {
                s[pos] ^= 1;
                d[pos] = pp;
                it = st.erase(it);
            } else if (pp > firstClosed) {
                d[pos] = firstClosed;
                it = st.erase(it);
                break;
            } else {
                s[pos] ^= 1;
                ++it;
            }
        }
    }
    answer(s, d);
}

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