Submission #839300

#TimeUsernameProblemLanguageResultExecution timeMemory
839300erekir동굴 (IOI13_cave)C++17
12 / 100
15 ms464 KiB
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

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