QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#765734 | #9568. Left Shifting 3 | XingKongC# | RE | 0ms | 3852kb | C++20 | 871b | 2024-11-20 15:07:47 | 2024-11-20 15:07:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(x) for(ll i = 1; i <= x; i ++)
void solve(){
ll n, k;
cin >> n >> k;
string s;
cin >> s;
s = s + s;
ll ans1 = 0;
if(n < 7) { cout << 0 << endl;return ; }
vector<ll> a(n + 1);
for(int i = 0; i < n - 7 + 1 ; i ++){
if(s.substr(i, 7) == "nanjing"){
ans1 ++;
i += 6;
}
}
for(int i = n - 6; i < 2 * n - 6; i ++){
if(s.substr(i, 7) == "nanjing"){
a[i - (n - 5)] ++;
i += 6;
}
}
f(n){
a[i] += a[i - 1];
}
cout << ans1 + k / n * a[n] + a[k % n] << endl;
}
int main (){
ios :: sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
cin >> t;
while(t--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3852kb
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 2