Submission #161605

#	Time	Username	Problem	Language	Result	Execution time	Memory
161605		kostia244	동굴 (IOI13_cave)	C++14	33 / 100	69 ms	632 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
const int maxn = 5051;
int n;
int S[maxn], D[maxn];
void exploreCave(int N) {
	n = N;
	memset(S, 0, sizeof S);
	memset(D, -1, sizeof D);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if(D[j]!=-1)continue;
			int a = tryCombination(S);
			S[j] ^= 1;
			int b = tryCombination(S);
			if(a==b)continue;
			if (a == i) {
				D[j]=i;
				break;
			}
			if (b == i) {
				D[j]=i;
				S[j] ^= 1;
				break;
			}
		}
	}
	answer(S, D);
}

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