Submission #670595

#TimeUsernameProblemLanguageResultExecution timeMemory
670595mseebacher동굴 (IOI13_cave)C++17
13 / 100
9 ms448 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
#define MAXI (int)1e5

void exploreCave(int n){
	int b[n];
	for(int i = 0;i<n;i++){
		b[i] = 0;
	}
	int s[n];
	for(int i = 0;i<n;i++) s[i] = 0;
	
	for(int i = 0;i<n;i++){
		s[i] = 1;
		int x = tryCombination(s);
		b[i] = x;
		s[i] = 0;
	}
	answer(s,b);
}
#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...