Submission #7996544


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << endl;
#define CFYN(n) cout << ( (n) ? "YES":"NO") << endl;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;

int main(void)
{
    IOS
    vector<string> v{"dream","dreamer","erase","eraser",""};
    string s; cin >> s;

    bool ans = true;

    while(s.size() != 0) {
        REP(i,v.size()) {
            if (i == v.size()-1) {
                ans = false;
            } else {
                if( s.size() >= v[i].size() && s.compare(s.size()-v[i].size(),string::npos,v[i]) == 0) {
                    REP(j,v[i].size()) s.pop_back();
                    break;
                }
            }
        }
        if (!ans) break;
    }

    CFYN(ans);

    return 0;
}

Submission Info

Submission Time
Task C - Daydream
User hir810
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1041 Byte
Status AC
Exec Time 3 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 3 ms 512 KB
subtask1_1.txt AC 2 ms 512 KB
subtask1_10.txt AC 3 ms 512 KB
subtask1_11.txt AC 3 ms 512 KB
subtask1_12.txt AC 3 ms 512 KB
subtask1_13.txt AC 3 ms 512 KB
subtask1_14.txt AC 2 ms 512 KB
subtask1_15.txt AC 2 ms 512 KB
subtask1_2.txt AC 2 ms 512 KB
subtask1_3.txt AC 3 ms 512 KB
subtask1_4.txt AC 3 ms 512 KB
subtask1_5.txt AC 3 ms 512 KB
subtask1_6.txt AC 3 ms 512 KB
subtask1_7.txt AC 3 ms 512 KB
subtask1_8.txt AC 3 ms 512 KB
subtask1_9.txt AC 3 ms 512 KB