Submission #1164616

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164616		crispxx	동굴 (IOI13_cave)	C++20	34 / 100	28 ms	512 KiB

cave

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define eb emplace_back
#define pb push_back
#define ar array
#define nl '\n'

#include "cave.h"
// #include "grader.c"

void exploreCave(int n) {
	int S[n]{}, D[n];
	
	for(int i = 0; i < n; i++) {
		int cur = tryCombination(S), flag = 0;
		if(cur == -1) break;
		for(int j = 0; j < n; j++) {
			if(S[j]) continue;
			S[j] = 1;
			int f = tryCombination(S);
			if(f == -1) {
				flag = 1;
				break;
			}
			if(f > cur) {
				break;
			}
			S[j] = 0;
		}
		if(flag) break;
	}
	
	for(int i = 0; i < n; i++) {
		S[i] = !S[i];
		D[i] = tryCombination(S);
		S[i] = !S[i];
	}
	
	answer(S, D);
}

• Subtask 1: 0 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24