Submission #1298435

#	Time	Username	Problem	Language	Result	Execution time	Memory
1298435		alexiah	Cave (IOI13_cave)	C++20	0 / 100	7 ms	348 KiB

cave

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

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