【ICPC】The 2024 ICPC Kunming Invitational Contest I

Left Shifting 2

#双指针 #贪心 #数据结构

题目描述

Given a string consisting of lower-cased English letters, we say the string is beautiful if all neighboring characters are different. For example, icpc and kunming are beautiful but hello is not, because its $3$-rd and $4$-th characters are the same.

Given a string $S=s_0{s}_1\cdots s_{n-1}$ of length $n$ consisting of lower-cased English letters, let $f(S,d)$ be the string obtained by shifting $S$ to the left $d$ times. That is $f(S,d)=s_{(d+0)\mathrm{mod}n}{s}_{(d+1)\mathrm{mod}n}\cdots s_{(d+n-1)\mathrm{mod}n}$.

Let $g(S,d)$ be the smallest number of operations needed to make string $f(S,d)$ beautiful. In each operation, you can change one character in $f(S,d)$ to any lower-cased English letter.

Find a non-negative integer $d$ which minimizes $g(S,d)$ and output the minimized value.

输入格式

There are multiple test cases. The first line of the input contains an integer $T$ indicating the number of test cases. For each test case:

The first and only line contains a string $s_0{s}_1\cdots s_{n-1}$ ($1\le n\le 5\times 10^5$) consisting only of lower-cased English letters.

It’s guaranteed that the sum of $n$ of all test cases will not exceed $5\times 10^5$.

输出格式

For each test case, output one line containing one integer, indicating the smallest possible $g(S,d)$.

样例 #1

样例输入 #1

3
abccbbbbd
abcde
x

样例输出 #1

2
0
0

解题思路

首先对于这种循环移动的问题，我们都可以将它拷贝一份拼接到最后，长度变为$2\ast n$。

然后此问题就转换成了：找到一个长度为$n$的窗口，使修改成合法序列的次数最少。

容易发现，对于连续的$m$长度的相同的字符，贪心的修改$\lfloor m/2\rfloor$次即可，这个窗口对答案的贡献就是$\sum \lfloor m_i/2\rfloor$，即窗口内所有的连续长度$/2$的贡献。

容易想到使用双指针来维护这个窗口，考虑指针移动时怎么更新答案。

我们可以对每个字符都映射一个新的下标$id$，然后使用$std::map<std::pair<char,int>>$，其中$char$表示字符，而$int$表示$id-i$，$i$为原始下标，这样就能保证这个字符的连续增加的长度了。

那么就很简单了，动态更新最小答案即可。

时间复杂度在$O(nlo{g}_{2}n)$

代码

void solve() {
	std::string s;
 
	std::cin >> s;
	int n = s.size();
	s = s + s;
	s = " " + s;
 
	std::vector<std::pair<char, int>>a(2 * n + 1);
	std::vector<int>id(26);
 
	for (int i = 1; i <= 2 * n; ++i) {
		a[i] = { s[i],++id[s[i] - 'a'] };
	}
 
	std::map<pii, int>mp;
 
	int res = 0;
	auto add = [&](int idx)->void {
		int s = mp[{a[idx].first, a[idx].second - idx}]++;
 
		res -= s / 2;
		res += (s + 1) / 2;
 
		};
 
	auto del = [&](int idx)->void {
		int s = mp[{a[idx].first, a[idx].second - idx}]--;
 
		res -= s / 2;
		res += (s - 1) / 2;
 
		};
 
	for (int i = 1; i <= n; ++i) {
		add(i);
	}
 
	int ans = res;
 
	for (int R = n + 1; R <= 2 * n; ++R) {
		int L = R - n;
		del(L);
		add(R);
 
		ans = std::min(ans, res);
	}
 
	std::cout << ans << "\n";
}
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();
	}
}