Submission #1303653

#TimeUsernameProblemLanguageResultExecution timeMemory
1303653nicolo_010동굴 (IOI13_cave)C++20
12 / 100
8 ms520 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int n;

void know_i(int* d) {
    //d[i] = j significa que el switch i esta conectada a la puerta j.
    //a[i] = j. "                     " j "                        " i.
    int s[n];
    int a[n];
    for (int i=0; i<n; i++) {
        a[d[i]] = i;
        s[i] = 0;
    }
    for (int i=0; i<n; i++) {
        s[a[i]] = 1;
        int dd = tryCombination(s);
        if (dd == i) s[a[i]] = 0;
        else s[a[i]] = 1;
    }
    answer(s, d);
}

void exploreCave(int N) {
    n = N;
    int d[n];
    for (int i=0; i<n; i++) {
        d[i] = i;
    }
    know_i(d);
    return;
}
#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...