Submission #1304970

#TimeUsernameProblemLanguageResultExecution timeMemory
1304970yusifmTreasure (info1cup19_treasure)C++20
0 / 100
1092 ms332 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; ll n,m; str s,ss; pair<ll,ll>f(const str &s) { bool flag; for(int i=0;i<s.size()-m+1;i++) { flag=false; for(int j=i;j<i+m;j++) { if(s[i]!=s[j]) { flag=true; break; } } if(!flag) { return {i,i+m-1}; } } return {-1,-1}; } void solve() { cin>>n>>m>>s; pair<ll,ll>idxs; while(true) { if(f(s).first==-1 && f(s).second==-1) { break; } else { idxs=f(s),ss=""; for(int i=0;i<s.size();i++) { if(idxs.first>i || i>idxs.second) { ss.pb(s[i]); } } s=ss; } } cout<<s; } 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...