oj.uz

Submission #65761

# Submission time Handle Problem Language Result Execution time Memory
65761 2018-08-08T16:50:37 Z aquablitz11 Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 884 ms 63904 KB 
#include <bits/stdc++.h>
using namespace std;

using pic = pair<int, char>;
const int N = 1<<20;
const int LN = 20;
int cnt;
char chr[N];
int len[N];
int par[N][LN];
int ptr[N];

inline int link(int p, char c)
{
    chr[++cnt] = c;
    par[cnt][0] = p;
    len[cnt] = len[p]+1;
    for (int i = 1; (1<<i) <= len[cnt]; ++i)
        par[cnt][i] = par[par[cnt][i-1]][i-1];
    return cnt;
}

void Init() {
    //printf("Init()\n");
}

int vc;
void TypeLetter(char L) {
    //printf("TypeLetter(%c)\n", L);
    ++vc;
    ptr[vc] = link(ptr[vc-1], L);
}

void UndoCommands(int U)
{
    //printf("UndoCommands(%d)\n", U);
    U = min(U, vc);
    ++vc;
    ptr[vc] = ptr[vc-U-1];
}

char GetLetter(int P)
{
    int u = ptr[vc];
    P = len[ptr[vc]]-P-1;
    for (int i = LN-1; i >= 0; --i)
        if ((1<<i)&P) u = par[u][i];
    //printf("GetLetter(%d) = %c\n", P, ans);
    return chr[u];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 624 KB Output is correct
5 Correct 3 ms 628 KB Output is correct
6 Correct 3 ms 652 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 3 ms 704 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 2 ms 712 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 972 KB Output is correct
2 Correct 4 ms 972 KB Output is correct
3 Correct 5 ms 972 KB Output is correct
4 Correct 4 ms 1040 KB Output is correct
5 Correct 4 ms 1040 KB Output is correct
6 Correct 4 ms 1216 KB Output is correct
7 Correct 4 ms 1236 KB Output is correct
8 Correct 4 ms 1260 KB Output is correct
9 Correct 5 ms 1284 KB Output is correct
10 Correct 5 ms 1284 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 750 ms 52412 KB Output is correct
2 Correct 684 ms 57844 KB Output is correct
3 Correct 507 ms 57844 KB Output is correct
4 Correct 424 ms 57844 KB Output is correct
5 Correct 493 ms 57844 KB Output is correct
6 Correct 398 ms 62756 KB Output is correct
7 Correct 468 ms 62756 KB Output is correct
8 Correct 424 ms 62756 KB Output is correct
9 Correct 684 ms 63904 KB Output is correct
10 Correct 233 ms 63904 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 659 ms 63904 KB Output is correct
2 Correct 765 ms 63904 KB Output is correct
3 Correct 464 ms 63904 KB Output is correct
4 Correct 451 ms 63904 KB Output is correct
5 Correct 495 ms 63904 KB Output is correct
6 Correct 515 ms 63904 KB Output is correct
7 Correct 531 ms 63904 KB Output is correct
8 Correct 705 ms 63904 KB Output is correct
9 Correct 884 ms 63904 KB Output is correct
10 Correct 234 ms 63904 KB Output is correct