QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#752786#9568. Left Shifting 3ucup-team4906#AC ✓14ms4560kbC++201019b2024-11-16 09:47:452024-11-16 09:47:46

Judging History

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

  • [2024-11-16 09:47:46]
  • 评测
  • 测评结果:AC
  • 用时:14ms
  • 内存:4560kb
  • [2024-11-16 09:47:45]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

string t = "nanjing";

void sol()
{
    int n, k;
    string s;
    cin >> n >> k;
    cin >> s;
    vector<int>a(n, 0);
    int ans = 0, mn = 1e9;
    for (int i = 0; i < n; i ++)
    {
        bool fl = 1;
        for (int j = 0; j < 7; j ++) if (s[(i + j) % n] != t[j])fl = 0;
        a[i] = fl; ans += a[i];
    }
    for (int i = n - 6; i <= min(n - 6 + k, 2 * n); i ++)
    {
        int sum = 0;
        for (int j = i; j <= i + 5; j ++)
        {
            int p = (j % n + n) % n;
            sum += a[p];
        }
        // cout << "EEE:" << i << ' ' << sum << endl;
        mn = min(mn, sum);
    }

    cout << ans - mn << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while (T --) sol();
    return 0;
}
/*
4
21 10
jingicpcnanjingsuanan
21 0
jingicpcnanjingsuanan
21 3
nanjingnanjingnanjing
4 100
icpc
*/

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 13ms
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
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: 14ms
memory: 4560kb

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4
1649
3651

result:

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

Extra Test:

score: 0
Extra Test Passed