QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#760586#9568. Left Shifting 3Meowmeowmeow#AC ✓7ms17168kbC++201.1kb2024-11-18 17:42:432024-11-18 17:42:45

Judging History

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

  • [2024-11-18 17:42:45]
  • 评测
  • 测评结果:AC
  • 用时:7ms
  • 内存:17168kb
  • [2024-11-18 17:42:43]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define MAXN 1100005

char a[MAXN];
int n,k;
int f[MAXN];
string s = "nanjing";
int ss[MAXN];

signed main() {
    int T;
    cin >> T;
    while(T --) {
        cin >> n >> k;
        for(int i = 0; i <= n*2+20; i ++) {
            a[i] = ss[i] = f[i] = 0;
        }
        if(k > n) k = n;
        scanf("%s",a+1);
        if(n < 7) {
            cout<<0<<"\n";
            continue;
        }
        for(int i = 1; i <= k; i ++)
            a[i+n] = a[i];
        for(int i = 1; i <= n+k; i ++) {
            f[i] = 1;
            for(int j = i; j < i+7; j ++) {
                if(a[j] != s[j-i])
                    f[i] = 0;
            }
            ss[i] = ss[i-1]+f[i];
        }
        int an = 0;

        for(int i = 1; i <= k+1; i ++) {
            an = max(an,ss[i+n-7]-ss[i-1]);
        }
        cout<<an<<"\n";
    }
    return 0;
}
/*
4
21 10
jingicpcnanjingsuanan
21 0
jingicpcnanjingsuanan
21 3
nanjingnanjingnanjing
4 100
icpc
*/

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 5880kb

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: 0
Accepted
time: 7ms
memory: 7908kb

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

result:

ok 2130 numbers

Test #3:

score: 0
Accepted
time: 7ms
memory: 17168kb

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4
1649
3651

result:

ok 3 number(s): "4 1649 3651"

Extra Test:

score: 0
Extra Test Passed