QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#802926#9568. Left Shifting 3JJJ_RE 27ms4508kbC++141.0kb2024-12-07 15:13:052024-12-07 15:13:05

Judging History

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

  • [2024-12-07 15:13:05]
  • 评测
  • 测评结果:RE
  • 用时:27ms
  • 内存:4508kb
  • [2024-12-07 15:13:05]
  • 提交

answer

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<bits/stdc++.h>
using namespace std;
int f[200004];
int main(){
	
	int t;
	cin>>t;
	while(t--){
		int n, k;
		string s;
        cin>>n>>k;
        if(k>n) k=n;
        cin>>s;
        s+=s; s=' '+s;
		memset(f,0,sizeof(f));
		//for(int i=1;i<=n;i++){
		//	cin>>s[i];
			//s[i+n]=s[i];
		//}
		//cout<<s<<endl;
		/*for(int i=1;i<=n+k;i++){
			if(s[i]=='n' && s[i+1]=='a' && s[i+2]=='n' && s[i+3]=='j'
			   && s[i+4]=='i' && s[i+5]=='n' && s[i+6]=='g'){
				if(f[l]!=0 && i%f[l]==0) l++;
				f[r++]=i;
				cout<<l<<' '<<r<<' '<<i<<' '<<endl; 
			}
		}
		cout<<r-l+1<<endl;*/
		for(int i=0;i+6<2*n;i++) {
            if(s[i]=='n' && s[i+1]=='a' && s[i+2]=='n' && s[i+3]=='j' && s[i+4]=='i' && s[i+5]=='n' && s[i+6]=='g') 
			   f[i]++;
            f[i+1]+=f[i];
        }
        int ans=0;
        for(int i=0;i<=k;i++) 
            ans=max(ans,f[max(n+i-6,0)]-f[i]);
        
        cout<<ans<< endl;
	} 
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 4400kb

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: 0
Accepted
time: 27ms
memory: 4508kb

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
2
2
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
1
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
1
1
1
2
0
4
4
3
1
1
2
1
1
1
1
5
1
4
0
1
2
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
2
2
1
0
3
...

result:

ok 2130 numbers

Test #3:

score: -100
Runtime Error

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4

result: