Submission #1231927

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231927		badge881	Cave (IOI13_cave)	C++20	33 / 100	125 ms	516 KiB

cave

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

void exploreCave(int N)
{
    // sub3

    vector<int> S(N, 0), D(N);
    vector<bool> known(N, false);
    for (int doorId = 0; doorId < N; doorId++)
        for (int switchId = 0; switchId < N; switchId++)
        {
            if (known[switchId])
                continue;
            int res1 = tryCombination(S.data());
            S[switchId] = 1;
            int res2 = tryCombination(S.data());
            S[switchId] = 0;
            if (res1 != res2 && (res1 == doorId || res2 == doorId))
            {
                D[switchId] = doorId;
                S[switchId] = res1 == doorId ? 1 : 0;
                known[switchId] = true;
                break;
            }
        }
    answer(S.data(), D.data());
}

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