Submission #607649

#TimeUsernameProblemLanguageResultExecution timeMemory
607649jairRSCave (IOI13_cave)C++17
12 / 100
28 ms520 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;

const int MAXN = 5'000;
int switches[MAXN];

// door triggered by switchID
int door[MAXN];

void exploreCave(int N)
{
    for (int curSearching = 0; curSearching < N; curSearching++)
    {
        door[curSearching] = curSearching;
        int firstClosed = tryCombination(switches);
        if (firstClosed == curSearching)
            switches[curSearching] = !switches[curSearching];
    }

    answer(switches, door);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...