QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#741301 | #9568. Left Shifting 3 | Orthos | WA | 3ms | 3624kb | C++17 | 857b | 2024-11-13 14:02:58 | 2024-11-13 14:02:58 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,k;
int t;
string s;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>t;
while(t--){
cin>>n>>k;
cin>>s;
int cnt=0;
int st=0;
for(int i=0;i<=n-7;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'){
st=i;
break;
}
}
st=min(k,st);
for(int i=0;i<n&&i<=n-7;i++){
if(s[(st+i)%n]=='n'){
if(s[(st+i)%n]=='n'&&s[(st+i+1)%n]=='a'&&s[(st+i+2)%n]=='n'&&s[(st+i+3)%n]=='j'&&s[(st+i+4)%n]=='i'&&s[(st+i+5)%n]=='n'&&s[(st+i+6)%n]=='g'){
cnt++;
}
}
}
cout<<cnt<<"\n";
}
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: 3596kb
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 0 4 2 0 3 3 0 0 0 0 0 0 5 4 0 0 2 1 2 2 0 1 0 3 3 1 3 2 0 1 2 4 0 2 0 2 0 2 3 0 0 0 0 1 1 3 2 2 0 0 3 0 2 1 1 4 4 1 0 1 1 0 0 1 1 1 2 0 4 4 3 0 0 2 1 1 1 1 5 1 4 0 1 2 0 3 4 3 3 3 3 0 3 2 1 3 1 2 0 0 1 0 5 0 2 0 3 1 0 2 2 3 2 1 2 0 0 0 0 2 4 0 3 2 0 0 0 2 2 2 1 0 3 ...
result:
wrong answer 18th numbers differ - expected: '1', found: '0'