Submission #984591

#TimeUsernameProblemLanguageResultExecution timeMemory
984591SzymonKrzywdaCave (IOI13_cave)C++17
0 / 100
18 ms348 KiB
#include"cave.h"
#include <bits/stdc++.h>
using namespace std;


int tryCombination(int S[]);

void answer(int S[],int D[]);

void exploreCave(int N){
    int S[N];
    int D[N];
    int w = 0;
    for (int i=0; i<N; i++){
        w = tryCombination(S);
        if (w != -1) S[w] = 1;
        else break;
    }
    
    for (int i=0; i<N; i++){
        S[i] = (S[i]+1)%2;
        D[i] = tryCombination(S);
        S[i] = (S[i]+1)%2;
    }
    
    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...