Submission #3224277
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for( long long i = 0; i < n; i++) #define erep(i, n) for( long long i = 1; i <= n; i++) int main() {string s; cin >> s; long last = s.size() - 1; string ans = "NO"; while(last >= 4){ if(last >= 6){ if(s.substr(last - 4, 5) == "dream") last = last - 5; else if(s.substr(last - 4, 5) == "erase") last = last - 5; else if(s.substr(last - 5, 6) == "eraser") last = last - 6; else if(s.substr(last - 6, 7) == "dreamer") last = last - 7; else break; } else if(last == 5){ if(s.substr(last - 4, 5) == "dream") last = last - 5; else if(s.substr(last - 4, 5) == "erase") last = last - 5; else if(s.substr(last - 5, 6) == "eraser") last = last - 6; else break; } else if(last == 4){ if(s.substr(last - 4, 5) == "dream") last = last - 5; else if(s.substr(last - 4, 5) == "erase") last = last - 5; else break; } } if(last == -1) ans = "YES"; // string x = "aiueo"; // x = x - 'ue'; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Daydream |
User | mu55 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1078 Byte |
Status | AC |
Exec Time | 8 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 8 ms | 512 KB |
subtask1_1.txt | AC | 6 ms | 512 KB |
subtask1_10.txt | AC | 7 ms | 512 KB |
subtask1_11.txt | AC | 7 ms | 512 KB |
subtask1_12.txt | AC | 7 ms | 512 KB |
subtask1_13.txt | AC | 7 ms | 512 KB |
subtask1_14.txt | AC | 6 ms | 512 KB |
subtask1_15.txt | AC | 6 ms | 512 KB |
subtask1_2.txt | AC | 5 ms | 512 KB |
subtask1_3.txt | AC | 7 ms | 512 KB |
subtask1_4.txt | AC | 7 ms | 512 KB |
subtask1_5.txt | AC | 7 ms | 512 KB |
subtask1_6.txt | AC | 8 ms | 512 KB |
subtask1_7.txt | AC | 7 ms | 512 KB |
subtask1_8.txt | AC | 7 ms | 512 KB |
subtask1_9.txt | AC | 7 ms | 512 KB |