Submission #2251639


Source Code Expand

import std.stdio : readln, writeln;
import std.conv : to;
import std.string : chomp;
import std.range : retro, generate, back, array, take;
import std.algorithm : reduce, min, startsWith;
import std.array : empty;
import std.functional : pipe;

void main() {
    readln.chomp.retro.to!string.pipe!(
        s => generate!(
            () => s = s.reduce!(
                (a, b) => a.startsWith(b) ? a[min($, b.length)..$] : a
            )(["maerd", "remaerd", "esare", "resare"])
        ).take(20000).array.back.empty ? "YES" : "NO"
    ).writeln;
}

Submission Info

Submission Time
Task ABC049C - Daydream
User arkark
Language D (DMD64 v2.070.1)
Score 300
Code Size 570 Byte
Status AC
Exec Time 11 ms
Memory 3864 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 5 ms 3452 KB
subtask0_1.txt AC 5 ms 1532 KB
subtask0_2.txt AC 6 ms 1532 KB
subtask1_0.txt AC 10 ms 1816 KB
subtask1_1.txt AC 10 ms 1816 KB
subtask1_10.txt AC 10 ms 1816 KB
subtask1_11.txt AC 10 ms 1816 KB
subtask1_12.txt AC 10 ms 3864 KB
subtask1_13.txt AC 10 ms 1816 KB
subtask1_14.txt AC 10 ms 1816 KB
subtask1_15.txt AC 11 ms 3864 KB
subtask1_2.txt AC 11 ms 3736 KB
subtask1_3.txt AC 10 ms 3480 KB
subtask1_4.txt AC 10 ms 1816 KB
subtask1_5.txt AC 10 ms 1816 KB
subtask1_6.txt AC 10 ms 1816 KB
subtask1_7.txt AC 10 ms 1816 KB
subtask1_8.txt AC 10 ms 3480 KB
subtask1_9.txt AC 10 ms 3608 KB