QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#726069 | #9568. Left Shifting 3 | wxgmjfhy# | WA | 3ms | 3692kb | C++20 | 943b | 2024-11-08 21:29:27 | 2024-11-08 21:29:28 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n,k;
string s;
string st="nanjing";
inline void solve(){
cin>>n>>k;
cin>>s;
if(n<7)return cout<<"0\n",void();
k=min(k,n);
for(int i=0;i<k;i++)s+=s[i];
int m=s.size();
vector<int>p(m);
for(int i=0;i+6<m;i++){
if(s[i]=='n'){
int flag=1;
for(int t=0,j=i;t<7;t++,j++){
if(s[j]!=st[t]){
flag=0;
break;
}
}
p[i]=flag;
}
}
int sum=0;
for(int i=0;i+6<n;i++)sum+=p[i];
int ans=sum;
for(int t=0,i=n-7;i+6<m;t++,i++){
sum-=p[t];
sum+=p[i];
ans=max(ans,sum);
}
cout<<ans<<"\n";
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t=1;
cin>>t;
while(t--)solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
input:
4 21 10 jingicpcnanjingsuanan 21 0 jingicpcnanjingsuanan 21 3 nanjingnanjingnanjing 4 100 icpc
output:
2 1 3 0
result:
ok 4 number(s): "2 1 3 0"
Test #2:
score: -100
Wrong Answer
time: 3ms
memory: 3692kb
input:
2130 39 7 nnananjingannanjingngnanjinganjinggjina 1 479084228 g 33 2 gqnanjinggrjdtktnanjingcvsenanjin 24 196055605 ginganjingnanjingnanjing 23 3 ngnanjinganjingjinnanji 40 3 njingaaznannanjingnananjingyonwpnanjinga 40 207842908 nanjinggphconanjingkonanjinannanjinglxna 46 3 ingjingnnanjingnanjinging...
output:
3 0 3 3 1 3 3 4 3 4 0 2 4 3 2 1 1 1 4 2 0 3 3 0 0 1 0 0 0 5 4 0 1 2 2 2 2 1 1 1 3 3 1 3 2 0 1 2 4 1 2 1 2 1 2 3 0 1 0 0 1 1 3 2 2 1 0 3 1 2 1 1 4 4 1 1 1 1 0 1 2 1 1 2 0 4 4 3 1 0 2 1 1 1 1 5 1 4 0 2 3 1 3 4 3 3 3 3 1 3 2 1 3 1 2 0 0 1 0 5 0 2 0 3 1 0 2 2 3 2 1 2 0 1 1 1 2 4 1 3 2 0 1 1 2 3 2 1 0 3 ...
result:
wrong answer 4th numbers differ - expected: '2', found: '3'