Submission #2692351

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <array>
#include <queue>
#include <stack>
#include <set>
#include <utility>
using namespace std;

int main() {
  int findTokyo(string s);
  int findKyoto(string s);
  int T; cin >> T;
  string S[100];
  for (int i = 0; i < T; i++) {
    cin >> S[i];
  }
  for (int i = 0; i < T; i++) {
    cout << max(findTokyo(S[i]), findKyoto(S[i])) << endl;
  }
}

int findTokyo(string s) {
  int findKyoto(string s);
  if (s.length() >= 5) {
    for (int i = 0; i < s.length()-4; i++) {
      if (s[i] == 't' && s[i+1] == 'o' && s[i+2] == 'k'
          && s[i+3] == 'y' && s[i+4] == 'o') {
        return max(findTokyo(s.substr(i+5)), findKyoto(s.substr(i+5))) + 1;
      }
    }
    return 0;
  } else {
    return 0;
  }
}

int findKyoto(string s) {
  int findTokyo(string s);
  if (s.length() >= 5) {
    for (int i = 0; i < s.length()-4; i++) {
      if (s[i] == 'k' && s[i+1] == 'y' && s[i+2] == 'o'
          && s[i+3] == 't' && s[i+4] == 'o') {
        return max(findTokyo(s.substr(i+5)), findKyoto(s.substr(i+5))) + 1;
      }
    }
    return 0;
  } else {
    return 0;
  }
}

Submission Info

Judge Result