This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 200005;
const lo mod = 1000000007;
int n,m,k,flag,t,d[li];
int cev;
set<int> st;
string s;
int main(void){
fio();
//~ freopen("simple.txt","r",stdin);
std::clock_t start;
double duration;
start = std::clock();
cin>>n>>k>>s;
for(int i=0;i<n;i++)st.insert(i);
//~ for(int jjj=1;jjj<=min(6,(int)sqrt(n)+5);jjj++){
int say=1;
d[0]=1;
auto it=st.begin();
it++;
for(;it!=st.end();it++){
int i=*it;
auto it1=it;
it1--;
int i1=*it1;
if(s[i]==s[i1])say++;
else say=1;
if(s[i]==s[i1])d[i]=d[i1]+1;
else d[i]=1;
//~ cout<<d[i]<<endl;
if(d[i]==k){
say=k;
while(say>0){
it1=it;
it1++;
st.erase(it);
it1--;
it=it1;
d[i-k+1+say-1]=1;
say--;
}
n-=k;
i-=k;
//~ it--;
}
//~ cout<<s[i]<<" : ; "<<i<<endl;
}
//~ }
//~ cout<<s;
duration = ( std::clock() - start ) / (double) CLOCKS_PER_SEC;
it=st.begin();
for(;it!=st.end();it++){
//~ cout<<*it<<endl;
cout<<s[*it];
}
//~ std::cout<<"printf: "<< duration <<'\n';
return 0;
}
Compilation message (stderr)
treasure.cpp: In function 'int main()':
treasure.cpp:37:12: warning: variable 'duration' set but not used [-Wunused-but-set-variable]
double duration;
^~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |