Submission #502708

---

Source Code Expand

// {{{ include
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
// }}}

using namespace std;

typedef long long ll;
inline int in(){int x;scanf("%d",&x);return x;}

const char* HCETIT = "hcetit";
struct State {
  int size;
  State() : size(0) {}
  bool next(char c){
    if (HCETIT[size] != c) return false;
    size++;
    return true;
  }
  bool end(){
    return !HCETIT[size];
  }
};

int main()
{
  string S;
  cin >> S;
  reverse(S.begin(), S.end());

  vector<State> states(1);

  for (const auto c : S){
    bool ok = false;
    for (auto& state : states){
      if (state.next(c)){
        ok = true;
        break;
      }
    }
    if (!ok){
      states.emplace_back();
      if (!states.back().next(c)){
        puts("No");
        return 0;
      }
    }
  }
  for (auto& state : states){
    if (!state.end()){
      puts("2No");
      return 0;
    }
  }
  puts("Yes");
  return 0;
}

Submission Info

Judge Result