QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#741276#9568. Left Shifting 3LuCiiiDAC ✓9ms7400kbC++23979b2024-11-13 14:00:182024-11-13 14:00:18

Judging History

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

  • [2024-11-13 14:00:18]
  • 评测
  • 测评结果:AC
  • 用时:9ms
  • 内存:7400kb
  • [2024-11-13 14:00:18]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define _11037_ ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define endl '\n'
#define MAX 400005
#define MOD 998244353
int ans, len, stop, pres[MAX], pret[MAX];
int T, n, k;
string s;
void init(void)
{
    ans = 0;
    for (int i = 0; i < n * 2 + 1; i++)
        pres[i] = pret[i] = 0;
}
signed main()
{
    _11037_
    cin >> T;
    while (T--)
    {
        cin >> n >> k >> s, len = s.length();
        s = " " + s + s;
        stop = min((int)s.length(), len + k + 1);
        init();
        for (int i = 1; i < stop; i++)
        {
            if (i + 6 < stop && s.substr(i, 7) == "nanjing")
                pres[i]++, pret[i + 6]++;
            pres[i] = pres[i] + pres[i - 1];
            pret[i] = pret[i] + pret[i - 1];
        }
        for (int i = 1; i + len - 1 < stop; i++)
            ans = max(ans, pret[i + len - 1] - pres[i - 1]);
        cout << ans << endl;
    }
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 6ms
memory: 3828kb

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

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4
1649
3651

result:

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

Extra Test:

score: 0
Extra Test Passed