Submission #670674

#	Time	Username	Problem	Language	Result	Execution time	Memory
670674		gustavo_d	Cave (IOI13_cave)	C++17	25 / 100	32 ms	436 KiB

cave

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

void exploreCave(int N) {
    int n = N;
    int confirmed[n];
    int test[n];
    int correspondence[n];
    for (int i = 0; i < n; i++) {
        test[i] = 0;
        correspondence[i] = i;
        confirmed[i] = -1;
    }
    
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    for (int i = 0; i<n; i++) {
        if (confirmed[i] != -1) test[i] = confirmed[i];
        else test[i] = 0;
    }
    if (tryCombination(test) == -1) {
        for (int to_try = 0; to_try<n; to_try++) {
            for (int i = 0; i<n; i++) {
                if (i == to_try) test[i] = 1;
                else test[i] = 0;
            }
            confirmed[to_try] = tryCombination(test);
        }
        for (int i = 0; i<n; i++) {
            test[i] = 0;
        }
        answer(test, confirmed);
    } else {
        for(int to_try = 0; to_try<n; to_try++) {
            int certo = 0;
            for (int i = 0; i<n; i++) {
                if (confirmed[i] != -1) test[i] = confirmed[i];
                else test[i] = 0;
            }
            if (tryCombination(test) == to_try) certo = 1;
            confirmed[to_try] = certo;
        }
        answer(confirmed, correspondence);
    }
}

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