QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#745394#9568. Left Shifting 3Gold_Experience#AC ✓17ms3872kbC++14939b2024-11-14 09:41:162024-11-14 09:41:16

Judging History

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

  • [2024-11-14 09:41:16]
  • 评测
  • 测评结果:AC
  • 用时:17ms
  • 内存:3872kb
  • [2024-11-14 09:41:16]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long
using i64 = unsigned long long;
using namespace std;
int d[4][2] = {{1, 0}, {0, 1}, {0, -1}, {-1, 0}};
string str;
void solve()
{
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    str = s;
    int ans = 0;
    for (int i = 0; i <= min(7ll, k); ++i)
    {
        int now = 0;
        for (int j = 0; j <= n - 7; ++j)
        {
            if (str[j] != 'n')
                continue;
            if (str.substr(j, 7) == "nanjing")
            {
                j += 6;
                now++;
            }
        }
        ans = max(ans, now);
        for (int j = 0; j < n; ++j)
        {
            str[j] = s[(j + 1) % n];
        }
        s = str;
    }
    cout << ans << "\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3676kb

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

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4
1649
3651

result:

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

Extra Test:

score: 0
Extra Test Passed