QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#735244#9568. Left Shifting 3yzhx#RE 0ms0kbC++20998b2024-11-11 18:39:362024-11-11 18:39:36

Judging History

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

  • [2024-11-11 18:39:36]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:0kb
  • [2024-11-11 18:39:36]
  • 提交

answer

#include <iostream>
#include <vector>
using namespace std;

void slove(){
    int n , k;
    cin >> n >> k;
    k = min(n , k);

    string str;
    cin >> str;

    if (str.size() >= 7){
        for (int i = 0 ; i < 6 ;i++){
            str.push_back(str[i]);
        }
    }

    vector<int> in(str.size() , 0);

    int cnt = 0;
    for (int i = 0 ; i < str.size() ; i++){
         if (str.substr(i , 7) == "nanjing") {
            cnt++;
            for (int j = 1 ; j < 6 ; j++) in[i + j] = 1;
         }
    }


    if (str.size() >= 7){
        for (int i = 0 ; i < 6 ; i++){
            in[i] = in[str.size() - 6 + i];
        }
    }

    for (int i = 0 ; i <= k ; i++){
        if (!in[i]){
            cout << cnt << "\n";
            return ;
        }
    }
    cout << (cnt - 1) << "\n";
    return ;

}

int main(){
    // freopen("in.txt" , "r" , stdin);
    int cnt = 1;
    cin >> cnt;

    while(cnt){
       slove();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Runtime Error

input:

4
21 10
jingicpcnanjingsuanan
21 0
jingicpcnanjingsuanan
21 3
nanjingnanjingnanjing
4 100
icpc

output:

2
1
3
0

result: