Submission #149281

#TimeUsernameProblemLanguageResultExecution timeMemory
149281Ragtag Volunteers (#200)King of Chairs (FXCUP4_chairs)C++17
0 / 100
52 ms3788 KiB
#include "king.h"

long long SendInfo(std::vector<int> W, std::vector<int> C) {
	int N = W.size();
	int ten = 1;
	int send = 0;
	for (int i = N - 1; i >= 0; --i) {
		send += W[i] * ten;
		ten *= 10;
	}
	return send;
}
#include "vassal.h"
#include <stdio.h>
#include <unordered_map>

long long BB;
std::unordered_map<int, std::vector<int>> ans;

void Init(long long B, std::vector<int> C){
	int N = C.size();
	BB = B;
	std::vector<int> occ(N), W;
	while (B) {
		W.push_back(B % 10);
		B /= 10;
	}

	for (int i = N - 1; i >= 0; --i) {
		ans[W[i]].push_back(-1);
		for (int j = 0; j < N; ++j) {
			if (occ[j] == 0 and C[j] >= W[i]) {
				occ[j] = 1;
				ans[W[i]][ans[W[i]].size() - 1] = j;
				break;
			}
		}
	}
}

int Maid(int W){
	int temp = ans[W].back();
	ans[W].pop_back();
	return temp;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...