Submission #1142906

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142906		turska	Cave (IOI13_cave)	C++20	46 / 100	16 ms	752 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
const int maxN = 5000;
int S[maxN];
int D[maxN];
void exploreCave(int N) {
    int prv = tryCombination(S);
    set<int> st;
    for (int i=0; i<N; i++) st.insert(i);
    while (prv!=-1) {
        for (auto i: st) {
            S[i] = 1;
            int cur = tryCombination(S);
            if (cur==prv) {
                S[i] = 0;
                continue;
            };
            st.erase(i);
            if (cur!=-1 && cur<prv) {
                S[i] = 0;
            }             
            if (cur==-1) prv = -1;
            else prv = max(prv, cur);
            break;
        }
    }
    for (int i=0; i<N; i++) {
        S[i] ^= 1;
        D[i] = tryCombination(S);
        S[i] ^= 1;
    }
    answer(S, D);
}

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