제출 #1190859

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1190859		Joon_Yorigami	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++20	100 / 100	679 ms	209468 KiB

scrivener

#include<bits/stdc++.h>
using namespace std;
#define ll long long

ll ancestor[1000002][25];
ll currletter[1000002];
ll length[1000002];
ll plen = 0, pt = 0;
void Init()
{

}

void TypeLetter(char L)
{
    plen+=1;
    pt=plen-1;
    currletter[plen] = L;
    length[plen] = length[pt]+1;
    ancestor[plen][0] = pt;
    for(int i=1;i<=24;i++)
    {
        ancestor[plen][i] = ancestor[ancestor[plen][i-1]][i-1];
    }
}

void UndoCommands(int U)
{
    plen+=1;
    pt=plen-U-1;
    currletter[plen]=currletter[pt];
    length[plen]=length[pt];
    for(int i=0;i<=24;i++)
    {
        ancestor[plen][i]=ancestor[pt][i];
    }
}

char GetLetter(int P)
{
    P+=1;
    ll k;
    k=length[plen]-P;
    pt=plen;
    for(int i=24;i>=0;i-=1)
    {
        if((1<<i)&k)
        {
            pt=ancestor[pt][i];
        }
    }
    return currletter[pt];
}
/*
int main()
{
	int t,x;
    char op,c;
	cin >> t;
	while(t--)
    {
		cin >> op;
		if(op=='T')
        {
			cin >> c;
			TypeLetter( c );
		}
		if(op=='U')
        {
			cin >> x;
			UndoCommands( x );
		}
		if(op=='P')
        {
			cin >> x;
			cout << GetLetter( x ) << endl;
		}
	}
}
*/

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