QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#772238#9568. Left Shifting 3Proaes#AC ✓10ms3996kbC++201.1kb2024-11-22 17:46:132024-11-22 17:46:13

Judging History

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

  • [2024-11-22 17:46:13]
  • 评测
  • 测评结果:AC
  • 用时:10ms
  • 内存:3996kb
  • [2024-11-22 17:46:13]
  • 提交

answer

/**
 *    title:  b.cpp
 *    author:  Proaes Meluam
 *    created:  2024-11-22 17:23:23
**/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "algo/debug.h" 
#else
#define debug(...) 42
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
const double E = exp(1);
constexpr ll mod = 1e9 + 7;
// constexpr int inf = 0x3f3f3f3f;
constexpr ll inf = 0x3f3f3f3f3f3f3f3f;
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int tt;
    cin>>tt;
    while(tt--){
        int n,bu, ans = 0;
        string s;
        cin>>n>>bu;
        cin>>s;
        for (int be = 0; be <= min(bu, 6); ++ be) {
            int cnt = 0;
            // debug(be);
            for(int i=0;i<n-6;i++){
                if(s[(i+be)%n]=='n'&&s[(i+1+be)%n]=='a'&&s[(i+2+be)%n]=='n'&&s[(i+3+be)%n]=='j'&&s[(i+4+be)%n]=='i'&&s[(i+5+be)%n]=='n'&&s[(i+6+be)%n]=='g'){
                    cnt++;
                }
            }
            ans = max(ans, cnt);
        }
        
        cout<<ans<<"\n";
        
    }
}

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

詳細信息

Test #1:

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

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: 8ms
memory: 3668kb

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: 10ms
memory: 3996kb

input:

3
100000 998244353
gbppzfsncqyzmuwrcvtxsciucxusskcjhaanwhqmyncytwhkubrvcqxgcehdxyewdyvpqjcmrnmlgrytrucexmmfulqbtfctehphmrzkosyvhtvjrromqncbgsjcwhmlqidkycaxyhsrduoxayntuhqubvboseeziwjvrfagsbvtxjjbexnajqapgxydwtztzbbdpoydnjipfizdfpmczgqvdmpvxbqubtygkfpdeonegfzsttirbhzkobbigwneyvtcxndfkljdvbbcfnadtfhgo...

output:

4
1649
3651

result:

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

Extra Test:

score: 0
Extra Test Passed