QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#733390 | #9568. Left Shifting 3 | 20225954# | WA | 3ms | 3672kb | C++20 | 880b | 2024-11-10 18:33:44 | 2024-11-10 18:33:44 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define db(x) cerr<<#x<<(x)<<" \n"
#define ll long long
void solve(){
int n,k;
string s;cin>>n>>k>>s;
string t1 = "nanjing",t2 = "nan",t3 = "jing";
auto ok= [&](string t){
int ans =0,idx =0,m = t.size();
while(1){
idx =s.find(t,idx);
if(idx==-1)break;
ans++;
idx+=m;
}
return ans;
};
int num1= ok(t1),num2 =ok(t2),num3 = ok(t3);
num2-=num1;num3-=num1;
if(s.size()<6){
cout<<"0\n";return ;
}
if(s.substr(0,4)==t3){
++k;
}
// db(num2),db(num3);db(num1);
int res = num1+min(min(num2,num3),k/2);
cout<<res<<"\n";
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int _=1;
cin>>_;
while(_--)solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
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: 3ms
memory: 3672kb
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 2 2 4 3 4 3 3 0 2 4 2 2 1 1 0 4 1 0 2 3 0 0 0 0 0 0 5 4 0 1 2 1 2 1 0 1 0 3 4 1 3 3 0 1 1 4 1 1 0 2 1 1 3 0 0 1 0 1 1 4 2 2 0 0 2 0 2 1 1 3 4 1 1 1 2 0 0 2 1 1 2 0 4 4 3 0 0 1 1 1 1 1 4 2 4 0 1 3 0 2 4 3 2 3 4 0 3 3 1 3 1 1 0 0 1 0 6 1 3 0 5 1 0 2 5 3 2 1 1 0 0 0 1 3 3 0 4 1 0 1 0 2 2 2 1 0 4 ...
result:
wrong answer 3rd numbers differ - expected: '3', found: '2'