题解：CF367A Sereja and Algorithm

平底郭_ggc

于 2024-08-30 20:10:22 发布

阅读量675

点赞数 17

文章标签：算法

本文链接：https://blog.csdn.net/ggcggcggcggcggc/article/details/141726300

版权

推一下蒟蒻的博客

题面

Sereja and Algorithm

题面翻译

给出一个字符串，元素只有 $x$ , $y$ , $z$ 这三种，现给出一个区间 $[l, r]$ ，这个区间内的字符可以任意调换，如果变换之后这个区间字符串的所有子串都是 zyx 或 xzy 或 yxz 的话，输出 yes（若 $r - l < 2$ 也输出 YES ），否则输出 NO。

题目描述

Sereja loves all sorts of algorithms. He has recently come up with a new algorithm, which receives a string as an input. Let’s represent the input string of the algorithm as $q=q_{1}q_{2}...\ q_{k}$ . The algorithm consists of two steps:

Find any continuous subsequence (substring) of three characters of string $q$ , which doesn’t equal to either string zyx, xzy, yxz. If $q$ doesn’t contain any such subsequence, terminate the algorithm, otherwise go to step 2.
Rearrange the letters of the found subsequence randomly and go to step 1.

Sereja thinks that the algorithm works correctly on string $q$ if there is a non-zero probability that the algorithm will be terminated. But if the algorithm anyway will work for infinitely long on a string, then we consider the algorithm to work incorrectly on this string.

Sereja wants to test his algorithm. For that, he has string $s=s_{1}s_{2}...\ s_{n}$ , consisting of $n$ characters. The boy conducts a series of $m$ tests. As the $i$ -th test, he sends substring $s_{li}s_{li}+1...\ s_{ri}$ $\le l_{i} \le r_{i} \le n)$ to the algorithm input. Unfortunately, the implementation of his algorithm works too long, so Sereja asked you to help. For each test $l_{i},r_{i})$ determine if the algorithm works correctly on this test or not.

输入格式

The first line contains non-empty string $s$ , its length ( $n$ ) doesn’t exceed $10^{5}$ . It is guaranteed that string $s$ only contains characters: ‘x’, ‘y’, ‘z’.

The second line contains integer $m$ $\le m \le 10^{5})$ — the number of tests. Next $m$ lines contain the tests. The $i$ -th line contains a pair of integers $l_{i}$ , $r_{i}$ $\le l_{i} \le r_{i} \le n)$ .

输出格式

For each test, print YES (without the quotes) if the algorithm works correctly on the corresponding test and NO (without the quotes) otherwise.

样例 #1

样例输入 #1

zyxxxxxxyyz
5
5 5
1 3
1 11
1 4
3 6

样例输出 #1

YES
YES
NO
YES
NO

提示

In the first example, in test one and two the algorithm will always be terminated in one step. In the fourth test you can get string “xzyx” on which the algorithm will terminate. In all other tests the algorithm doesn’t work correctly.

题解

思路

当 $r - l < 2$ 时，输出 YES。
当 $\ge 2$ 时：

因为要多次用到区间内 $x, y, z$ 的数量，考虑使用前缀计数。
如果变换之后这个区间字符串的所有子串都是 zyx 或 xzy 或 yxz，那么这个区间内 $x, y, z$ 的数量差不超过 $1$ 。

代码

#include<bits/stdc++.h>
#define int long long
using namespace std;
int t, l, r, cntx[100005], cnty[100005], cntz[100005];
string s;
signed main() {
	cin.tie(0), cout.tie(0);
	cin >> s >> t;
	s = '$'+s ;
	for (int i = 1; i < s.size(); i++) {// 前缀计数
		cntx[i] = cntx[i - 1] + (s[i] == 'x' ? 1 : 0);
		cnty[i] = cnty[i - 1] + (s[i] == 'y' ? 1 : 0);
		cntz[i] = cntz[i - 1] + (s[i] == 'z' ? 1 : 0);
	}
	while (t--) {
		cin >> l >> r;
		if (r - l < 2) { //输出 YES
			cout << "YES\n";
			continue;
		}
		int x = cntx[r] - cntx[l - 1], y = cnty[r] - cnty[l - 1], z = cntz[r] - cntz[l - 1];// x,y,z 的数量
		if (abs(x - y)  \le  1 && abs(y - z)  \le  1 && abs(x - z)  \le  1)	cout << "YES\n";
		else 	cout << "NO\n";
	}

	return 0;
}