Competitive_Programming/codeforces/1405/C.cpp at master · nishitsharma03/Competitive_Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
//#pragma GCC optimize "trapv"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define vll vector<ll>
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll add(ll x, ll y) {ll res = x + y; return (res >= MOD ? res - MOD : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= MOD ? res % MOD : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + MOD : res);}
ll power(ll x, ll y) {ll res = 1; x %= MOD; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
ll mod_inv(ll x) {return power(x, MOD - 2);}

using namespace std;
const int N=3e5+5;
int dp[N][2];
int n,k;
string s;


int main()
{ quick;
#ifndef ONLINE_JUDGE
    freopen("D:/sublime/input.txt", "r", stdin);
    freopen("D:/sublime/output.txt", "w", stdout);
#endif
	int t;
	cin>>t;
	while(t--)
	{

		cin>>n>>k;
		cin>>s;
		fab(0,n,i)
		{
			dp[i][0]=-1;
			dp[i][1]=-1;
		}
		int tot=0,op=0;
		fab(0,k,i)
		{
			if(s[i]=='0')
				tot++;
			else if(s[i]=='?')
				op++;
		}
		int ans=1;
		fab(0,n-k,i)
		{

			if(tot+op<k/2 or tot>k/2)
				{ans=-1;
			break;}
			if(s[i+k]=='0')
				{if(s[i]=='1')
				ans=-1;}
			else if(s[i+k]=='1' and s[i]=='0')
				ans=-1;
			else if(s[i+k]=='?')
				s[i+k]=s[i];
		//	cout<<"i:"<<i<<" "<<s[i+k]<<endl;
			op-=(s[i]=='?');
			tot-=(s[i]=='0');
			op+=(s[i+k]=='?');
			tot+=(s[i+k]=='0');

		}
	//	cout<<"cc:"<<s<<endl;
		op=0;tot=0;
		fab(0,k,i)
		{
			if(s[i]=='0')
				tot++;
			else if(s[i]=='?')
				op++;
		}


		fab(0,n-k+1,i)
		{
			if(i>0)
			{
			op+=(s[i+k-1]=='?');
			tot+=(s[i+k-1]=='0');
			}

			if(tot+op<k/2 or tot>k/2)
			{
				ans=-1;
				break;
			}
			op-=(s[i]=='?');
			tot-=(s[i]=='0');
		}
		cout<<(ans==-1?"NO":"YES")<<endl;


	}


 cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
	return 0;
}