QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#746230 | #9568. Left Shifting 3 | ucup-team1769# | WA | 15ms | 3688kb | C++14 | 972b | 2024-11-14 13:55:14 | 2024-11-14 13:55:15 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n, k;
cin >> n >> k;
string s;
cin >> s;
s += s;
if (k > n)
{
k %= n;
if (k == 0)
k = n;
k = min(k, 7LL);
}
int ans = 0;
for (int i = 0; i <= k; i++)
{
int cnt = 0;
for (int j = i; j < n + i - 6; j++)
{
if (s.substr(j, 7) == "nanjing")
{
cnt++;
j = j + 6;
}
}
ans = max(ans, cnt);
}
// for (int i = 0; i < k; i++)
// {
// for (int j = i; j < n + i - 6; j++)
// {
// cout << s[j];
// }
// cout << '\n';
// }
cout << ans << '\n';
}
signed main()
{
cin.tie(0)->ios::sync_with_stdio(false);
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 15ms
memory: 3688kb
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 0 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 0 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 0 1 2 1 1 1 1 5 1 3 0 1 2 1 3 4 3 2 3 3 1 3 2 1 3 1 2 0 0 1 0 4 0 2 0 3 1 0 2 2 3 2 1 2 0 1 0 0 1 4 1 3 2 0 1 1 2 2 2 1 0 3 ...
result:
wrong answer 18th numbers differ - expected: '1', found: '0'