제출 #672672

#제출 시각아이디문제언어결과실행 시간메모리
672672Hacv16동굴 (IOI13_cave)C++17
12 / 100
17 ms432 KiB
#include<bits/stdc++.h>
#include "cave.h"

using namespace std;
 
typedef long long ll;
const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;

//subtask1: door[i] = i for every i

void exploreCave(int n){
	int S[n] = {0}, 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...