Submission #217444

#	Time	Username	Problem	Language	Result	Execution time	Memory
217444		dimash241	Treasure (info1cup19_treasure)	C++17	100 / 100	21 ms	1416 KiB

treasure

//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

//# include <ext/pb_ds/assoc_container.hpp>
//# include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;
 
//template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
string s;
vector < int > g[44];


int main () {	
	SpeedForce;
	cin >> n >> k >> s;

	for (int i = 0; i < n; ++i) {
	//	cin >> s[i];
		s[i] -= 'a';
	}

	vector < int > alive;
	for (int i = 0; i < n; ++i) {
		g[s[i]].pb(i);
		alive.pb(i);
		if(alive.size() >= k) {
			int cnt = ub(every(g[s[i]]), i) - lb(every(g[s[i]]), alive[sz(alive)-k]);
			if (cnt == k) {
				while(cnt--) {
					g[s[i]].pop_back();
					alive.pop_back();
				}
			}
		}
	}

	for (auto it : alive)
		cout << char(s[(it)] + 'a');


	return Accepted;
}

// B...a

Compilation message (stderr)

treasure.cpp: In function 'int main()':
treasure.cpp:69:9: warning: array subscript has type 'char' [-Wchar-subscripts]
   g[s[i]].pb(i);
         ^
treasure.cpp:71:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(alive.size() >= k) {
      ~~~~~~~~~~~~~^~~~
treasure.cpp:72:29: warning: array subscript has type 'char' [-Wchar-subscripts]
    int cnt = ub(every(g[s[i]]), i) - lb(every(g[s[i]]), alive[sz(alive)-k]);
                             ^
treasure.cpp:22:18: note: in definition of macro 'every'
 #define every(x) x.begin(),x.end()
                  ^
treasure.cpp:72:29: warning: array subscript has type 'char' [-Wchar-subscripts]
    int cnt = ub(every(g[s[i]]), i) - lb(every(g[s[i]]), alive[sz(alive)-k]);
                             ^
treasure.cpp:22:28: note: in definition of macro 'every'
 #define every(x) x.begin(),x.end()
                            ^
treasure.cpp:72:53: warning: array subscript has type 'char' [-Wchar-subscripts]
    int cnt = ub(every(g[s[i]]), i) - lb(every(g[s[i]]), alive[sz(alive)-k]);
                                                     ^
treasure.cpp:22:18: note: in definition of macro 'every'
 #define every(x) x.begin(),x.end()
                  ^
treasure.cpp:72:53: warning: array subscript has type 'char' [-Wchar-subscripts]
    int cnt = ub(every(g[s[i]]), i) - lb(every(g[s[i]]), alive[sz(alive)-k]);
                                                     ^
treasure.cpp:22:28: note: in definition of macro 'every'
 #define every(x) x.begin(),x.end()
                            ^
treasure.cpp:75:12: warning: array subscript has type 'char' [-Wchar-subscripts]
      g[s[i]].pop_back();
            ^

• Subtask 1: 35 / 35
• Subtask 2: 65 / 65