Submission #1307438


Source Code Expand

using namespace std;
using ll=long long;
#include <string>
#include <vector>
#include <cmath>
#include <iostream>
#include <algorithm>
#define out(S) cout<<(S)<<endl;


int main()
{
	string S;
	cin >> S;
	//後ろから3文字目で判断
	while (S.size()>=5)
	{
		int index = S.size() - 3;
		if (S[index] == 'e') {
			//dream
			S.erase(index - 2, index + 3);
		}
		else if (S[index] == 'm') {
			//dreamer
			S.erase(index - 4, index + 3);
		}
		else if (S[index] == 'a') {
			//erase
			S.erase(index - 2, index + 3);
		}
		else if (S[index] == 's') {
			//eraser
			S.erase(index - 3, index + 3);
		}
		else {
			break;
		}
	}
	if (S.size() == 0) {
		out("YES");
	}
	else {
		out("NO");
	}
	return 0;
}

Submission Info

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