Submission #1298433

#TimeUsernameProblemLanguageResultExecution timeMemory
1298433alexiahCave (IOI13_cave)C++20
12 / 100
7 ms352 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int n) {
    int doors[n];
    vector<int> conex (n);
    for(int i = 0; i < n; i++) conex[i] = i;
    for(int i = 0; i < n; i++) doors[i] = 0;
    int act = 0;
    while(act != -1){
        act = tryCombination(doors);
        doors[act] = 1;
    }
    int uni[n];
    for(int i = 0; i < n; i++){
        uni[i] = conex[i];
    }
    answer(doors , uni);
}
#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...