Submission #79072

#	Time	Username	Problem	Language	Result	Execution time	Memory
79072		TAMREF	Crayfish scrivener (IOI12_scrivener)	C++11	34 / 100	1085 ms	83356 KiB

scrivener

#include <bits/stdc++.h>
using namespace std;
const int mx = 1e6 + 5;
const int lg = 20;
int C[mx], I[mx];
char X[mx];
int p[mx][lg];
int n;

void show(int i){
    printf("C : %d I : %d X : %c\n",C[i],I[i],X[C[i]]);
}

void Init() {
}

void TypeLetter(char L) {
    ++n;
    I[n] = I[n-1] + 1;
    C[n] = n;
    X[n] = L;
    p[n][0] = n - 1;
    for(int j = 1; j < lg; j++){
        p[n][j] = p[p[n][j-1]][j-1];
    }
}

void UndoCommands(int U) {
    ++n;
    if(U == n){
        I[n] = 0;
        C[n] = 0;
        X[n] = 'U';
        return;
    }
    I[n] = I[n - 1 - U];
    C[n] = C[n - 1 - U];
    p[n][0] = n - 1 - U;
    for(int j = 1; j < lg; j++){
        p[n][j] = p[p[n][j-1]][j-1];
    }
}

char GetLetter(int P) {
    ++P;
    int b = n;
    for(int j = lg-1; j >= 0; j--){
        if(I[b] == P) return X[C[b]];
        if(I[p[b][j]] >= P) b = p[b][j];
    }
    return I[b] == P ? X[C[b]] : X[C[p[b][0]]];
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 22 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 40