Submission #1243680

#	Time	Username	Problem	Language	Result	Execution time	Memory
1243680		mathias_abadie	Cave (IOI13_cave)	C++20	0 / 100	1 ms	328 KiB

cave

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



void exploreCave(int n) {
    int s[n], d[n];
    for (int i = 0; i < n; i++) {
        s[i] = 0;
    }

    for (int i = 0; i < n; i++) {
    int posicion = 0;
        for (int j = 0; j < n; j++) {
        int closed = tryCombination(s);
            if (closed == posicion){
                s[j]= 1;
                int open = tryCombination(s);
                if (open != posicion){
                d[i]= j;
                }
                break;
            }
        int open = tryCombination(s);
            if (open != posicion){
                s[j]= 1;
                int closed = tryCombination(s);
                if (closed == posicion){
                d[i]= j;
                }
                break;
            }
    }
    posicion++;
    }
    answer(s, d);
}

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