Submission #1008412

#TimeUsernameProblemLanguageResultExecution timeMemory
1008412VMaksimoski008동굴 (IOI13_cave)C++17
12 / 100
17 ms712 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int n) {
    int S[n], D[n];
    memset(S, 0, sizeof(S));
    memset(D, 0, sizeof(D));

    for(int i=0; i<n; i++) {
        for(int j=0; j<2; j++) {
            S[i] ^= 1;
            int p = tryCombination(S);
            if(p > i || p == -1) break;
            S[i] ^= 1;
        }
    }

    for(int i=0; i<n; i++) D[i] = i;
    answer(S, D);
}
#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...