QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#745603#9568. Left Shifting 3surenjamts#RE 0ms0kbC++17867b2024-11-14 10:45:592024-11-14 10:46:05

Judging History

你现在查看的是最新测评结果

  • [2024-11-14 10:46:05]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:0kb
  • [2024-11-14 10:45:59]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
    int n,d;
    cin>>n>>d;
    string s;
    cin>>s;
    vector<char> c(n+10,'.');
    int ans=0;
    for(int i=0; i<=min(10LL,d); i++){
        int idx=0;
        for(int j=0; j<n; j++){
            int l=j-i;
            l+=n;
            l%=n;
            //cout<<l<<" ";
            c[l]=s[idx];
            idx++;
            idx%=n;
        }
        //for(auto j: c) cout<<j;
        //cout<<endl;
        int cnt=0;
        for(int j=0; j<n-4; j++){
            if(c[j]=='n' and c[j+1]=='a' and c[j+2]=='n' and c[j+3]=='j' and c[j+4]=='i' and c[j+5]=='n' and c[j+6]=='g'){
                cnt++;
            }
        }
        ans=max(ans,cnt);
    }
    cout<<ans<<endl;
}
signed main(){
    int t;
    cin>>t;
    while(t--) solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Runtime Error

input:

4
21 10
jingicpcnanjingsuanan
21 0
jingicpcnanjingsuanan
21 3
nanjingnanjingnanjing
4 100
icpc

output:

2
1
3
0

result: