Submission #425688

#	Time	Username	Problem	Language	Result	Execution time	Memory
425688		temurbek_khujaev	Crayfish scrivener (IOI12_scrivener)	C++17	34 / 100	1078 ms	8212 KiB

scrivener

#include <bits/stdc++.h>

using namespace std;

char ans;
#define N 1000005
int root[N];
#define prev kfldsj
#define next kdslgjdgfs
int prev[N];
int next[N];
char val[N];
int len[N];
int curr = 1;
int last = 0;
int next_node = 0;

void Init() {


}

void TypeLetter(char L) {
    curr++;
    root[curr] = next_node++;
    prev[root[curr]] = root[curr - 1];
    len[root[curr]] = len[prev[root[curr]]] +1;
    val[root[curr]] = L;
}

void UndoCommands(int U) {
    curr++;
    root[curr] = root[curr - U - 1];
}

char GetLetter(int P) {
    int x = root[curr];
    while (len[x] > P + 1 ){
//        cerr << x << endl;
        x = prev[x];
    }
    return val[x];
}

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