Leimasin

#include <bits/stdc++.h>
#define F first
#define S second
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;

const int N = 1<<20;
int pos[2*N];

void make_tree() {
    for (int i=0; i<2*N; i++) pos[i] = -1;
}

void update(int value, int a, int b, int left=0, int right=N, int node=1) {
    if (b <= left || a >= right) return;
    if (a <=left && b >= right) {
        pos[node] = value;
        return;
    }
    if (pos[node] != -1 && node < N) {
        pos[2*node] = pos[node];
        pos[2*node+1] = pos[node];
        pos[node] = -1;
    }
    update(value, a, b, left, (left+right)/2, 2*node);
    update(value, a, b, (left+right)/2, right, 2*node+1);
}

int find(int ind) {
    int left=0;
    int right=N;
    int node=1;
    while (pos[node] == -1 && node < N) {
        int mid = (left+right)/2;
        if (mid > ind) {
            node = 2*node;
            right = mid;
        } else {
            node = 2*node+1;
            left = mid;
        }
    }
    return pos[node];
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    make_tree();

    int n,m,k;
    cin>>n>>m>>k;
    string s;
    cin>>s;

    for (int i=0; i<k; i++) {
        int p;
        cin>>p;
        update(p-1,p-1,p-1+m);
    }
    for (int i=0;i<n;i++) {
        int ind = find(i);
        if (ind == -1) cout << '.';
        else cout << s[i-ind];
    }
    cout << "\n";
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED