Submission #1102658

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1102658	2024-10-18T15:06:43 Z	xnqs	Topical (NOI23_topical)	C++17	33 / 100	618 ms	305612 KB

Main

#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <map>
#include <unordered_set>

struct Module {
	int n;
	std::vector<int> req;
	std::vector<int> add;

	Module(int n = 0): n(n) {
		req.assign(n, 0);
		add.assign(n, 0);
	}
};

struct TrieNode {
	int last = -1;
	std::unordered_set<int> idx;
	int pfx_cnt = 0;
	std::map<int, TrieNode*> next;

	~TrieNode() {
		for (auto& [key, val] : next) {
			if (val) {
				delete val;
			}
		}
		next.clear();
	}
};

int x, k;
std::vector<Module> arr;
TrieNode* root = new TrieNode;

void add_word(TrieNode* root, const std::vector<int>& word, int val) {
	for (int i = 0; i < k; i++) {
		if (!root->next[word[i]]) {
			root->next[word[i]] = new TrieNode;
		}

		root = root->next[word[i]];
		++root->pfx_cnt;
	}

	root->idx.emplace(val);
}

int search(TrieNode* root, const std::vector<int64_t>& cap, std::vector<int64_t>& add, int pos = 0) {
	if (pos == k) {
		for (int i = 0; i < k; i++) {
			for (const auto& j : root->idx) {
				add[i] += arr[j].add[i];
			}
		}

		int ret = (int)root->idx.size();
		root->pfx_cnt -= root->idx.size();
		root->idx.clear();
		return ret;
	}

	int ret = 0;
	for (auto it = root->next.lower_bound(root->last); it != root->next.end(); it++) {
		auto [key, node] = *it;
		if (key > cap[pos]) {
			break;
		}
		if (node->pfx_cnt <= 0) {
			continue;
		}

		int tmp = search(node, cap, add, pos+1);
		ret += tmp;
		root->pfx_cnt -= tmp;

		if (!node->pfx_cnt) {
			root->last = key;
		}
	}

	return ret;
}

void solve_k1() {
	std::sort(arr.begin(), arr.end(), [](const Module& a, const Module& b) {
		return a.req[0] < b.req[0];
	});

	int ans = 0;
	int64_t curr_skill = 0;
	for (const auto& it : arr) {
		int req = it.req[0];
		int add = it.add[0];

		if (curr_skill < req) {
			break;
		}

		++ans;
		curr_skill += add;
	}

	std::cout << ans << "\n";
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	std::cout.tie(NULL);

	std::cin >> x >> k;
	arr.reserve(x);
	for (int i = 0; i < x; i++) {
		arr.emplace_back(k);
		for (int j = 0; j < k; j++) {
			std::cin >> arr[i].req[j];
		}
	}
	for (int i = 0; i < x; i++) {
		for (int j = 0; j < k; j++) {
			std::cin >> arr[i].add[j];
		}
	}

	if (k==1) {
		solve_k1();
		return 0;
	}
	
	for (int i = 0; i < x; i++) {
		add_word(root, arr[i].req, i);
	}

	std::vector<int64_t> cap(k, 0);
	int ans = 0;
	while (1) {
		std::vector<int64_t> add(k, 0);
		int nodes = search(root, cap, add);
		if (!nodes) {
			break;
		}

		ans += nodes;
		for (int i = 0; i < k; i++) {
			cap[i] += add[i];
		}
	}

	std::cout << ans << "\n";
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	4 ms	2384 KB	Output is correct
4	Correct	381 ms	305612 KB	Output is correct
5	Correct	385 ms	305600 KB	Output is correct
6	Correct	385 ms	305600 KB	Output is correct
7	Correct	252 ms	211804 KB	Output is correct

Subtask #2

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Incorrect	1 ms	336 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #3

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	5 ms	1616 KB	Output is correct
4	Correct	37 ms	12112 KB	Output is correct
5	Correct	34 ms	12112 KB	Output is correct
6	Correct	507 ms	117832 KB	Output is correct
7	Correct	618 ms	117832 KB	Output is correct
8	Correct	567 ms	117780 KB	Output is correct
9	Correct	526 ms	117832 KB	Output is correct

Subtask #4

0 / 39.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	4 ms	2384 KB	Output is correct
4	Correct	381 ms	305612 KB	Output is correct
5	Correct	385 ms	305600 KB	Output is correct
6	Correct	385 ms	305600 KB	Output is correct
7	Correct	252 ms	211804 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Incorrect	1 ms	336 KB	Output isn't correct
10	Halted	0 ms	0 KB	-