Submission #2555739


Source Code Expand

#include<iostream>
#include<string>
#include<math.h>
#include<algorithm>

using namespace std;

#define ll long long

string s_replace(string s, string find, string moji) {
	int ix;
	while ((ix = s.find(find, 0)) >= 0) {
		s.replace(ix, find.size(), moji);
	}
	return s;
}

int main() {
	string s, ans = "YES";
	cin >> s;
	s = s_replace(s, "eraser", "Z");
	s = s_replace(s, "erase", "Z");
	s = s_replace(s, "dreamer", "Z");
	s = s_replace(s, "dream", "Z");
	for (int i = 0; i < s.size(); i++) {
		if (s[i] != 'Z') {
			ans = "NO";
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task ABC049C - Daydream
User AMeararEX
Language C++14 (GCC 5.4.1)
Score 300
Code Size 603 Byte
Status AC
Exec Time 1253 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 1199 ms 512 KB
subtask1_1.txt AC 1208 ms 512 KB
subtask1_10.txt AC 1253 ms 512 KB
subtask1_11.txt AC 1247 ms 512 KB
subtask1_12.txt AC 1230 ms 512 KB
subtask1_13.txt AC 1239 ms 512 KB
subtask1_14.txt AC 1238 ms 512 KB
subtask1_15.txt AC 1215 ms 512 KB
subtask1_2.txt AC 1203 ms 512 KB
subtask1_3.txt AC 1208 ms 512 KB
subtask1_4.txt AC 1211 ms 512 KB
subtask1_5.txt AC 1205 ms 512 KB
subtask1_6.txt AC 1198 ms 512 KB
subtask1_7.txt AC 1207 ms 512 KB
subtask1_8.txt AC 1214 ms 512 KB
subtask1_9.txt AC 1193 ms 512 KB