Submission #161603

#TimeUsernameProblemLanguageResultExecution timeMemory
161603kostia244Cave (IOI13_cave)C++14
13 / 100
24 ms436 KiB
#include "cave.h"
#include<bits/stdc++.h>
const int maxn = 5051;
int n;
int S[maxn], D[maxn];
void exploreCave(int N) {
    n = N;
    memset(S, 0, sizeof S);
    for(int i = 0; i < n; i++) {
    	S[i] = 1;
    	D[i] = tryCombination(S);
    	S[i] = 0;
    }
    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...