Submission #988500

#	Time	Username	Problem	Language	Result	Execution time	Memory
988500		huutuan	Crayfish scrivener (IOI12_scrivener)	C++14	100 / 100	358 ms	129184 KiB

scrivener

#include <bits/stdc++.h>

using namespace std;

const int N=1e6+10, LG=20;
int dep[N], up[LG][N], node[N];
char a[N];
vector<int> g[N];
int cur, cnt;

void Init() {
   cur=0, cnt=0;
}

void TypeLetter(char L) {
   a[++cnt]=L;
   g[cur].push_back(cnt);
   dep[cnt]=dep[cur]+1;
   up[0][cnt]=cur;
   for (int k=1; k<LG; ++k) up[k][cnt]=up[k-1][up[k-1][cnt]];
   cur=cnt;
   node[cnt]=cur;
}

void UndoCommands(int U) {
   ++cnt;
   cur=node[cnt-U-1];
   node[cnt]=cur;
}

char GetLetter(int P) {
   int d=dep[cur]-P-1;
   int u=cur;
   for (int k=0; k<LG; ++k) if (d>>k&1) u=up[k][u];
   return a[u];
}

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