Submission #2412050

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>

using namespace std;
typedef long long ll;

#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REP2(i,n,s) for(int i=(int)(s);i<(int)(n);++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin(),ie=(c).end();i!=ie;++i)
#define ALL(c) (c).begin(), (c).end()

int main() {
    int t;cin>>t;
    REP(test,t){

        string s;cin>>s;
        int i = 0;
        vector<pair<int,int>> sec;
        while(true) {
            int j = s.find("tokyo", i);
            if(j == -1) break;
            sec.push_back(make_pair(j, j+5));
            i = j+5;
        }
        i=0;
        while(true) {
            int j = s.find("kyoto", i);
            if(j == -1) break;
            sec.push_back(make_pair(j, j+5));
            i = j+5;
        }

        sort(ALL(sec), [](const pair<int,int>& a, const pair<int,int>& b){
            return a.second < b.second;
        });
        int end = 0, ans = 0;
        FOR(i, sec) {
            if(i->first >= end) {
                end = i->second;
                ans++;
            }
        }

        cout << ans << endl;

    }
}

Submission Info

Judge Result