Submission #68497

#TimeUsernameProblemLanguageResultExecution timeMemory
68497nvmdava크레이피쉬 글쓰는 기계 (IOI12_scrivener)C++17
100 / 100
748 ms126844 KiB

#include <bits/stdc++.h>
using namespace std;
char s[1000001];
int now = 0, i = 1, dir[1000001][21], sz[1000001];
void Init() {}

int find(int i, int x){
	for(int j = 0; j < 21; j++){
		if((1 << j) & x){
			i = dir[i][j];
		}
	}
	return i;
}

void TypeLetter(char L) {
	s[i] = L;
	dir[i][0] = now;
	sz[i] = sz[now] + 1;
	dir[i][0] = now;
	for(int j = 1; j < 21; j++){
		if(sz[i] <= (1 << j)) break;
		dir[i][j] = dir[dir[i][j - 1]][j - 1];
	}
	now = i;
	i++;
}
 
void UndoCommands(int U) {
	now = i - U - 1;
	s[i] = s[now];
	for(int j = 0; j <= 20; j++)dir[i][j] = dir[now][j];
	sz[i] = sz[now];
	i++;
}

char GetLetter(int P) {
	return s[find(i - 1, sz[i - 1] - P - 1)];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...