QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#737128 | #9568. Left Shifting 3 | Bicycle_23# | WA | 4ms | 4096kb | C++23 | 815b | 2024-11-12 14:42:41 | 2024-11-12 14:42:51 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define frep(i,a,b) for(int i=a;i>=b;i--)
constexpr int maxn = 2e5 + 5;
constexpr int mod = 998244353;
int n, k;
string s;
void solve()
{
cin >> n >> k;
cin >> s;
if (n < 7) {cout << 0 << endl; return;}
s = ' ' + s + s;
vector<int> a(1 + 2 * n, 0);
rep(i, 1, 2 * n - 6) if (s.substr(i, 7) == "nanjing") a[i] = 1;
vector<int> sum(2 * n + 1, 0);
rep(i, 1, 2 * n) sum[i] = sum[i - 1] + a[i];
k %= n;
int ans = 0;
k++;
rep(i, 1, min(n, k)) ans = max(ans, sum[i + n - 1 - 6] - sum[i - 1]);
cout << ans << endl;
}
signed main()
{
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(0);
int _ = 1;
cin >> _;
while (_--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
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: 4ms
memory: 4096kb
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 1 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'