QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#735265 | #9568. Left Shifting 3 | yzhx# | AC ✓ | 30ms | 3956kb | C++20 | 1.5kb | 2024-11-11 18:50:59 | 2024-11-11 18:51:00 |
Judging History
answer
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll cal(const string& str , int s){
ll ans = 0;
for (int i = s ; i < str.size() ; i++){
if (str.substr(i , 7) == "nanjing") ans++;
}
return ans;
}
void slove() {
int n, k;
cin >> n >> k;
k = min(n, k);
string str;
cin >> str;
k = min(k , 7);
ll ans = 0;
for (int i = 0 ; i <= k ; i++){
ans = max(ans , cal(str , i));
str.push_back(str[i]);
// str.erase(str.begin());
}
cout << ans << endl;
// if (str.size() >= 7) {
// for (int i = 0; i < 6; i++) {
// str.push_back(str[i]);
// }
// }
// vector<int> in(str.size(), 0);
// int cnt = 0;
// for (int i = 0; i + 6 < str.size(); i++) {
// if (str.substr(i, 7) == "nanjing") {
// cnt++;
// for (int j = 1; j < 6; j++) in[i + j] = 1;
// }
// }
// if (str.size() >= 7) {
// for (int i = 0; i < 6; i++) {
// in[i] = in[str.size() - 6 + i];
// }
// }
// for (int i = 0; i <= k; i++) {
// if (!in[i]) {
// cout << cnt << "\n";
// return;
// }
// }
// cout << (cnt - 1) << "\n";
return;
}
int main() {
// freopen("in.txt" , "r" , stdin);
int cnt = 1;
cin >> cnt;
while (cnt--) {
slove();
}
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3632kb
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: 26ms
memory: 3596kb
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: 30ms
memory: 3956kb
input:
3 100000 998244353 gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...
output:
4 1649 3651
result:
ok 3 number(s): "4 1649 3651"
Extra Test:
score: 0
Extra Test Passed