Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- #define MOD 1000000007
- #define endl '\n'
- using namespace std;
- void solve(){
- int n, k;
- cin>>n>>k;
- string s;
- cin>>s;
- vector<int> q(k);
- for(int i=0;i<k;i++){
- cin>>q[i];
- }
- ll res = 0;
- for(int i=0; i < n-1 ; i++){
- if(s[i] == s[i+1])
- res += 2;
- else
- res++;
- }
- for(int j=0; j < k; j++){
- int i = q[j] - 1;
- if(s[i] == '1')
- s[i] = '0';
- else
- s[i] = '1';
- if(i > 0){
- if(s[i-1] == s[i])
- res++;
- else
- res--;
- }
- if(i < n-1){
- if(s[i+1] == s[i])
- res++;
- else
- res--;
- }
- cout<<res<<endl;
- }
- }
- signed main() {
- ios_base::sync_with_stdio(false);
- cin.tie(NULL);
- int t;
- cin>>t;
- while(t--)
- solve();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement