Submission #3599726

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace Practice
{
    class Program
    {
        static void Main(string[] args)
        {
            Solve();
        }
        private const long MOD = 1000000007;
        
        static void Solve()
        {
            string s = Console.ReadLine();
            string[] table = { "maerd", "remaerd", "esare", "resare" };
            var worksz = new StringBuilder(s.Length);
            for(int i=0;i<s.Length;++i)
            {
                worksz.Append(s[s.Length - 1 - i]);
            }
            s = worksz.ToString();

            bool success = true;
            int idx = 0;
            while(true)
            {
                if(idx == s.Length)
                {
                    success = true;
                    break;
                }

                string part = s.Substring(idx);
                bool isMatch = false;
                foreach(var key in table)
                {
                    if (part.StartsWith(key))
                    {
                        isMatch = true;
                        idx += key.Length;
                    }
                }
                if( !isMatch)
                {
                    success = false;
                    break;
                }
            }
            string ans = success ? "YES" : "NO";
            Console.WriteLine(ans);
        }
        private static string MatchWord(string s, string key, string[] table)
        {
            foreach(var t in table)
            {
                if(t.StartsWith(key))
                    {
                    return t;
                }
            }
            return null;
        }

        #region よく使う便利関数
        private static bool isPrime(long x)
        {
            if (x == 2) { return true; }
            if (x < 2 || x % 2 == 0) { return false; }
            long i = 3;
            while (i * i <= x)
            {
                if (x % i == 0) { return false; }
                i = i + 2;
            }
            return true;
        }
        private static long lcm(long x, long y)
        {
            return x / gcd(x, y) * y;
        }
        private static long gcd(long x, long y)
        {
            return y > 0 ? gcd(y, x % y) : x;
        }
        private static long pow(long x, long n)
        {
            if (n == 0) { return 1; }
            long res = pow(x * x % MOD, n / 2);
            if (n % 2 == 1)
            {
                res = res * x % MOD;
            }
            return res;
        }
        private static int ReadAndParseInt()
        {
            return int.Parse(Console.ReadLine());
        }
        private static int[] ReadAndParseIntArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
        }
        private static long ReadAndParseLong()
        {
            return long.Parse(Console.ReadLine());
        }
        private static long[] ReadAndParseLongArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);
        }
        #endregion
    }
}

Submission Info

Judge Result