QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#720413 | #9568. Left Shifting 3 | ucup-team902# | WA | 6ms | 3872kb | C++23 | 800b | 2024-11-07 12:32:08 | 2024-11-07 12:32:08 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
string s;
string op = "nanjing";
void solve() {
int n, k;
cin >> n >> k;
cin >> s;
s = s + s;
// cout << s << endl;
int ans = 0;
for (int i = 0; i <= min(7, k); ++i) {
int cnt = 0;
for (int j = i; j + 6 < n + i; ++j) {
bool flag = 1;
for (int kk = 0; kk < 7; ++kk) {
if (op[kk] != s[i + j + kk]) {
flag = 0;
break;
}
}
cnt += flag;
}
ans = max(ans, cnt);
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3608kb
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: 6ms
memory: 3872kb
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 1 0 1 0 0 0 5 4 0 1 2 1 2 2 1 1 1 3 3 1 4 2 0 1 2 4 1 2 1 2 1 2 3 0 1 1 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 0 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 2 0 5 1 2 0 3 1 1 2 2 3 2 1 2 0 1 1 1 2 4 1 4 2 0 1 1 2 2 2 1 0 3 ...
result:
wrong answer 24th numbers differ - expected: '0', found: '1'