QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#796218#9568. Left Shifting 3ZycK#WA 7ms3956kbC++14968b2024-12-01 14:26:542024-12-01 14:26:54

Judging History

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

  • [2024-12-01 14:26:54]
  • 评测
  • 测评结果:WA
  • 用时:7ms
  • 内存:3956kb
  • [2024-12-01 14:26:54]
  • 提交

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, lst = -1;
            For(j, 0, n-1) {
                if (c[(j+i)%n] == a[now] && lst == j-1) {
                    ++ now; lst = j;
                    if (now == 7) {
                        now = 0; ++ cnt;
                    }
                }
                else {
                    now = 0; lst = j;
                }
            }
            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: 3956kb

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: 3876kb

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

result:

wrong answer 1st numbers differ - expected: '3', found: '2'