제출 #502666

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502666		sidon	Minerals (JOI19_minerals)	C++17	85 / 100	38 ms	2772 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

const int LIM = 43e3;

int A[LIM], L, R = -1, last;
bool in[LIM*2+1];

#define ask(Z) (last = Query(Z))

void extend(int lv, int rv) {
	for(int _ : {1, 0}){
		for(int i = L; i <= R; ++i) 
			if(!(lv <= i && i <= rv)) ask(A[i]);
		if(_) swap(L, lv), swap(R, rv);
	}
}

void dfs(int l, int r, vector<int> b) {
	if(r - l < 1) return;
	if(r - l < 2) return Answer(A[l], b[0]);

	int m = (l + r) / 2;

	extend(l, m-1);
	vector<int> bL, bR;

	for(int &i : b) {
		if((int)size(bL) == m - l) {
			bR.push_back(i);
			continue;
		}
		if((int)size(bR) == r - m) {
			bL.push_back(i);
			continue;
		}
		int prev = last;
		(prev == ask(i) ? bL : bR).push_back(i);
		in[i] ^= 1;
	}

	dfs(l, m, bL);
	dfs(m, r, bR);
}

void Solve(int N) {
	vector<int> b;

	for(int i = 1; i <= N * 2; ++i) {
		if(R == N - 1 || ask(i) < R + 2) {
			b.push_back(i);
			in[i] = 1;
		} else A[++R] = i;
	}
	dfs(0, N, b);
}

• Subtask 1: 6 / 6
• Subtask 2: 25 / 25
• Subtask 3: 9 / 9
• Subtask 4: 30 / 30
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10