Submission #5399318

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

struct Match {
  int start;
  int end;
};

int max_tapes(const std::string& str) {
  std::vector<Match> matches;
  for (int k=0; k<=str.size()-5; k++) {
    if (str.substr(k, 5) == "tokyo" || str.substr(k, 5) == "kyoto") {
      matches.push_back({k, k+5});
    }
  }
  std::sort(std::begin(matches), std::end(matches),
      [](const Match& lhs, const Match& rhs) { return lhs.end < rhs.end; });
  int cur_time = 0;
  int cnt = 0;
  for (int i=0; i<matches.size(); i++) {
    if (matches[i].start < cur_time) continue;
    cur_time = matches[i].end;
    cnt++;
  }
  return cnt;
}

int main() {
  int T;
  std::cin >> T;
  std::vector<std::string> S(T);
  for (int i=0; i<T; i++) std::cin >> S[i];
  for (int i=0; i<T; i++) {
    std::cout << max_tapes(S[i]) << std::endl;
  }
}

Submission Info

Judge Result