QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #746467 | #9568. Left Shifting 3 | jiayan | WA | 6ms | 3772kb | C++14 | 597b | 2024-11-14 14:44:13 | 2024-11-14 14:44:14 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int cnt[400010];
int main() {
ios::sync_with_stdio(false);
int T;
cin>>T;
while(T--) {
int n,k;
cin>>n>>k;
string s;
cin>>s;
s=s+s;
string t="nanjing";
int j=0;
int i=0;
while(i<=n*2) {
if(s[i-1]==t[j]) {
j++;
if(j==7) {
cnt[i]=cnt[i-1]+1;
j=0;
} else cnt[i]=cnt[i-1];
i++;
} else if(j!=0) j=0;
else {
cnt[i]=cnt[i-1];
i++;
}
}
int mx=cnt[n]-cnt[0];
for(int l=1; l<=min(k,n-1); l++) {
mx=max(mx,cnt[l+n]-cnt[l]);
}
cout<<mx<<endl;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3772kb
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: 6ms
memory: 3752kb
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:
2 0 3 2 2 2 3 3 3 4 0 2 4 3 1 1 1 1 2 1 0 3 3 0 0 1 0 0 0 5 4 0 1 1 1 1 2 0 1 1 3 2 1 3 2 0 1 2 4 1 2 1 1 0 2 3 0 1 0 0 1 1 3 2 1 1 0 3 1 1 1 1 4 4 1 1 1 1 0 1 1 1 1 2 0 4 3 3 1 1 2 1 1 1 1 5 1 4 0 1 1 1 3 4 2 3 2 2 0 2 2 1 3 1 1 0 0 0 0 5 0 1 0 2 0 0 2 2 2 2 1 2 0 1 1 1 2 4 1 3 2 0 1 1 2 1 2 1 0 3 ...
result:
wrong answer 1st numbers differ - expected: '3', found: '2'