QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#749994 | #9568. Left Shifting 3 | UESTC_DECAYALI# | RE | 0ms | 3504kb | C++20 | 694b | 2024-11-15 11:53:44 | 2024-11-15 11:53:44 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
int work() {
int n, k;
std::cin >> n >> k;
k = std::min(n, k);
if(n < 7) return 0;
std::string S; std::cin >> S;
S += S.substr(0, k);
int l = S.size();
std::vector<int> s(l, 0);
for(int i = 0; i <= l - 7; ++i) s[i] = (S.substr(i, 7) == "nanjing");
for(int i = 1; i < l; ++i) s[i] += s[i - 1];
int ans = s[n - 7];
for(int i = 0, j = n - 6; j < l; ++i, ++j) ans = std::max(ans, s[j] - s[i]);
return ans;
}
int main() {
std::ios::sync_with_stdio(false);
int T; std::cin >> T; while(T--) std::cout << work() << char(10);
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3504kb
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
Runtime Error
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