Submission #2667104
Source Code Expand
#include <iostream>
#include <cstdio>
#include <cstring>
#define N 200005
using namespace std;
typedef long long ll;
int n,m,nxt[N];
ll l,r,ans[26],w[26],f[105][26],len[105];
char s[N];
void print(){
for(int i=0;i<25;i++) printf("%lld ",ans[i]);
printf("%lld",ans[25]);
}
void solve(int k,ll pos,int op){
if(pos>len[k]||pos<1) return;
if(k<=1){
int x=k==0?m:n;
if(!op) for(int i=1;i<=pos;i++) ans[s[i]-'a']++;
else for(int i=pos;i<=x;i++) ans[s[i]-'a']++;
return;
}
if(!op){
if(len[k-1]<=pos) {for(int i=0;i<26;i++) ans[i]+=f[k-1][i];solve(k-2,pos-len[k-1],0);}
else solve(k-1,pos,0);
}else{
if(len[k-1]>=pos-1){for(int i=0;i<26;i++) ans[i]+=f[k-2][i];solve(k-1,pos,1);}
else solve(k-2,pos-len[k-1],1);
}
}
void get(int k,ll l,ll r){
if(l>len[k-1]){get(k-2,l-len[k-1],r-len[k-1]);return;}
if(r<=len[k-1]){get(k-1,l,r);return;}
solve(k-1,l,1);
solve(k-2,r-len[k-1],0);
}
int main(){
scanf("%s",s+1);
n=strlen(s+1)>>1;
for(int i=2;i<=n;i++){
nxt[i]=nxt[i-1];
while(s[nxt[i]+1]!=s[i]&&nxt[i]) nxt[i]=nxt[nxt[i]];
if(s[nxt[i]+1]==s[i]) nxt[i]++;
}
m=n-nxt[n];
for(int i=1;i<=m;i++) w[s[i]-'a']++;
scanf("%lld%lld",&l,&r);
if(n%m==0||r<=n){
if(l<=n){
for(int i=l;i<=n&&i<=r;i++) ans[s[i]-'a']++;
if(r<=n) {print();return 0;}
l=n+1;
}
l-=n;r-=n;
ll L=(l%m==0)?m:l%m,R=(r%m==0)?m:r%m;
if((l-1)/m==(r-1)/m){
for(int i=L;i<=R;i++) ans[s[i]-'a']++;
print();
return 0;
}
for(int i=L;i<=m;i++,l++) ans[s[i]-'a']++;
for(int i=1;i<=R;i++,r--) ans[s[i]-'a']++;
for(int i=0;i<26;i++) ans[i]+=(r-l+1)/m*w[i];
print();
return 0;
}
for(int i=1;i<=m;i++) f[0][s[i]-'a']++;
for(int i=1;i<=n;i++) f[1][s[i]-'a']++;
len[0]=m;len[1]=n;
for(int i=2;i<=100;i++){
for(int p=0;p<26;p++) f[i][p]=f[i-1][p]+f[i-2][p];
len[i]=len[i-1]+len[i-2];
}
int x;
for(int i=0;i<=100;i++){
if(len[i]<r&&len[i+1]>=r){
x=i;break;
}
}
get(x+1,l,r);
print();
return 0;
}
Submission Info
Submission Time
2018-06-14 20:40:54+0900
Task
F - SS
User
liumy2010
Language
C++14 (GCC 5.4.1)
Score
1100
Code Size
2010 Byte
Status
AC
Exec Time
3 ms
Memory
896 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:37:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",s+1);
^
./Main.cpp:46:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld",&l,&r);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1100 / 1100
Status
Set Name
Test Cases
Sample
sample1.txt, sample2.txt, sample3.txt
All
mx_100000_1_0.txt, rnd_6_16666_4.txt, rnd_7777_1_0.txt, rnd_7777_1_2289.txt, rnd_7777_1_6444.txt, rnd_7777_9_0.txt, rnd_7777_9_1542.txt, rnd_7777_9_2299.txt, rnd_77_1_0.txt, rnd_77_1_14.txt, rnd_77_1_2.txt, rnd_77_9_0.txt, rnd_77_9_11.txt, rnd_77_9_54.txt, rnd_7_1_0.txt, rnd_7_1_2.txt, rnd_7_1_3.txt, rnd_7_9_0.txt, rnd_7_9_1.txt, rnd_7_9_2.txt, rndmx_100000_1_0.txt, sample1.txt, sample2.txt, sample3.txt
Case Name
Status
Exec Time
Memory
mx_100000_1_0.txt
AC
3 ms
896 KB
rnd_6_16666_4.txt
AC
2 ms
896 KB
rnd_7777_1_0.txt
AC
1 ms
256 KB
rnd_7777_1_2289.txt
AC
1 ms
384 KB
rnd_7777_1_6444.txt
AC
1 ms
384 KB
rnd_7777_9_0.txt
AC
2 ms
640 KB
rnd_7777_9_1542.txt
AC
2 ms
640 KB
rnd_7777_9_2299.txt
AC
2 ms
640 KB
rnd_77_1_0.txt
AC
1 ms
256 KB
rnd_77_1_14.txt
AC
1 ms
256 KB
rnd_77_1_2.txt
AC
1 ms
256 KB
rnd_77_9_0.txt
AC
1 ms
256 KB
rnd_77_9_11.txt
AC
1 ms
256 KB
rnd_77_9_54.txt
AC
1 ms
256 KB
rnd_7_1_0.txt
AC
1 ms
256 KB
rnd_7_1_2.txt
AC
1 ms
256 KB
rnd_7_1_3.txt
AC
1 ms
256 KB
rnd_7_9_0.txt
AC
1 ms
256 KB
rnd_7_9_1.txt
AC
1 ms
256 KB
rnd_7_9_2.txt
AC
1 ms
256 KB
rndmx_100000_1_0.txt
AC
3 ms
896 KB
sample1.txt
AC
1 ms
256 KB
sample2.txt
AC
1 ms
256 KB
sample3.txt
AC
1 ms
256 KB