Submission #672676

#TimeUsernameProblemLanguageResultExecution timeMemory
672676Hacv16Cave (IOI13_cave)C++17
13 / 100
15 ms424 KiB
#include<bits/stdc++.h>
#include "cave.h"

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

//subtask2

void exploreCave(int n){
	int S[n] = {0}, D[n] = {0};

	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...