Submission #1304977

#TimeUsernameProblemLanguageResultExecution timeMemory
1304977yusifmTreasure (info1cup19_treasure)C++20
100 / 100
3 ms1100 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define str string #define pb push_back #define pf push_front #define in insert #define all(v) v.begin(),v.end() const int sz=1000000,INF=1000000000; using namespace std; void solve() { ll n,m; str s,ans=""; cin>>n>>m>>s; vector<ll>prefs; for(int i=0;i<s.size();i++) { if(ans.size()!=0 && ans[ans.size()-1]==s[i]) { prefs.pb(prefs[prefs.size()-1]+1); } else { prefs.pb(1); } ans.pb(s[i]); if(prefs[prefs.size()-1]==m) { for(int i=0;i<m;i++) { ans.pop_back(),prefs.pop_back(); } } } cout<<ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr),cout.tie(nullptr); ll t=1; //cin>>t; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...