Submission #670661

#TimeUsernameProblemLanguageResultExecution timeMemory
670661gustavo_dCave (IOI13_cave)C++17
12 / 100
35 ms432 KiB
#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 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);
}
#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...