Submission #4047703


Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, m, n) for (ll i = m; i < n; i++)

int main(int argc, char const *argv[])
{
    string s;
    cin >> s;
    reverse(s.begin(), s.end());
    bool is_same = true;
    for (ll i = 0; i < s.length();)
    {
        bool is_find = false;
        if (s.substr(i, 5) == "maerd" || s.substr(i, 5) == "esare")
        {
            i += 5;
            is_find = true;
        }
        else if (s.substr(i, 6) == "resare")
        {
            i += 6;
            is_find = true;
        }
        else if (s.substr(i, 7) == "remaerd")
        {
            i += 7;
            is_find = true;
        }
        if (!is_find)
        {
            is_same = false;
            break;
        }
    }
    cout << (is_same ? "YES" : "NO") << endl;
    return 0;
}

Submission Info

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