oj.uz

Submission #104389

# Submission time Handle Problem Language Result Execution time Memory
104389 2019-04-06T11:08:48 Z dfistric Crayfish scrivener (IOI12_scrivener) C++14
60 / 100
 1000 ms 194388 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;
    if (!root->ch[x]) root->ch[x] = new node(root, go_up(nd - 1), 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) {
    if (flag) {
        s = "";
        node* curr = root;
        while (curr) {
            s.push_back(curr->c);
            curr = curr->par;
        }
        reverse(s.begin(), s.end());
        flag = 0;
    }
    return s[P + 1];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 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 0 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 159364 KB Output is correct
2 Correct 371 ms 175808 KB Output is correct
3 Correct 402 ms 170164 KB Output is correct
4 Correct 389 ms 128072 KB Output is correct
5 Correct 345 ms 147540 KB Output is correct
6 Correct 393 ms 189892 KB Output is correct
7 Correct 357 ms 90936 KB Output is correct
8 Correct 342 ms 140988 KB Output is correct
9 Correct 334 ms 194388 KB Output is correct
10 Correct 277 ms 142008 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1060 ms 11852 KB Time limit exceeded
2 Halted 0 ms 0 KB -