제출 #672739

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
672739		Hacv16	동굴 (IOI13_cave)	C++17	0 / 100	29 ms	392 KiB

cave

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

using namespace std;
 
typedef long long ll;
const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;

//Subtask 3 : N <= 100
bool mark[MAX];

void exploreCave(int n){
	int S[n] = {0}, D[n] = {0};

	for(int door = 0; door < n; door++){	
		int aux = tryCombination(S);
		int color = (aux == door ? 1 : 0);

		for(int s = 0; s < n; s++){
			if(mark[s]) continue;
			S[s] = !color;
		}

		int Switch = 0;

		for(int s = 0; s < n; s++){
			if(mark[s]) continue;
			S[s] = color;

			int t = tryCombination(S);
			if(t != door){
				Switch = s;
				break;
			}

			S[s] = !color;
		}

		mark[Switch] = true;
		S[Switch] = color;
		D[Switch] = door;
	}

	answer(S, D);
}

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