Submission #3225037


Source Code Expand

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

string words[4] = {"dream", "dreamer", "erase", "eraser"};

int main() {
  string S;
  cin >> S;
  
  reverse(S.begin(), S.end());
  for(int i = 0; i < 4; i++){
    reverse(words[i].begin(), words[i].end());
  }
  
  bool can = true;
  
  for(int i = 0; i < S.size();){
    bool can2 = false;
    for(int j = 0; j < 4; j++){
      string d = words[j];
      if(S.substr(i, d.size()) == d){
        can2 = true;
        i += d.size();
      }
    }
    if(!can2){
      can = false;
      break;
    }
    
  }
  
  if(can) cout << "YES" << endl;
  if(!can) cout << "NO" << endl;
}




Submission Info

Submission Time
Task C - Daydream
User IdaGen
Language C++14 (GCC 5.4.1)
Score 300
Code Size 736 Byte
Status AC
Exec Time 11 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 19
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 1 ms 256 KB
subtask0_1.txt AC 1 ms 256 KB
subtask0_2.txt AC 1 ms 256 KB
subtask1_0.txt AC 8 ms 512 KB
subtask1_1.txt AC 8 ms 512 KB
subtask1_10.txt AC 9 ms 512 KB
subtask1_11.txt AC 9 ms 512 KB
subtask1_12.txt AC 9 ms 512 KB
subtask1_13.txt AC 9 ms 512 KB
subtask1_14.txt AC 6 ms 512 KB
subtask1_15.txt AC 7 ms 512 KB
subtask1_2.txt AC 5 ms 512 KB
subtask1_3.txt AC 11 ms 512 KB
subtask1_4.txt AC 9 ms 512 KB
subtask1_5.txt AC 9 ms 512 KB
subtask1_6.txt AC 9 ms 512 KB
subtask1_7.txt AC 9 ms 512 KB
subtask1_8.txt AC 9 ms 512 KB
subtask1_9.txt AC 11 ms 512 KB