Submission #115591

#	Time	Username	Problem	Language	Result	Execution time	Memory
115591		faustaadp	Crayfish scrivener (IOI12_scrivener)	C++17	60 / 100	1064 ms	82040 KiB

scrivener

#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
pair<char,int> A[1000001];
int te,X;
int p[20][1000001],ii;
void Init() 
{
	//for(ii=1;ii<=1000002;ii++)
	//	LO[ii]=ceil(log(ii)/log(2));
}
void TypeLetter(char L) 
{
	if(te==0)
	{
		A[te]=mp(L,0);
		p[0][te]=0;
	}
	else
	{
		A[te]=mp(L,A[te-1].se+1);
		p[0][te]=te-1;
		for(ii=1;ii<19;ii++)
			p[ii][te]=p[ii-1][p[ii-1][te]];
	}
	te++;
}

void UndoCommands(int U) 
{
	A[te]=A[te-U-1];
	p[0][te]=p[0][te-U-1];
	for(ii=1;ii<19;ii++)
		p[ii][te]=p[ii-1][p[ii-1][te]];
	te++;
//	cek();
}

char GetLetter(int P) 
{
	X=te-1;
	for(ii=18;ii>=0;ii--)
		if(A[p[ii][X]].se>=P)
		{
			if(A[p[ii][X]].se==P)
			{
				X=p[ii][X];
				break;
			}
			X=p[ii][X];
		}
	return A[X].fi;
//	return hai[P];
}

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