제출 #650019

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
650019		Markomafko972	동굴 (IOI13_cave)	C++14	100 / 100	360 ms	552 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
using namespace std;

const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int OFF = (1 << 20);

int bio[5005];
int koji[5005];
int pok[5005];

void promjena(int lo, int mid, int pravi) {
	for (int i = lo; i <= mid; i++) {
		if (bio[i] == -1) pok[i] = pravi;
	}
}

void exploreCave(int n) {
    memset(bio, -1, sizeof bio);
    
    for (int i = 0; i < n; i++) {
    	int pravi = 0;
		for (int j = 0; j < n; j++) {
			if (bio[j] == -1) pok[j] = 0;
			else pok[j] = bio[j];
		}
		int tren = tryCombination(pok);
		if (tren == i) {
			pravi = 1;
		}
		else {
			for (int j = 0; j < n; j++) {
				if (bio[j] == -1) pok[j] = 1;
			}
		}
	
		int lo = 0, hi = n-1;
		while (lo < hi) {
			int mid = (lo + hi) / 2;
			promjena(lo, mid, pravi);
			int odg = tryCombination(pok);
			promjena(lo, mid, 1-pravi);
			
			if (odg == i) {
				lo = mid+1;
			}
			else {
				hi = mid;
			}
		}
		
		bio[lo] = pravi;
		koji[lo] = i;
	}
    
    answer(bio, koji);
}

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