제출 #318796

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
318796		jerrymonkey	동굴 (IOI13_cave)	C++14	0 / 100	517 ms	612 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

using namespace std;


void exploreCave (int N) {
    int known[N], correctSw[N];
    for (int i = 0; i < N; i++)
		known[i] = -1;

    for (int i = 0; i < N; i++) {
        int segLen = pow(2, __lg(N - i - 1));
		int output[N];
		for (int i = 0; i < N; i++)
			output[i] = known[i];
        int c = 0, pos = 0;
		for (int j = 0; j < N; j++) {
			if (output[j] == -1)
				output[j] = 0;
		}
		bool doorSw = 0;
		if (tryCombination(output) > i)
			doorSw = 0;
		else
			doorSw = 1;
        while (1) {
			for (int j = 0; j < N; j++) {
				if (output[j] == -1) {
					output[j] = ((c / segLen + doorSw) % 2);
					c++;
				}
			}
			if (!(tryCombination(output) > i))
                pos = pos | (1 << __lg(segLen));
			if (segLen == 1)
				break;
			segLen /= 2;
        }

		int k = 0;
        for (int j = 0; j < N; j++) {
            if (known[j] == -1) {
                if (k == pos) {
					known[j] = doorSw;
					correctSw[doorSw] = i;
					break;
                }
                k++;
            }
        }

	}

    answer(known, correctSw);


}

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