oj.uz

Submission #98735

# Submission time Handle Problem Language Result Execution time Memory
98735 2019-02-25T13:36:05 Z Alexa2001 Crayfish scrivener (IOI12_scrivener) C++17
34 / 100
 1000 ms 165112 KB 
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 1e6 + 5, lg = 20;

int nodes, t[lg+2][Nmax], p[lg+2][Nmax], up[Nmax];
char letter[Nmax];

void Init()
{
}

void TypeLetter(char L)
{
    letter[++nodes] = L;
    t[0][nodes] = nodes - 1;
    p[0][nodes] = nodes - 1;
    up[nodes] = up[nodes - 1] + 1;

    int i;
    for(i=1; i<=lg; ++i)
        t[i][nodes] = t[i-1][t[i-1][nodes]],
        p[i][nodes] = p[i-1][p[i-1][nodes]];
}

void UndoCommands(int U)
{
    p[0][nodes + 1] = nodes;

    int cursor = nodes, i;
    for(i=0; i<=lg; ++i)
        if(U & (1<<i)) cursor = p[i][cursor];

    t[0][nodes + 1] = cursor;
    up[++nodes] = up[cursor];

    for(i=1; i<=lg; ++i)
        t[i][nodes] = t[i-1][t[i-1][nodes]],
        p[i][nodes] = p[i-1][p[i-1][nodes]];
}

char GetLetter(int P)
{
    int i, x = nodes; ++P;
    for(i=lg; i>=0; --i)
        if(up[t[i][x]] >= P) x = t[i][x];
    return letter[x];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1024 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1380 KB Output is correct
4 Correct 6 ms 1408 KB Output is correct
5 Correct 4 ms 1280 KB Output is correct
6 Correct 4 ms 1408 KB Output is correct
7 Correct 4 ms 1336 KB Output is correct
8 Correct 6 ms 1508 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 4 ms 1536 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 742 ms 125348 KB Output is correct
2 Correct 788 ms 152612 KB Output is correct
3 Correct 740 ms 152336 KB Output is correct
4 Correct 901 ms 160568 KB Output is correct
5 Correct 878 ms 140908 KB Output is correct
6 Correct 606 ms 165112 KB Output is correct
7 Execution timed out 1043 ms 119376 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

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