Submission #1186376


Source Code Expand

#include <iostream>
#include <string>
using namespace std;

string str;
string s1,s2,s3,s4,s5,s6;
int main(){
    cin >> str;
    s2 = "dreamer";
    s4 = "eraser";
    s5 = "aser";
    int i = 0,j = 0;
    bool is_dreamer = false;
    bool is_eraser = false;
    while(i < str.length()){
        if(str[i] == 'd'){
            for(j = 0; j < 7; j++){
                
                if(str[i++] != s2[j]){
                    if(j == 5){
                        break;
                    }else{
                        //error
                        cout << "NO" << endl;
                        return 0;
                    }
                } 
            }
            if(j != 7)i--;
            else{  is_dreamer = true;}
        }else if(str[i] == 'e'){
            for(j = 0; j < 6; j++){
                if(str[i++] != s4[j]){
                    
                    if(j == 5){
                        break;
                    }else{
                        //error
                        cout << "NO" << endl;
                        return 0;
                    }
                } 
            }
            if(j != 6)i--;
           else{ is_eraser = true;} 
        }else if(str[i] == 'a' &&( is_dreamer== true || is_eraser == true)){
             for(j = 0; j < 4; j++){
                if(str[i++] != s5[j]){
                        if(j == 3){
                            break;
                        }else{
                            //error
                            cout << "NO" << endl;
                            return 0;
                        }
                } 
                is_dreamer = false;
                is_eraser = false;
            }
        }else{        
                //error
                cout << "NO" << endl;
                return 0;
        }
    }  
    cout << "YES" << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Daydream
User grun1396
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1928 Byte
Status WA
Exec Time 4 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 11
WA × 8
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 4 ms 512 KB
subtask1_1.txt AC 4 ms 512 KB
subtask1_10.txt WA 4 ms 512 KB
subtask1_11.txt WA 4 ms 512 KB
subtask1_12.txt WA 4 ms 512 KB
subtask1_13.txt WA 4 ms 512 KB
subtask1_14.txt AC 4 ms 512 KB
subtask1_15.txt AC 4 ms 512 KB
subtask1_2.txt AC 4 ms 512 KB
subtask1_3.txt WA 4 ms 512 KB
subtask1_4.txt AC 4 ms 512 KB
subtask1_5.txt WA 4 ms 512 KB
subtask1_6.txt AC 4 ms 512 KB
subtask1_7.txt AC 4 ms 512 KB
subtask1_8.txt WA 4 ms 512 KB
subtask1_9.txt WA 4 ms 512 KB