Submission #935670

#	Time	Username	Problem	Language	Result	Execution time	Memory
935670		tnun	Crayfish scrivener (IOI12_scrivener)	C++14	100 / 100	495 ms	98972 KiB

scrivener

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
struct node{
	char c;
	int p[20];
	int h;
};
vector<node> trie;
const int N=1000003;
int cur[N];
int current=0;
int curs;
node Add(char L,int par){
	node j;
	j.h=trie[par].h+1;
	j.p[0]=par;
	j.c=L;
	for(int i=1;i<20;i++){
		j.p[i]=trie[j.p[i-1]].p[i-1];
	}
	return j;
}
void TypeLetter(char L){
	cur[current]=trie.size();
	trie.pb(Add(L,curs));
	curs=cur[current];
	current++;
}
void UndoCommands(int S){
	cur[current]=cur[current-S-1];
	curs=cur[current];
	current++;
}
char GetLetter(int idx){
	idx++;
	int v=curs;
	for(int i=19;i>=0;i--){
		if(trie[trie[v].p[i]].h >= idx){
            v=trie[v].p[i];
        }
	}
	return trie[v].c;
}
void Init(){
	node first;
	first.c=0;
	for(int i=0;i<20;i++){
		first.p[i]=0;
	}
	first.h=0;
  trie.pb(first);
}

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