QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#741352 | #9568. Left Shifting 3 | qz2003 | RE | 1ms | 3584kb | C++20 | 759b | 2024-11-13 14:10:06 | 2024-11-13 14:10:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=998244353;
char s[400005];
bool check(int 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')
return 1;
else
return 0;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
int kk=k;
for(int i=1;i<=n;i++){
cin>>s[i];
if(kk){
s[n+i]=s[i];
kk--;
}
}
int ff=0,cnt=0,f=0;
for(int i=1;i<=n+ff;i++){
if(s[i]=='n'){
if(check(i)){
if(f==0){
ff=min(i-1,k);
f=1;
}
cnt++;
}
}
}
for(int i=1;i<=n+k;i++){
s[i]=0;
}
cout<<cnt<<endl;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3584kb
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
Runtime Error
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