Submission #1307460

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#define INF 1000000000
#define mod 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define all(x) (x).begin(),x.end()
using namespace std;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;

int main(){
  bool ok=false;
  string s;
  string ss[4]={"dream","dreamer","erase","eraser"};
  cin>>s;
  reverse(all(s));
  reverse(all(ss[0]));
  reverse(all(ss[1]));
  reverse(all(ss[2]));
  reverse(all(ss[3]));

  int stop=s.size();
  int cnt=0;

  while(1){
    if(cnt==stop){
      ok=true;
      break;
    }

    bool cont=false;
    rep(i,4){
      rep(j,ss[i].size()){
	if(ss[i][j]!=s[j+cnt])break;
	if(j==ss[i].size()-1){
	  cont=true;
	  cnt+=ss[i].size();
	  break;
	}
      }
      if(cont)break;
    }
    if(!cont)break;
  }
  if(ok)cout<<"YES"<<endl;
  else cout<<"NO"<<endl;
  return 0;
}

Submission Info

Judge Result