Leimasin

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) 0xffff
#endif

int n, m, k;

#define N (1<<20)
int segTree[2*N], lazy[2*N];

void pushDown(int cur) {
  if (lazy[cur]) {
    segTree[cur] = lazy[cur];
    if (cur < N) {
      lazy[2*cur] = lazy[cur];
      lazy[2*cur+1] = lazy[cur];
    }
    lazy[cur] = 0;
  }
}

void upd(int l, int r, int x, int y, int cur, int val) {
  // [l, r] is node
  // [x, y] is range update
  pushDown(cur);
  if (r < x || y < l) return;
  if (x <= l && r <= y) {
    // node is fully inside range
    lazy[cur] = val;
    segTree[cur] = val;
    return;
  }

  int mid = (l + r) / 2;
  upd(l, mid, x, y, 2*cur, val);
  upd(mid+1, r, x, y, 2*cur+1, val);
  pushDown(cur);
}

int query(int l, int r, int p, int cur) {
  // [l, r] is node
  // [x, y] is range update
  pushDown(cur);
  if (r < p || p < l) return 0;
  if (l == r) {
    if (l == p) return segTree[cur];
    return 0;
  }

  int mid = (l + r) / 2;
  int vl = query(l, mid, p, 2*cur);
  int vr = query(mid+1, r, p, 2*cur+1);
  pushDown(cur);
  return max(vl, vr);
}

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  cin>>n>>m>>k;
  string s;
  cin>>s;
  vector<int> pidxs;

  for (int i = 0; i < k; i++) {
    int idx;
    cin>>idx;
    pidxs.push_back(idx);

    idx--; // just for easier indexing
    upd(0, N-1, idx, idx+m-1, 1, i+1);
  }

  for (int i = 0; i < n; i++) {
    int ridx = query(0, N-1, i, 1);
    if (ridx == 0) {
      cout<<".";
      continue;
    }
    // this means that ith character is stamped by ridx
    int startOfStamp = pidxs[ridx-1];
    
    cout << s[i - (startOfStamp - 1)];
  }
}

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