Submission #2636361

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))

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}

#define EMPTY 0
#define D 1
#define DR 2
#define DRE 3
#define DREA 4
#define DREAM 5
//#define DREAME 6
#define DREAMER 7
#define E 8
#define ER 9
#define ERA 10
#define ERAS 11
#define ERASE 12
#define ERASER 13
#define R 14

bool solve2(string& s){
    int N = s.size();
    int st = EMPTY;
    vi q;
    for (int i=0; i<N; ++i) {
#ifdef DEBUG
        fprintf(stderr, " %d", st);
#endif
        int ch = s[i];
        switch (st) {
        case EMPTY:
            switch (ch) {
                case 'd': st = D; break;
                case 'e': st = E; break;
                case 'r': {
                    if (!q.empty() && q.back() == ERASE) {
                        // q[q.size()-1] =
                        q.back() = ERASER;
                        st = EMPTY;
                    }
                    else return false;
                    break;
                }
                default: return false;
            }
            break;
        case D:
            if (ch == 'r') { st = DR; break; }
            else return false;
        case DR:
            if (ch == 'e') { st = DRE; break; }
            else return false;
        case DRE:
            if (ch == 'a') { st = DREA; break; }
            else return false;
        case DREA:
            if (ch == 'm') { q.pb(DREAM); st = EMPTY; break; }
            else return false;
        // case DREAM:
        // case DREAME:
        // case DREAMER:
        case E:
            if (ch == 'r') { st = ER; break; }
            else return false;
        case ER:
            switch (ch) {
                case 'a': st = ERA; break;
                case 'd':
                    if (!q.empty() && q.back() == DREAM) {
                        q.back() = DREAMER; st = D; break;
                    }
                    else return false;
                case 'e':
                    if (!q.empty() && q.back() == DREAM) {
                        q.back() = DREAMER; st = E; break;
                    }
                    else return false;
                default:
                    return false;
            }
            break;
        case ERA:
            if (ch == 's') { st = ERAS; break; }
            else return false;
        case ERAS:
            if (ch == 'e') { q.pb(ERASE); st = EMPTY; break; }
            else return false;
        // case ERASE:
        // case ERASER:
        // case R:
        }
    }
#ifdef DEBUG
    fprintf(stderr, " %d\n", st);
#endif

    if (st == EMPTY) return true;
    if (q.empty()) return false;
    if (q.back() == DREAM && st == ER) return true;
    // if (q.back() == ERASE && st == R) return true;
    return false;
}

bool solve(string& s){
    int N = s.size();
    int st = EMPTY;
    vi q;
    for (int i=0; i<N; ++i) {
        switch (s[i]){
            case 'a':
                switch (st){
                    case ER: // er -> era
                        st = ERA; break;
                    case DRE: // dre -> drea
                        st = DREA; break;
                    default:
                        return false;
                }
                break;
            case 'd':
                switch (st){
                    case EMPTY: // 0 -> d
                        st = D; break;
                    case ER: // [dream]er | d...
                        if (q.back() == DREAM) {
                            q[q.size()-1] = DREAMER; st = D; break;
                        }
                        else return false;
                    default:
                        return false;
                }
                break;
            case 'e':
                switch (st){
                    case EMPTY: // 0 -> e
                        st = E; break;
                    case DR: // dr -> dre
                        st = DRE; break;
                    case ERAS: // eras -> erase
                        q.pb(ERASE); st=EMPTY; break;

                    case ER: // [dream]er | e...
                        if (q.back() == DREAM) {
                            q[q.size()-1] = DREAMER; st = E; break;
                        }
                        else return false;
                    default:
                        return false;
                }
                break;
            case 'm':
                switch (st){
                    case DREA: // drea -> dream
                        q.pb(DREAM); st=EMPTY; break;
                    default:
                        return false;
                }
                break;
            case 'r':
                switch (st){
                    case EMPTY: // [erase] -> [eraser]
                        // rで始まる語はないのですぐに解決
                        if (q.back() == ERASE) {
                            q[q.size()-1] = ERASER; st = EMPTY; break;
                        }
                        else return false;
                    case D: // d -> dr
                        st = DR; break;
                    case E: // e -> er
                        st = ER; break;
                    default:
                        return false;
                }
                break;
            case 's':
                switch (st){
                    case ERA: // era -> eras
                        st = ERAS; break;
                    default:
                        return false;
                }
                break;

            default:
                return false;
        }
    }

    if (st == EMPTY) return true;
    if (q.empty()) return false;
    // if (q.back() == ERASE && st == R) return true;
    if (q.back() == DREAM && st == ER) return true;
    return false;
}

int main() {
    string s; cin >> s;
    // cout << (solve(s) ? "YES":"NO") << endl;
    cout << (solve2(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 7779 Byte
Status
Exec Time 5 ms
Memory 640 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 4 ms 512 KB
subtask1_1.txt 4 ms 512 KB
subtask1_10.txt 5 ms 640 KB
subtask1_11.txt 5 ms 640 KB
subtask1_12.txt 5 ms 640 KB
subtask1_13.txt 5 ms 640 KB
subtask1_14.txt 5 ms 512 KB
subtask1_15.txt 5 ms 512 KB
subtask1_2.txt 5 ms 512 KB
subtask1_3.txt 5 ms 640 KB
subtask1_4.txt 4 ms 512 KB
subtask1_5.txt 5 ms 640 KB
subtask1_6.txt 4 ms 512 KB
subtask1_7.txt 4 ms 512 KB
subtask1_8.txt 5 ms 640 KB
subtask1_9.txt 5 ms 640 KB