CSES - Putka Open 2025 – 2/5

Submission details
Task:	Leimasin
Sender:	Yytsi
Submission time:	2025-09-26 19:57:33 +0300
Language:	C++ (C++20)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	33
#2	ACCEPTED	43
#3	ACCEPTED	24

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3	details
#2	ACCEPTED	0.00 s	1, 2, 3	details
#3	ACCEPTED	0.00 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.04 s	2, 3	details
#6	ACCEPTED	0.04 s	2, 3	details
#7	ACCEPTED	0.04 s	2, 3	details
#8	ACCEPTED	0.04 s	2, 3	details
#9	ACCEPTED	0.61 s	3	details
#10	ACCEPTED	0.66 s	3	details
#11	ACCEPTED	0.78 s	3	details
#12	ACCEPTED	0.84 s	3	details
#13	ACCEPTED	0.88 s	3	details
#14	ACCEPTED	0.46 s	3	details

Code

#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 details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 1 100 a 585 600 750 170 794 845 341 39...` view save

correct output
`............a....aa..............` view save

user output
`............a....aa..............` Truncated

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 4 100 zhrb 795 569 744 662 315 869 913 21...` view save

correct output
`.........................zhrb....` view save

user output
`.........................zhrb....` Truncated

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 100 100 wkmtgzytnfwptwukbartgunjyrkyml...` view save

correct output
`wkmtgzywkmtgzytnfwptwukbartgun...` view save

user output
`wkmtgzywkmtgzytnfwptwukbartgun...` Truncated

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 1000 100 njplbyvkaytbcyzbylzntnmpfapvfg...` view save

correct output
`njplbyvkaytbcyzbylzntnmpfapvfg...` view save

user output
`njplbyvkaytbcyzbylzntnmpfapvfg...` Truncated

Test 5

Group: 2, 3

Verdict: ACCEPTED

input
`100000 1 1000 a 61541 4948 46214 29629 8779 76...` view save

correct output
`.................................` view save

user output
`.................................` Truncated

Test 6

Group: 2, 3

Verdict: ACCEPTED

input
`100000 10 1000 ntsconpqnv 17118 69319 2115 8873 892 9994...` view save

correct output
`.....................ntsconpqn...` view save

user output
`.....................ntsconpqn...` Truncated

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
`100000 10000 1000 wcyeepjmmvavmoncfxclqrsebjzwbf...` view save

correct output
`.................................` view save

user output
`.................................` Truncated

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`100000 100000 1000 chdcxwwznawllrxcxlckeziomcsjhc...` view save

correct output
`chdcxwwznawllrxcxlckeziomcsjhc...` view save

user output
`chdcxwwznawllrxcxlckeziomcsjhc...` Truncated

Test 9

Group: 3

Verdict: ACCEPTED

input
`1000000 1 500000 a 406018 635983 429225 943593 90...` view save

correct output
`.a...aa.....a.aaaa.a.aaa..aa.a...` view save

user output
`.a...aa.....a.aaaa.a.aaa..aa.a...` Truncated

Test 10

Group: 3

Verdict: ACCEPTED

input
`1000000 10 500000 frvhrhlrxi 85148 459715 677814 98302 4081...` view save

correct output
`frvhfrvhrhlrxihrhlrxifrvhrfrvf...` view save

user output
`frvhfrvhrhlrxihrhlrxifrvhrfrvf...` Truncated

Test 11

Group: 3

Verdict: ACCEPTED

input
`1000000 1000 500000 hklmkntjqgilackgurwlerwvvfjwwr...` view save

correct output
`.hklhklmkntjqgilackgurwlerwvvf...` view save

user output
`.hklhklmkntjqgilackgurwlerwvvf...` Truncated

Test 12

Group: 3

Verdict: ACCEPTED

input
`1000000 10000 500000 yxajftmelgwiofcugtrvcltdemhyuu...` view save

correct output
`yxajftyxayxajftmelgwiofcugtrvc...` view save

user output
`yxajftyxayxajftmelgwiofcugtrvc...` Truncated

Test 13

Group: 3

Verdict: ACCEPTED

input
`1000000 100000 500000 yyzteckvutdnprlklyxgenyqpznght...` view save

correct output
`.yyyyzteckvutdnpryyzteckvutdnp...` view save

user output
`.yyyyzteckvutdnpryyzteckvutdnp...` Truncated

Test 14

Group: 3

Verdict: ACCEPTED

input
`1000000 1000000 500000 hhgvveiosloznsihxtccfjbizayyhl...` view save

correct output
`hhgvveiosloznsihxtccfjbizayyhl...` view save

user output
`hhgvveiosloznsihxtccfjbizayyhl...` Truncated

Putka Open 2025 – 2/5

Leimasin

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Tasks

Submissions (Yytsi)