QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#733431#9568. Left Shifting 320225954#AC ✓2ms3724kbC++20994b2024-11-10 18:52:042024-11-10 18:52:05

Judging History

你现在查看的是最新测评结果

  • [2024-11-10 18:52:05]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3724kb
  • [2024-11-10 18:52:04]
  • 提交

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";
    s+=s.substr(0,min(k,6));
    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;
    };
    cout<<ok(t1)<<"\n";
    
//     int num1= ok(t1),num2 =ok(t2),num3 = ok(t3);
//     num2-=num1;num3-=num1;
//     if(s.size()<5){
//         cout<<"0\n";return ;
//     }
//     if(s.substr(s.size(s.size()-3),3)=="nan"){
//         ++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;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3520kb

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: 2ms
memory: 3620kb

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: 0ms
memory: 3724kb

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4
1649
3651

result:

ok 3 number(s): "4 1649 3651"

Extra Test:

score: 0
Extra Test Passed