제출 #103615

#제출 시각아이디문제언어결과실행 시간메모리
103615alexpetrescu크레이피쉬 글쓰는 기계 (IOI12_scrivener)C++14
100 / 100
505 ms63968 KiB
#define MAXN 1000009 #define LOGN 20 int t[LOGN + 1][MAXN]; char val[MAXN]; int h[MAXN], stare[MAXN]; int nodes, stari; void Init() { nodes = 1; stari = 1; stare[stari] = 1; } void TypeLetter(char L) { nodes++; h[nodes] = h[stare[stari]] + 1; t[0][nodes] = stare[stari]; int x = 1; while (t[x - 1][nodes]) { t[x][nodes] = t[x - 1][t[x - 1][nodes]]; x++; } val[nodes] = L; stare[++stari] = nodes; } void UndoCommands(int U) { stare[stari + 1] = stare[stari - U]; stari++; } char GetLetter(int P) { int nod = stare[stari]; int cat = h[nod] - P - 1; for (int i = 0; i < LOGN; i++) if (cat & (1 << i)) nod = t[i][nod]; return val[nod]; }
#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...