Submission #149664

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

king

#include "king.h"
using namespace std;

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

vassal

#include "vassal.h"
#include <vector>
#include <algorithm>
#define pii pair<int,int>
using namespace std;

vector<pii> vec;
long long n;
int p[100001];
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 });
	}
	n = N;
	for (int i = 0; i < n; i++) {
		p[i] = i;
	}
	sort(vec.begin(), vec.end());
}

int Maid(int W){
	int idx = lower_bound(vec.begin(), vec.end(), pii(W, -1)) - vec.begin();
	idx++;
	idx = find(idx);
	if (idx != 0) {
		merge(idx - 1, idx);
		return vec[idx - 1].second;
	}

	return -1;
}

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