QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#726095#9568. Left Shifting 3wxgmjfhy#AC ✓4ms5120kbC++20910b2024-11-08 21:35:382024-11-08 21:35:40

Judging History

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

  • [2024-11-08 21:35:40]
  • 评测
  • 测评结果:AC
  • 用时:4ms
  • 内存:5120kb
  • [2024-11-08 21:35:38]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;

int n,k;
string s;

string st="nanjing";

inline void solve(){
    cin>>n>>k;

    cin>>s;

    if(n<7)return cout<<"0\n",void();

    k=min(k,n);

    for(int i=0;i<k;i++)s+=s[i];

    // cout<<s<<"\n";

    int m=s.size();

    vector<int>p(m);
    for(int i=0;i+6<m;i++){
        if(s[i]=='n'){
            int flag=1;
            for(int t=0,j=i;t<7;t++,j++){
                if(s[j]!=st[t]){
                    flag=0;
                    break;
                }
            }        
            p[i]=flag;
        }
    }

    int ans=0;

    for(int i=1;i<m;i++)p[i]+=p[i-1];

    for(int i=n-7,t=0;i+6<m;i++,t++)ans=max(ans,p[i]-(t==0?0:p[t-1]));

    cout<<ans<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t=1;
    cin>>t;
    while(t--)solve();

    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3552kb

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: 3ms
memory: 3664kb

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: 4ms
memory: 5120kb

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4
1649
3651

result:

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

Extra Test:

score: 0
Extra Test Passed