제출 #104393

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104393		dfistric	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++14	34 / 100	1073 ms	189128 KiB

scrivener

#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) FOR(i, 0, n)

using namespace std;

struct node {
    node* ch[30];
    node* par;
    node* jump;
    char c;
    int dep;

    node(node* n, node* nn, char cc) {
        REP(i, 26) ch[i] = 0;
        par = n, jump = nn, c = cc;

        if (n) dep = n->dep + 1;
        else   dep = 0;
    }
};
node* root;

vector <node*> ve;
int flag;
string s;

void Init() {
    root = new node(NULL, NULL, '.');
    ve.push_back(root);

    return;
}

node* go_up(int x) {
    node* curr = root;

    while (curr->dep > x) {
        int d = curr->dep;
        int ne = curr->dep - (d & -d);
        if (ne >= x) curr = curr->jump;
        else         curr = curr->par;
    }

    return curr;
}

void TypeLetter(char L) {
    flag = 1;

    int x = (L - 'a');
    int nd = root->dep + 1;
    nd = nd - (nd & -nd);
    node* up = go_up(nd);
    if (!root->ch[x]) root->ch[x] = new node(root, up, L);
    root = root->ch[x];
    ve.push_back(root);

    return;
}

void UndoCommands(int U) {
    flag = 1;

    root = ve[ve.size() - 1 - U];
    ve.push_back(root);

    return;
}

char GetLetter(int P) {
    node* curr = go_up(P + 1);
    return curr->c;
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 22 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 40