Submission #915798

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
915798	2024-01-24T17:44:31 Z	andrei_iorgulescu	Treasure (info1cup19_treasure)	C++14	100 / 100	5 ms	840 KB

treasure

#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,k;
    cin >> n >> k;
    stack<pair<char,int>>s;
    for (int i = 1; i <= n; i++)
    {
        char c;
        cin >> c;
        if (s.empty() == true or s.top().first != c)
            s.push({c,1});
        else
            s.top().second++;
        if (s.top().second == k)
            s.pop();
    }
    vector<char>v;
    while (!s.empty())
    {
        for (int i = 1; i <= s.top().second; i++)
            v.push_back(s.top().first);
        s.pop();
    }
    reverse(v.begin(),v.end());
    for (int i = 0; i < v.size(); i++)
        cout << v[i];
    return 0;
}

Compilation message

treasure.cpp: In function 'int main()':
treasure.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = 0; i < v.size(); i++)
      |                     ~~^~~~~~~~~~

Subtask #1

35.0 / 35.0

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

Subtask #2

65.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	464 KB	Output is correct
21	Correct	2 ms	348 KB	Output is correct
22	Correct	2 ms	604 KB	Output is correct
23	Correct	2 ms	604 KB	Output is correct
24	Correct	3 ms	604 KB	Output is correct
25	Correct	3 ms	640 KB	Output is correct
26	Correct	5 ms	604 KB	Output is correct
27	Correct	4 ms	724 KB	Output is correct
28	Correct	4 ms	604 KB	Output is correct
29	Correct	3 ms	604 KB	Output is correct
30	Correct	3 ms	604 KB	Output is correct
31	Correct	3 ms	604 KB	Output is correct
32	Correct	3 ms	604 KB	Output is correct
33	Correct	4 ms	840 KB	Output is correct
34	Correct	3 ms	604 KB	Output is correct
35	Correct	3 ms	604 KB	Output is correct