제출 #115573

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115573		faustaadp	Crayfish scrivener (IOI12_scrivener)	C++17	34 / 100	1074 ms	93688 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;
char last;

char hai[1010101];
pair<ll,ll> A[1010101];
ll te;
int p[20][1000001];
void cek()
{
	ll ii;
	for(ii=0;ii<te;ii++)
		cout<<ii<<" "<<char(A[ii].fi)<<" "<<A[ii].se<<"\n";
	cout<<"\n";
}
void Init() {}
void TypeLetter(char L) 
{
	ll bes=0,ii;
	if(te>0)
		bes=A[te-1].se+1;
	A[te]=mp(L,bes);
	if(te==0)
		p[0][te]=0;
	else
		p[0][te]=te-1;
	for(ii=1;ii<20;ii++)
		p[ii][te]=p[ii-1][p[ii-1][te]];
	te++;
//	cek();
}

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

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

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