Submission #365419

#	Time	Username	Problem	Language	Result	Execution time	Memory
365419		ssense	Treasure (info1cup19_treasure)	C++14	0 / 100	1 ms	364 KiB

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;
	s.pb('#');
	stack<pair<int, char>> st;
	int cnt = 0;
	for(int i = 0; i <= n; i++)
	{
		if(i == 0 || s[i] == s[i-1])
		{
			cnt++;
		}
		else
		{
			if(cnt%k != 0)
			{
				if(!st.empty() && s[i-1] == st.top().sc)
				{
					pair<int, char> tmp;
					tmp.sc = s[i-1];
					tmp.fr = (st.top().fr+cnt)%k;
					st.pop();
					if(tmp.fr != 0)
					{
						st.push(tmp);
					}
				}
				else
				{
					st.push({cnt, s[i-1]});
				}
			}
			cnt = 1;
		}
	}
	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 (stderr)

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: 0 / 35
• Subtask 2: 0 / 65