QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#753909#9568. Left Shifting 3Magical_Kingdom#AC ✓5ms7264kbC++171.2kb2024-11-16 13:51:042024-11-16 13:51:04

Judging History

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

  • [2024-11-16 13:51:04]
  • 评测
  • 测评结果:AC
  • 用时:5ms
  • 内存:7264kb
  • [2024-11-16 13:51:04]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
int n, k;
string txt;
int cnt[maxn * 2];
int sum[maxn * 2];

void init() {
    for (int i = 0; i <= 2 * n + 3; i++) {
        cnt[i] = 0;
        sum[i] = 0;
    }
}

void solve() {
    cin >> n >> k;
    cin >> txt;
    init();
    if (n < 7) {
        cout << 0 << '\n';
        return;
    }
    txt = " " + txt + txt;
    const string s = "#nanjing";
    int m = 7;
    for (int i = 1; i <= n * 2 - m + 1; i++) {
        bool flag = true;
        for (int j = 1; j <= m; j++) {
            if (txt[i + j - 1] != s[j]) {
                flag = false;
                break;
            }
        }
        if (flag == true) {
            cnt[i]++;
        }
    }
    for (int i = 1; i <= n * 2; i++) {
        sum[i] = sum[i - 1] + cnt[i];
    }

    int ans = 0;
    for (int l = 1; l <= min(k + 1, n); l++) {
        int r = l + n - 1;
        ans = max(ans, sum[r - 6] - sum[l - 1]);
    }
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

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

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3568kb

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: 2ms
memory: 5760kb

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: 5ms
memory: 7264kb

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4
1649
3651

result:

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

Extra Test:

score: 0
Extra Test Passed