QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#796212 | #9568. Left Shifting 3 | ZycK# | WA | 7ms | 3908kb | C++14 | 853b | 2024-12-01 14:21:22 | 2024-12-01 14:21:22 |
Judging History
answer
#include <bits/stdc++.h>
#define For(i, l, r) for (int i=l; i<=r; ++i)
using namespace std;
const char a[] = {'n', 'a', 'n', 'j', 'i', 'n', 'g'};
const int N = 200010;
int T, n, k;
char c[N];
signed main() {
cin >> T;
while (T -- > 0) {
scanf("%d%d", &n, &k);
scanf("%s", c);
int now = 0, ans = 0;
For(i, 0, min(6, k)) {
int cnt = 0;
For(j, 0, n-1) {
if (c[(j+i)%n] == a[now]) {
++ now;
if (now == 7) {
now = 0; ++ cnt;
}
}
}
ans = max(ans, cnt);
}
printf("%d\n", ans);
}
return 0;
}
/*
4
21 10
jingicpcnanjingsuanan
21 0
jingicpcnanjingsuanan
21 3
nanjingnanjingnanjing
4 100
icpc
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3844kb
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: 7ms
memory: 3908kb
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 3 2 3 3 5 3 4 0 2 4 3 2 1 1 1 4 2 0 4 3 0 0 1 0 0 0 5 4 0 2 2 1 3 2 2 1 2 4 3 1 4 3 0 1 3 4 1 2 1 3 1 2 4 0 2 1 0 1 1 3 2 3 1 0 3 1 2 1 2 5 5 1 2 1 1 0 1 1 1 1 2 0 4 4 3 2 1 2 2 1 1 2 5 1 5 1 1 2 2 4 4 4 3 3 3 2 4 2 1 3 1 2 0 0 2 0 6 1 2 0 4 1 1 2 2 3 2 1 2 0 2 2 2 2 4 2 3 2 0 2 2 2 2 2 2 0 3 ...
result:
wrong answer 4th numbers differ - expected: '2', found: '3'