Submission #2636388

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))


bool solve(string& s){
    int N = s.size();
    reverse(ALL(s));

    const char *p = s.c_str();

    /*
    dream
    dreamer
    erase
    eraser
    */
    for (int i=0; i<N; ) {
        if (i+5 <= N && strncmp(p+i, "maerd", 5) == 0) {
            i += 5; continue;
        }
        if (i+7 <= N && strncmp(p+i, "remaerd", 7) == 0) {
            i += 7; continue;
        }
        if (i+5 <= N && strncmp(p+i, "esare", 5) == 0) {
            i += 5; continue;
        }
        if (i+6 <= N && strncmp(p+i, "resare", 6) == 0) {
            i += 6; continue;
        }
        return false;
    }
    return true;
}

int main() {
    string s; cin >> s;
    cout << (solve(s) ? "YES":"NO") << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 白昼夢 / Daydream
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1832 Byte
Status
Exec Time 6 ms
Memory 512 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All 300 / 300 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 1 ms 256 KB
subtask0_1.txt 1 ms 256 KB
subtask0_2.txt 1 ms 256 KB
subtask1_0.txt 5 ms 512 KB
subtask1_1.txt 5 ms 512 KB
subtask1_10.txt 5 ms 512 KB
subtask1_11.txt 5 ms 512 KB
subtask1_12.txt 5 ms 512 KB
subtask1_13.txt 5 ms 512 KB
subtask1_14.txt 5 ms 512 KB
subtask1_15.txt 5 ms 512 KB
subtask1_2.txt 4 ms 512 KB
subtask1_3.txt 5 ms 512 KB
subtask1_4.txt 6 ms 512 KB
subtask1_5.txt 5 ms 512 KB
subtask1_6.txt 5 ms 512 KB
subtask1_7.txt 5 ms 512 KB
subtask1_8.txt 5 ms 512 KB
subtask1_9.txt 5 ms 512 KB