CodeChef/ALTSUFF.cpp at main · Sahiljawale/CodeChef · 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
/* https://www.codechef.com/problems/ALTSUFF?tab=statement */

//Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    ll t, n, k, i, j;
    string a;
    cin>>t;

    for(;t--;)
    {
        cin>>n>>k;
        ll op[n], left[n], right[n];

        cin>>a;

        for(i=0; i<n; i++)
        {
            left[i]=right[i]=10000000000;
        }

        j=-1;

        for(i=0; i<n; i++)
        {
            if(a[i]=='1'){
                j=i;
            }else{
                if(j!=-1){
                    left[i]=i-j;
                }
            }
        }

        j=-1;

        for(i=n-1; i>=0; i--)
        {
            if(a[i]=='1'){
                j=i;
            }else{
                if(j!=-1){
                    right[i]=j-i;
                }
            }
        }


        j=-1;

        for(i=0; i<n; i++)
        {
            if(a[i]=='0'){
                j=i;
            }else{
                if(j!=-1){
                    left[i]=i-j;
                }
            }
        }

        j=-1;

        for(i=n-1; i>=0; i--)
        {
            if(a[i]=='0'){
                j=i;
            }else{
                if(j!=-1){
                    right[i]=j-i;
                }
            }
        }


        for(i=0; i<n; i++)
        {
            if(a[i]=='0'){
                j=min(left[i], right[i]);
                if(j<=k){
                    op[i]=k-j+1;
                    if((op[i]%2)==1){
                    a[i]='1';
                }
                }

            }else{
                j=min(left[i], right[i]);
                a[i]='0';
                if(j<=k-1){
                    op[i]=k-1-j+1;
                    if((op[i]%2)==1){
                    a[i]='1';
                }
                }

            }
        }

        for(i=0; i<n; i++)
        {
            cout<<a[i];
        }
        cout<<"\n";

    }

}