Submission #365423

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
365423	2021-02-11T16:09:20 Z	ssense	Treasure (info1cup19_treasure)	C++14	100 / 100	3 ms	1016 KB

treasure

#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double

int ceildiv(int one, int two) {
	if (one % two == 0) {return one / two;}
	else {return one / two + 1;}
} int power(int n, int pow, int m) {
	if (pow == 0) return 1;
	if (pow % 2 == 0) {
		ll x = power(n, pow / 2, m);
		return (x * x) % m;
	}
	else return (power(n, pow - 1, m) * n) % m;
} int gcd(int a, int b) {
	if (!b)return a;
	return gcd(b, a % b);
} int factorial(int n, int mod) {
	if (n > 1)
		return (n * factorial(n - 1, mod)) % mod;
	else
		return 1;
} int lcm(int a, int b) {
	return (a * b) / gcd(a, b);
} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}vector<vector<int>> adj;void init(int n) {for (int i = 0; i <= n; i++) { vector<int> a; adj.pb(a);}}


int32_t main(){
	startt;
	//freopen("algsort.in", "r", stdin);
	//freopen("algsort.out", "w", stdout);
	int n, k;
	cin >> n >> k;
	string s;
	cin >> s;
	stack<pair<int, char>> st;
	for(int i = 0; i < n; i++)
	{
		if(st.empty())
		{
			st.push({1, s[i]});
		}
		else
		{
			if(s[i] == st.top().sc)
			{
				st.top().fr++;
				if(st.top().fr == k)
				{
					st.pop();
				}
			}
			else
			{
				st.push({1, s[i]});
			}
		}
	}
	string ans;
	while(!st.empty())
	{
		for(int i = 0; i < st.top().fr; i++)
		{
			ans.pb(st.top().sc);
		}
		st.pop();
	}
	reverse(all(ans));
	cout << ans << endl;
}

Compilation message

treasure.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
treasure.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1

35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	372 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct

Subtask #2

65.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	372 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	2 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	2 ms	748 KB	Output is correct
24	Correct	2 ms	876 KB	Output is correct
25	Correct	2 ms	876 KB	Output is correct
26	Correct	3 ms	888 KB	Output is correct
27	Correct	2 ms	888 KB	Output is correct
28	Correct	2 ms	888 KB	Output is correct
29	Correct	2 ms	1016 KB	Output is correct
30	Correct	2 ms	888 KB	Output is correct
31	Correct	2 ms	888 KB	Output is correct
32	Correct	2 ms	888 KB	Output is correct
33	Correct	2 ms	888 KB	Output is correct
34	Correct	3 ms	888 KB	Output is correct
35	Correct	2 ms	888 KB	Output is correct