QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#735255 | #9568. Left Shifting 3 | yzhx# | WA | 8ms | 3860kb | C++20 | 995b | 2024-11-11 18:43:04 | 2024-11-11 18:43:09 |
Judging History
answer
#include <iostream>
#include <vector>
using namespace std;
void slove() {
int n, k;
cin >> n >> k;
k = min(n, k);
string str;
cin >> str;
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();
}
}
Details
Tip: Click on the bar to expand more detailed information
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: -100
Wrong Answer
time: 8ms
memory: 3860kb
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 0 0 1 1 3 3 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 2 0 5 0 2 0 3 1 0 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'