CSES - Putka Open 2025 – 2/5

Submission details
Task:	Leimasin
Sender:	cb14641
Submission time:	2025-09-27 18:59:54 +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.00 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	2, 3	details
#6	ACCEPTED	0.01 s	2, 3	details
#7	ACCEPTED	0.01 s	2, 3	details
#8	ACCEPTED	0.01 s	2, 3	details
#9	ACCEPTED	0.13 s	3	details
#10	ACCEPTED	0.16 s	3	details
#11	ACCEPTED	0.21 s	3	details
#12	ACCEPTED	0.26 s	3	details
#13	ACCEPTED	0.37 s	3	details
#14	ACCEPTED	0.08 s	3	details

Code

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = a; i < b; i++)

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int N, M, K;
  cin >> N >> M >> K;
  string stamp;
  cin >> stamp;
  stamp = '.' + stamp;

  vpii A(N);
  vb somethingA(N, false);
  for (int k = 0; k < K; k++) {
    int loc;
    cin >> loc;
    loc--;
    A[loc] = {k, loc};
    somethingA[loc] = true;
  }

  vpii B(N);
  set<pii> pre;
  vb somethingB(N, false);
  for (int n = 0; n < N; n++) {
    if (somethingA[n])
      pre.insert(A[n]);
    if (n - M >= 0 && somethingA[n - M])
      pre.erase(A[n - M]);
    if (pre.size() > 0) {
      B[n] = *pre.rbegin();
      somethingB[n] = true;
    }
  }

  for (int n = 0; n < N; n++) {
    int idx = 0;
    if (somethingB[n])
      idx = 1 + n - B[n].second;
    cout << stamp[idx];
  }
  cout << "\n";
}

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..............` view save

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....` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
`wkmtgzywkmtgzytnfwptwukbartgun...` view save

user output
`wkmtgzywkmtgzytnfwptwukbartgun...` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
`njplbyvkaytbcyzbylzntnmpfapvfg...` view save

user output
`njplbyvkaytbcyzbylzntnmpfapvfg...` view save

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
`.................................` view save

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...` view save

Test 7

Group: 2, 3

Verdict: ACCEPTED

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

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

user output
`.................................` view save

Test 8

Group: 2, 3

Verdict: ACCEPTED

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

correct output
`chdcxwwznawllrxcxlckeziomcsjhc...` view save

user output
`chdcxwwznawllrxcxlckeziomcsjhc...` view save

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...` view save

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...` view save

Test 11

Group: 3

Verdict: ACCEPTED

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

correct output
`.hklhklmkntjqgilackgurwlerwvvf...` view save

user output
`.hklhklmkntjqgilackgurwlerwvvf...` view save

Test 12

Group: 3

Verdict: ACCEPTED

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

correct output
`yxajftyxayxajftmelgwiofcugtrvc...` view save

user output
`yxajftyxayxajftmelgwiofcugtrvc...` view save

Test 13

Group: 3

Verdict: ACCEPTED

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

correct output
`.yyyyzteckvutdnpryyzteckvutdnp...` view save

user output
`.yyyyzteckvutdnpryyzteckvutdnp...` view save

Test 14

Group: 3

Verdict: ACCEPTED

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

correct output
`hhgvveiosloznsihxtccfjbizayyhl...` view save

user output
`hhgvveiosloznsihxtccfjbizayyhl...` view save

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 (cb14641)