Submission #2152475

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
using namespace std;

typedef pair<int,int> P;
int T;
string S;
vector<P> v;

int main(){
	cin >> T;
	for(int i=0;i<T;i++){
		cin >> S;
		for(int j=0;j<S.size()-4;j++){
			string s = S.substr(j,5);
			if(s=="kyoto" || s=="tokyo"){
				v.push_back(P(j+5,j));
			}			
		}
		sort(v.begin(),v.end());
		int ans = 0,last = -1;
		for(int j=0;j<v.size();j++){
			if(last<v[j].second){
				ans++;
				last = v[j].first;
			}
		}
		cout << ans << endl;
		v.clear();
	}
}

Submission Info

Judge Result