Submission #1303654

#TimeUsernameProblemLanguageResultExecution timeMemory
1303654nicolo_010동굴 (IOI13_cave)C++20
13 / 100
11 ms516 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 know_comb(int* s) {
    int a[n];
    for (int i=0; i<n; i++) {
        a[i] = s[i];
    }
    int d[n];
    for (int i=0; i<n; i++) {
        a[i] = 1-s[i];
        int dd = tryCombination(a);
        d[i] = dd;
        a[i] = s[i];
    }
    answer(s, d);
}

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