QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#728993 | #9568. Left Shifting 3 | ucup-team3215# | WA | 7ms | 3896kb | C++23 | 804b | 2024-11-09 16:19:44 | 2024-11-09 16:19:45 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
for (int tc = (cin >> tc, tc); tc--; ) {
int n, k; cin >> n >> k; k = min(k, n);
string s; cin >> s;
if (n < 7) { cout << "0\n"; continue; }
int ans = 0;
for (int i = 0; i < n; ++i) {
bool nanjing = 1;
for (int j = 0; j < 7 && nanjing; ++j) nanjing &= s[(i + j) % n] == "nanjing"[j];
ans += nanjing;
}
int nans = 1;
for (int i = 0; i < k; ++i) {
bool bad = 0;
for (int di = -6; di < 0; ++di) {
bool nanjing = 1;
for (int j = 0; j < 7 && nanjing; ++j) nanjing &= s[(i + n + di + j) % n] == "nanjing"[j];
bad |= nanjing;
}
nans &= bad;
}
cout << ans - nans << '\n';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3492kb
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: 7ms
memory: 3896kb
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 3 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 2 3 1 3 2 0 1 2 4 1 2 1 2 0 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 0 2 1 1 1 0 5 1 4 0 1 2 0 3 4 3 3 3 3 0 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:
wrong answer 8th numbers differ - expected: '4', found: '3'