Submission #382365

#	Time	Username	Problem	Language	Result	Execution time	Memory
382365		alishahali1382	Crayfish scrivener (IOI12_scrivener)	C++14	100 / 100	869 ms	86636 KiB

scrivener

#include <bits/stdc++.h>
//#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;

const int MAXN=1000010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int par[MAXN][LOG], sz[MAXN], nex[MAXN];
char last[MAXN];

void Init(){
	
}
void TypeLetter(char ch){
	n++;
	last[n]=ch;
	nex[n]=n;
	par[n][0]=nex[n-1];
	sz[n]=sz[nex[n-1]]+1;
//	if (!last[par[n][0]]) par[n][0]=par[par[n][0]][0];
	for (int i=1; i<LOG; i++) par[n][i]=par[par[n][i-1]][i-1];
}
void UndoCommands(int ted){
	n++;
	nex[n]=nex[n-1-ted];
	par[n][0]=nex[n];
//	if (!last[par[n][0]]) par[n][0]=par[par[n][0]][0];
	sz[n]=sz[par[n][0]]+1;
	for (int i=1; i<LOG; i++) par[n][i]=par[par[n][i-1]][i-1];
}
char GetLetter(int pos){
	int v=n, ted=sz[v]-pos-1;
	for (int i=LOG-1; ~i; i--) if (ted&(1<<i)) v=par[v][i];
	return last[v];
}

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