oj.uz

Submission #688642

# Submission time Handle Problem Language Result Execution time Memory
688642 2023-01-27T22:32:44 Z divad Treasure (info1cup19_treasure) C++14
100 / 100
 5 ms 604 KB 
#include <bits/stdc++.h>
#define MAX 200002
using namespace std;
int n,vf,k;
pair<char, int> st[MAX];
char ch;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> k;
    for(int i = 1; i <= n; i++){
        cin >> ch;
        pair<char, int> add = {ch, 1};
        while(vf >= 1 && st[vf].first == add.first){
            add.second += st[vf].second;
            vf--;
        }
        st[++vf] = add;
        if(st[vf].second >= k){
            if(st[vf].second%k == 0){
                vf--;
            }else{
                st[vf].second %= k;
            }
        }
    }
    for(int i = 1; i <= vf; i++){
        for(int j = 1; j <= st[i].second; j++){
            cout << st[i].first;
        }
    }
    return 0;
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 416 KB Output is correct
22 Correct 3 ms 468 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 3 ms 452 KB Output is correct
25 Correct 3 ms 472 KB Output is correct
26 Correct 5 ms 468 KB Output is correct
27 Correct 5 ms 596 KB Output is correct
28 Correct 4 ms 596 KB Output is correct
29 Correct 5 ms 584 KB Output is correct
30 Correct 5 ms 604 KB Output is correct
31 Correct 4 ms 596 KB Output is correct
32 Correct 4 ms 596 KB Output is correct
33 Correct 4 ms 596 KB Output is correct
34 Correct 5 ms 472 KB Output is correct
35 Correct 3 ms 584 KB Output is correct