【Codeforces】CF 2014 H

浅慕Antonio

于 2024-10-07 17:34:37 发布

阅读量348

点赞数 13

分类专栏：算法竞赛文章标签：算法 c++ 开发语言

本文链接：https://blog.csdn.net/Antonio915/article/details/142743644

版权

算法竞赛专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Robin Hood Archery

#异或哈希 #博弈论 #贪心

题目描述

Sheriff of Nottingham has organized a tournament in archery. It’s the final round and Robin Hood is playing against Sheriff! There are $n$ targets in a row numbered from $1$ to $n$ . When a player shoots target $i$ , their score increases by $a_i$ and the target $i$ is destroyed. The game consists of turns and players alternate between whose turn it is. Robin Hood always starts the game, then Sheriff and so on. The game continues until all targets are destroyed. Both players start with score $0$ . At the end of the game, the player with most score wins and the other player loses. If both players have the same score, it’s a tie and no one wins or loses. In each turn, the player can shoot any target that wasn’t shot before. Both play optimally to get the most score possible. Sheriff of Nottingham has a suspicion that he might lose the game! This cannot happen, you must help Sheriff. Sheriff will pose $q$ queries, each specifying $l$ and $r$ . This means that the game would be played only with targets $\dots, r$ , as others would be removed by Sheriff before the game starts. For each query $l$ , $r$ , determine whether the Sheriff can not lose the game when only considering the targets $\dots, r$ .

输入格式

The first line of input contains one integer $t$ ( $\le t \le 10^4$ ) — the number of test cases. The first line of each test case contains two integers $n$ , $q$ ( $\le n,q \le 2\cdot10^5$ ) — the number of targets and the queries Sheriff will pose. The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $\le a_i \le 10^6$ ) — the points for hitting each target. Then follow $q$ lines, each with two integers $l$ and $r$ ( $\le l \le r \le n$ ) — the range of the targets that is considered for each query. It is guaranteed that the sum of both $n$ and $q$ across all test cases does not exceed $\cdot 10^5$ .

输出格式

For each query, output “YES”, if the Sheriff does not lose the game when only considering the targets $\dots, r$ , and “NO” otherwise. You can output the answer in any case (upper or lower). For example, the strings “yEs”, “yes”, “Yes”, and “YES” will be recognized as positive responses.

样例 #1

样例输入 #1

样例输出 #1

NO
NO
YES
NO
NO
YES

解题思路

首先发现后手永远不可能赢，因为先手总是可以拿最大的，只有当每个数出现的次数为偶数的时候，才会出现平局，我们要判断的就是会不会出现平局。

也就是我们需要求一个区间内出现的次数是否都是偶数，显然，这可以使用异或哈希来求解，预处理每个节点的哈希桶之后，我们只需要判断 $h s [r]$ 是否等于 $h s [l - 1]$ 即可。

代码

//solve函数
const int N = 1e6 + 10;

std::mt19937_64 rnd(time(0));
ull cnt[N], rd[N];

void solve() {
	int n, q;
	std::cin >> n >> q;
	
	std::vector<int>a(n + 1);
	for (int i = 1; i <= n; ++i) {
		std::cin >> a[i];
		rd[a[i]] = rnd();
	}

	std::vector<ull>hs(n + 1);
	for (int i = 1; i <= n; ++i) {
		hs[i] = hs[i - 1];
		hs[i] -= cnt[a[i]] * rd[a[i]];

		cnt[a[i]]++; cnt[a[i]] %= 2;

		hs[i] += cnt[a[i]] * rd[a[i]];
	}

	while (q--) {
		int l, r;
		std::cin >> l >> r;
		if (hs[r] == hs[l - 1]) {
			std::cout << "YES\n";
		}
		else {
			std::cout << "NO\n";
		}
	}
	//清空
	for (int i = 1; i <= n; ++i) {
		cnt[a[i]] = rd[a[i]] = 0;
	}
}

signed main() {
	std::ios::sync_with_stdio(0);
	std::cin.tie(0);
	std::cout.tie(0);

	int t = 1;
	std::cin >> t;

	while (t--) {
		solve();
	}
};