답안 #149706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149706 2019-09-01T06:59:56 Z 오리버스부릉부릉(#3679, rdd6584, orihehe, phpark) King of Chairs (FXCUP4_chairs) C++17
0 / 100
54 ms 4300 KB
#include "king.h"
using namespace std;

long long SendInfo(std::vector<int> W, std::vector<int> C) {
	return 0;
}
#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 });
	}
	p[N] = N;
	n = N;
	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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 900 KB Correct
2 Runtime error 10 ms 1052 KB Execution failed because the return code was nonzero
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 52 ms 4300 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 54 ms 4292 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -