Submission #148405

#	Time	Username	Problem	Language	Result	Execution time	Memory
148405		잉여로운 고3 (#200)	King of Chairs (FXCUP4_chairs)	C++17	100 / 100	120 ms	7380 KiB

king

#include "king.h"

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

vassal

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

typedef pair<int, int> pii;

const int MAXN = 100005;

long long B;
pii cs[MAXN];
int C[MAXN];
int uni[MAXN];
int N;

int guni(int x) { return x == uni[x] ? x : uni[x] = guni(uni[x]); }

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

	for(int i = 0; i < N; i++) ::C[i] = C[i];
	for(int i = 0; i < N; i++) cs[i] = make_pair(C[i], i);
	sort(cs, cs + N);
	for(int i = 0; i <= N; i++) uni[i] = i;
}

int Maid(int W){
	int l = lower_bound(cs, cs + N, make_pair(W, 0)) - cs;
	int t = guni(l);
	if(t == N) return -1;
	uni[t] = uni[t + 1];
	return t;
}

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