제출 #943914

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
943914		pan	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++17	100 / 100	836 ms	216148 KiB

scrivener

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, srb_tree_tag, tree_order_statistics_node_update>
typedef int ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;

ll label = 0;
ll ptr = 0; // dummy start point
ll par[1000005][26], twok[1000005][26];
char node[1000005];
ll depth[1000005];

void TypeLetter(char L)
{
	++label;
	node[label] = L;
	depth[label] = depth[ptr]+1;
	twok[label][0] = ptr;
	for (ll i=1; i<=20; ++i)
	{
		if (twok[label][i-1]==0) break;
		twok[label][i] = twok[twok[label][i-1]][i-1];
	}
	par[label][0] = ptr;
	ptr  = label;
	for (ll i=1; i<=20; ++i)
	{
		if (par[ptr][i-1]==0) break;
		par[ptr][i] = par[par[ptr][i-1]][i-1];
	}
	//show(ptr);
}


void UndoCommands(int U)
{
	ll last = ptr;
	//show2(U, last);
	for (ll k=20; k>=0; --k)
	{
		if ((U&((1LL<<k)))==0) continue;
		ptr = par[ptr][k];
		//show2(k, ptr);
		
	}
	++label;
	node[label] = node[ptr];
	depth[label] = depth[ptr];
	for (ll i=0; i<26; ++i) twok[label][i] = twok[ptr][i];
	ptr= label;
	par[ptr][0] = last;
	for (ll i=1; i<=20; ++i)
	{
		if (par[ptr][i-1]==0) break;
		par[ptr][i] = par[par[ptr][i-1]][i-1];
	}
	//show(ptr);
}

char GetLetter(int P)
{
	ll finding = ptr;
	ll mask = depth[ptr]-P-1;
	for (ll k=20; k>=0; --k)
	{
		if ((mask&((1LL<<k)))==0) continue;
		finding = twok[finding][k];
	}
	//show(finding);
	return node[finding];
}



void Init()
{
	for (ll i=0; i<=1000000; ++i) for (ll j=0; j<26; ++j) par[i][j] = 0;
	for (ll i=0; i<=1000000; ++i) for (ll j=0; j<26; ++j) twok[i][j] = 0;
	for (ll i=0; i<=1000000; ++i) depth[i]= 0;
}

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