Submission #150932

#TimeUsernameProblemLanguageResultExecution timeMemory
150932nvmdavaKing of Chairs (FXCUP4_chairs)C++17
100 / 100
94 ms9096 KiB
#include "king.h"
 
long long SendInfo(std::vector<int> W, std::vector<int> C) {
	return 0;
}
#include "vassal.h"
#include <bits/stdc++.h>
using namespace std;
 
int n;
vector<int> C;
 
int p[200005];
int find(int a){
	if(a != p[a]) return p[a] = find(p[a]);
	return a;
}
void Init(long long B, std::vector<int> C){
	n = C.size();
	for(int i = 0; i <= n; i++)
		p[i] = i;
	::C = C;
	return;
}
 
int Maid(int W){
	int a = lower_bound(C.begin(), C.end(), W) - C.begin();
	a = find(a);
	if(a >= n) return -1;
	p[a] = a + 1;
	return a;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...