Submission #533053

---

Source Code Expand

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

#define REP(i, n) for(int i=0; i<(n); i++)
#define ALL(a) (a).begin(),(a).end()

int N,T;
string S;
signed main()
{
    cin >> T;
    REP(i,T) {
        cin >> S;
        unsigned long long loc = S.find("tokyo", 0);
        vector<long long> ts;
        while(loc != string::npos) {
            ts.push_back(loc);
            loc = S.find("tokyo", loc + 5);
        }
        loc = S.find("kyoto", 0);
        while(loc != string::npos) {
            ts.push_back(loc);
            loc = S.find("kyoto", loc + 5);
        }
        sort(ALL(ts));
        int cnt = 0;
        int pre = -10;
        REP(j,ts.size()) {
            int k = ts[j];
            if (pre + 5 > k) {
                continue;
            }
            cnt++;
            pre = k;
        }
        cout << cnt << endl;
    }
    return 0;
}

Submission Info

Judge Result