Submission #5445944

---

Source Code Expand

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

using P = pair<int, int>;

static const string words[] = {"tokyo", "kyoto"};

int main() {
  int T; cin >> T;
  for (int i{}; i < T; ++i) {
    vector<P> vec;
    string S;
    cin >> S;
    for (const auto& word : words) {
      for (size_t pos{}; (pos = S.find(word, pos)) != string::npos; ++pos) {
        // pos += hoge.length() wouldn't allow overlapping occurrences to be found.
        vec.push_back(P{pos, pos + word.length()});
      }
    }
    sort(vec.begin(), vec.end(), [](P l, P r) {
      if (l.second == r.second)
        return l.first > r.first;
      return l.second < r.second;
    });

    int ans{};
    int pos{};
    for (const auto& p : vec) {
      if (pos <= p.first) {
        ++ans;
        pos = p.second;
      }
    }
    cout << ans << endl;
  }

  return 0;
}

Submission Info

Judge Result