Submission #1315550

#TimeUsernameProblemLanguageResultExecution timeMemory
1315550aaaaaaaaCave (IOI13_cave)C++20
12 / 100
13 ms484 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

void exploreCave(int N) {
    int S[N], D[N];

    for(int i = 0; i < N; ++i) D[i] = i, S[i] = 0;

    for(int i = 0; i < N; ++i){
        int ans = tryCombination(S);
        if(ans == -1) break;
        if(ans <= i) S[i] ^= 1;
    }

    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...