QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#740191#9568. Left Shifting 3fosovWA 9ms3636kbC++141.0kb2024-11-13 03:19:002024-11-13 03:19:01

Judging History

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

  • [2024-11-13 03:19:01]
  • 评测
  • 测评结果:WA
  • 用时:9ms
  • 内存:3636kb
  • [2024-11-13 03:19:00]
  • 提交

answer

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

#define ll long long 
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>

#define N 100010
#define K 20

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t; cin >> t;
    while (t --) {
        int n, k; cin >> n >> k;
        k = min(n, k);

        string s; cin >> s;
        s += s;

        vector<int> pos;

        for (int i = 0; i <= (2 * n) - 5; ++ i) {
            if (s.substr(i, 7) == "nanjing") {
                pos.emplace_back(i);
            }
        }

        int mx = 0, res = 0;

        for (int d = 0, l = 0, r = 0; d <= k; ++ d) {
            while (l < pos.size() && pos[l] < d) ++ l;
            while (r < pos.size() && pos[r] <= n + d - 5) ++ r;
            
            if (r - l > mx) {
                mx = r - l;
                res = d;
            }
        }

        cout << mx << '\n';
    }
}

详细

Test #1:

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

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: 9ms
memory: 3636kb

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

result:

wrong answer 24th numbers differ - expected: '0', found: '1'