oj.uz

Submission #104393

# Submission time Handle Problem Language Result Execution time Memory
104393 2019-04-06T11:30:26 Z dfistric Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 1000 ms 189128 KB 
#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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 4 ms 512 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 300 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 4 ms 792 KB Output is correct
3 Correct 5 ms 768 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 4 ms 1280 KB Output is correct
7 Correct 5 ms 1356 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 4 ms 768 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 652 ms 158952 KB Output is correct
2 Correct 498 ms 174976 KB Output is correct
3 Correct 416 ms 170056 KB Output is correct
4 Correct 432 ms 128084 KB Output is correct
5 Correct 965 ms 147152 KB Output is correct
6 Correct 530 ms 189128 KB Output is correct
7 Execution timed out 1025 ms 90196 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 860 ms 134548 KB Output is correct
2 Execution timed out 1073 ms 121256 KB Time limit exceeded
3 Halted 0 ms 0 KB -