Submission #533442

---

Source Code Expand

#include<iostream>
#include<string>
#include<sstream>
#include<vector>
#include<set>
#include<cmath>
#include<map>
#include<algorithm>
#include<queue>
#define _f(i,a,b) for (int i=(a);i<(b);i++)
#define _rf(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define _r(i,n) for (int i=0;i<(n);i++)
#define _rr(i,n) for (int i=(n)-1;i>=0;i--)
using namespace std;
struct _tu{char operator()(char c){return toupper(c);}};
struct _tl{char operator()(char c){return tolower(c);}};
int _d[4][2]={{-1,0},{0,1},{1,0},{0,-1}};
int num(string s,string t1,string t2){
  vector<string>ss;
  int pos=0;
  int a=0;
  while(true){
    pos=s.find("tokyo",pos);
    ss.push_back(s.substr(0,pos));
    if(pos==string::npos)break;
    a++;
    s=s.substr(pos+5);
  }
  _r(i,ss.size()){
    pos=0;
    s=ss[i];
    while(true){
      pos=s.find("kyoto",pos);
      if(pos==string::npos)break;
      a++;
      s=s.substr(pos+5);
    }
  }
  return a;
}
int main(){
  int n;
  cin>>n;
  _r(i,n){
    string s;
    cin>>s;
    cout<<max(num(s,"tokyo","kyoto"),num(s,"kyoto","tokyo"))<<endl;
  }
  return 0;
}

Submission Info

Judge Result