Submission #150503

#	Time	Username	Problem	Language	Result	Execution time	Memory
150503		오리버스부릉부릉 (#200)	King of Chairs (FXCUP4_chairs)	C++17	100 / 100	123 ms	7196 KiB

king

#include "king.h"
using namespace std;

long long SendInfo(std::vector<int> W, std::vector<int> C) {
	return 0;
}

vassal

#include "vassal.h"
#include <vector>
#include <algorithm>
#include <cassert>
#define pii pair<int,int>
#define sz(x) (int)(x).size()
using namespace std;

vector<pii> vec;
int n;
int p[100002];
char visit[100002];

int find(int a) {
	if (p[a] == a) return a;
	return p[a] = find(p[a]);
}

void merge(int a, int b) {
	a = find(a); b = find(b);
	if (a == b) return;
	p[b] = a;
}

void Init(long long B, std::vector<int> C) {
	int N = C.size();

	for (int i = 0; i < N; i++) {
		p[i] = i;
		vec.push_back({ C[i], i });
	}

	p[N] = N;
	n = N;
	sort(vec.begin(), vec.end());
}

// �꺸�� ���̰ų� �����鼭 ���� ���� ����.

int Maid(int W) {
	int idx = upper_bound(vec.begin(), vec.end(), pii(W, -1)) - vec.begin();

	if (idx == sz(vec)) return -1;
	// printf("%d %d %d///", W, idx, vec[idx].second);

	if (visit[idx] == 0) {
		visit[idx]++;
		if (visit[idx + 1]) merge(idx + 1, idx);
		if (idx && visit[idx - 1]) merge(idx, idx - 1);
		return vec[idx].second;
	}
	else {
		idx = find(idx);
		idx++;
		if (idx >= sz(vec)) return -1;

		visit[idx]++;
		if (visit[idx + 1]) merge(idx + 1, idx);
		if (idx && visit[idx - 1]) merge(idx, idx - 1);
		return vec[idx].second;
	}
}

• Subtask 1: 17 / 17
• Subtask 2: 38 / 38
• Subtask 3: 45 / 45