QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#750899#9568. Left Shifting 3ZhangyqAC ✓22ms4036kbC++171.0kb2024-11-15 16:16:502024-11-15 16:16:51

Judging History

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

  • [2024-11-15 16:16:51]
  • 评测
  • 测评结果:AC
  • 用时:22ms
  • 内存:4036kb
  • [2024-11-15 16:16:50]
  • 提交

answer

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

#define ios ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int long long
#define ull unsigned long long
#define endl '\n'
typedef long long ll;
typedef pair<int, int> PII;
const int N = 310, M = 5e3 + 10, INF = 1e18, mod = 1e9 + 7;
// const int P1 = 6907, P2 = 13331, mod1 = 998244353, mod2 = 1e9+9;

void solve()
{
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    int cnt = 0;
    for (int i = 0; i <= n - 7; i++)
    {
        if(s.substr(i,7)=="nanjing")
            cnt++;
    }
    for (int j = 1; j <= min(10ll,min(n,k));j++) 
    {
        string s2 = s.substr(j) + s.substr(0, j);
        int now = 0;
        for (int i = 0; i <= n - 7; i++)
        {
            if (s2.substr(i, 7) == "nanjing")
                now++;
        }
        cnt = max(cnt, now);
    }
    cout << cnt << endl;
}

signed main()
{
    ios;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}

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

详细

Test #1:

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

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: 17ms
memory: 3944kb

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: 22ms
memory: 4036kb

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4
1649
3651

result:

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

Extra Test:

score: 0
Extra Test Passed