Leimasin

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, m, k;
    cin>>n>>m>>k;
    string s;
    cin>>s;
    int v[n];
    for (int i = 0; i < n; i++) v[i] = -1;
    for (int i = 0; i < k; i++) {
        int j;
        cin>>j;
        v[j - 1] = i;
    }
    char ans[n];
    for (int i = 0; i < n; i++) {
        ans[i] = '.';
    }
    deque<pair<int, int>> q;
    for (int i = 0; i < n; i++) {
        while (!q.empty() && q.front().second + m < i + 1) q.pop_front();
        if (v[i] != -1) {
            while (!q.empty() && q.back().first < v[i]) q.pop_back();
            q.push_back({v[i], i});
        }
        if (!q.empty()) {
            ans[i] = s[i - q.front().second];
        }
    }
    for (int i = 0; i < n; i++) {
        cout<<ans[i];
    }
    cout<<endl;
}

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