Codeforces Round #642 (Div. 3) E. K-periodic Garland

E. K-periodic Garland

You are given a garland consisting of n lamps. States of the lamps are represented by the string s of length n. The i-th character of the string si equals ‘0’ if the i-th lamp is turned off or ‘1’ if the i-th lamp is turned on. You are also given a positive integer k.

In one move, you can choose one lamp and change its state (i.e. turn it on if it is turned off and vice versa).

The garland is called k-periodic if the distance between each pair of adjacent turned on lamps is exactly k. Consider the case k=3. Then garlands “00010010”, “1001001”, “00010” and “0” are good but garlands “00101001”, “1000001” and “01001100” are not. Note that the garland is not cyclic, i.e. the first turned on lamp is not going after the last turned on lamp and vice versa.

Your task is to find the minimum number of moves you need to make to obtain k-periodic garland from the given one.

You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤25 000) — the number of test cases. Then t test cases follow.

The first line of the test case contains two integers n and k (1≤n≤106;1≤k≤n) — the length of s and the required period. The second line of the test case contains the string s consisting of n characters ‘0’ and ‘1’.

It is guaranteed that the sum of n over all test cases does not exceed 106 (∑n≤106).

Output
For each test case, print the answer — the minimum number of moves you need to make to obtain k-periodic garland from the given one.

INPUT
6
9 2
010001010
9 3
111100000
7 4
1111111
10 3
1001110101
1 1
1
1 1
0

OUTPUT
1
2
5
4
0
0

Solution：

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int n,k;
		string s;
		cin>>n>>k;
		cin>>s;
		int i,j,c;
		int res,ans=0;
		for(i=0;i<s.size();i++)
		{
			if(s[i]=='1')
				ans++;
		}
		res=ans;
		for(i=0;i<k;i++)
		{
			c=0;
			for(j=i;j<n;j+=k)
			{
				c+=(s[j]=='1')?1:-1;
				c=max(c,0);
				res=min(res,ans-c);
			}
		}
		cout<<res<<endl;
	}
	return 0;
}

首先将全部灯关掉，ans记录开着的灯的数量，
然后在0~~k的范围中开始为第一盏灯，每次加k,
如果灯开着，就说明这盏灯不需要关闭，所以ans-1, res记录min(res,ans-1),
如果这盏灯关闭，则ans+1, res记录min(res,ans+1),
之后的过程与此类似，最后输出最小的步骤数res