Submission #168587

# Submission time Handle Problem Language Result Execution time Memory
168587 2019-12-14T03:26:52 Z tri Crayfish scrivener (IOI12_scrivener) C++14
60 / 100
1000 ms 88220 KB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

const int MAXN = 1e6 + 10;
const int LOGN = 20;

char lets[MAXN];
int L[MAXN], jmp[MAXN][LOGN];

void Init() {
    memset(lets, 0, sizeof(lets));
    memset(L, 0, sizeof(L));
    memset(jmp, 0, sizeof(jmp));
}

int cI = 1;

void TypeLetter(char cLet) {
    lets[cI] = cLet;
    L[cI] = L[cI - 1] + 1;

    if (lets[cI - 1] == 0) {
        jmp[cI][0] = jmp[cI - 1][0];
    } else {
        jmp[cI][0] = cI - 1;
    }

    for (int log = 1; log < LOGN; log++) {
        jmp[cI][log] = jmp[jmp[cI][log - 1]][log - 1];
    }

    cI++;
}

void UndoCommands(int U) {
    L[cI] = L[cI - U - 1];

    if (lets[cI - U - 1] == 0) {
        jmp[cI][0] = jmp[cI - U - 1][0];
    } else {
        jmp[cI][0] = cI - U - 1;
    }

    for (int log = 1; log < LOGN; log++) {
        jmp[cI][log] = jmp[jmp[cI][log - 1]][log - 1];
    }

    cI++;
}

char GetLetter(int P) {
    int nJ = L[cI - 1] - P - 1;
    int i = cI - 1;

    if (lets[i] == 0) {
        i = jmp[i][0];
    }

    for (int log = LOGN - 1, jmps = 1 << log; log >= 0; log--, jmps /= 2) {
        if (jmps <= nJ) {
            i = jmp[i][log];
            nJ -= jmps;
        }
    }
    return lets[i];
}
# Verdict Execution time Memory Grader output
1 Correct 70 ms 83448 KB Output is correct
2 Correct 69 ms 83448 KB Output is correct
3 Correct 70 ms 83452 KB Output is correct
4 Correct 69 ms 83448 KB Output is correct
5 Correct 69 ms 83508 KB Output is correct
6 Correct 69 ms 83448 KB Output is correct
7 Correct 70 ms 83448 KB Output is correct
8 Correct 70 ms 83444 KB Output is correct
9 Correct 69 ms 83412 KB Output is correct
10 Correct 70 ms 83548 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 69 ms 83448 KB Output is correct
2 Correct 69 ms 83504 KB Output is correct
3 Correct 70 ms 83580 KB Output is correct
4 Correct 70 ms 83424 KB Output is correct
5 Correct 70 ms 83448 KB Output is correct
6 Correct 70 ms 83448 KB Output is correct
7 Correct 70 ms 83448 KB Output is correct
8 Correct 70 ms 83420 KB Output is correct
9 Correct 72 ms 83444 KB Output is correct
10 Correct 69 ms 83576 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 70 ms 83440 KB Output is correct
2 Correct 71 ms 83552 KB Output is correct
3 Correct 71 ms 83576 KB Output is correct
4 Correct 71 ms 83576 KB Output is correct
5 Correct 71 ms 83576 KB Output is correct
6 Correct 71 ms 83576 KB Output is correct
7 Correct 71 ms 83576 KB Output is correct
8 Correct 71 ms 83576 KB Output is correct
9 Correct 71 ms 83572 KB Output is correct
10 Correct 71 ms 83484 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 486 ms 84100 KB Output is correct
2 Correct 589 ms 84088 KB Output is correct
3 Correct 442 ms 84088 KB Output is correct
4 Correct 483 ms 84216 KB Output is correct
5 Correct 484 ms 84472 KB Output is correct
6 Correct 463 ms 84216 KB Output is correct
7 Correct 917 ms 84472 KB Output is correct
8 Correct 885 ms 84016 KB Output is correct
9 Correct 592 ms 88220 KB Output is correct
10 Correct 307 ms 87560 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 597 ms 84316 KB Output is correct
2 Correct 683 ms 84812 KB Output is correct
3 Correct 436 ms 84344 KB Output is correct
4 Correct 462 ms 84780 KB Output is correct
5 Correct 474 ms 84472 KB Output is correct
6 Correct 459 ms 84344 KB Output is correct
7 Correct 481 ms 84344 KB Output is correct
8 Correct 835 ms 84600 KB Output is correct
9 Execution timed out 1091 ms 84600 KB Time limit exceeded
10 Halted 0 ms 0 KB -