Submission #72697

#TimeUsernameProblemLanguageResultExecution timeMemory
72697RezwanArefin01Cave (IOI13_cave)C++17
12 / 100
36 ms608 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std; 

void exploreCave(int N) {
    int S[N], D[N];
    memset(S, 0, sizeof S); 
    for(int i = 0; i < N; i++) {
        int x = tryCombination(S); 
        if(x == -1) break; 
        if(x <= i) 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...