Submission #1307464


Source Code Expand

#include <iostream>
#include <string>

using namespace std;

int main() {
	// your code goes here
	string T[4] = {"dreamr", "dream", "eraser", "erase"};
	string s;
	int i=0, l;
	
	cin >> s;
	
	while(s.size() != 0){
		if(i == 4) {
			cout << "NO" << endl;
			return 0;
		}
		if(s.find(T[i]) != -1){
			l = s.find(T[i]);
			if(l == 1) s.erase(l-1, T[i].size());
			else s.erase(l, T[i].size());
			i = 0;
		}else{
			i++;
		}
	}
	cout << "YES" << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Daydream
User kedama4156991
Language C++14 (GCC 5.4.1)
Score 0
Code Size 492 Byte
Status TLE
Exec Time 2103 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 3
TLE × 16
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 TLE 2103 ms 512 KB
subtask1_1.txt TLE 2103 ms 512 KB
subtask1_10.txt TLE 2103 ms 512 KB
subtask1_11.txt TLE 2103 ms 512 KB
subtask1_12.txt TLE 2103 ms 512 KB
subtask1_13.txt TLE 2103 ms 512 KB
subtask1_14.txt TLE 2103 ms 512 KB
subtask1_15.txt TLE 2103 ms 512 KB
subtask1_2.txt TLE 2103 ms 512 KB
subtask1_3.txt TLE 2103 ms 512 KB
subtask1_4.txt TLE 2103 ms 512 KB
subtask1_5.txt TLE 2103 ms 512 KB
subtask1_6.txt TLE 2103 ms 512 KB
subtask1_7.txt TLE 2103 ms 512 KB
subtask1_8.txt TLE 2103 ms 512 KB
subtask1_9.txt TLE 2103 ms 512 KB