제출 #670592

#제출 시각아이디문제언어결과실행 시간메모리
670592mseebacher동굴 (IOI13_cave)C++17
0 / 100
1 ms340 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] = i;
	}
	int s[n];
	for(int i = 0;i<n;i++) s[i] = 0;
	int val = tryCombination(s);
	while(val != -1){
		s[val-1] = 1-s[val-1];
		val = tryCombination(s);
	}
	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...