Submission #1298520

#	Time	Username	Problem	Language	Result	Execution time	Memory
1298520		alexiah	Cave (IOI13_cave)	C++20	0 / 100	170 ms	516 KiB

cave

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

void exploreCave(int n) {
    int comb[n]; int conex[n]; int vis[n];
    for(int i = 0; i < n; i++){
        comb[i] = 0; conex[i] = -1; vis[i] = 0;
    }
    for(int i = 0; i < n; i++){
        int swiid = -1;
        for(int j = 0; j < n; j++){
            if(vis[j]) continue;
            int aux = comb[j];
            comb[j] = 0;
            int act = tryCombination(comb);
            comb[j] = aux;
            if(act == i){
                swiid = j;
                break;
            }
        }
        vis[swiid] = 1;
        conex[swiid] = i;
        int aux = comb[swiid]; comb[swiid] = 0;
        int act = tryCombination(comb);
        if(!(act == -1 || act > i)) comb[swiid] = 1;
    } 
    answer(comb , conex);
}

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