#include <bits/stdc++.h>
using namespace std;
char charOfStep[1000005];
int depth[1000005];
int kthAncestor[1000005][21];
int curStep = 0;
void Init() {}
void TypeLetter(char L) {
curStep++;
charOfStep[curStep] = L;
depth[curStep] = depth[curStep-1]+1;
kthAncestor[curStep][0] = curStep-1;
for(int i = 1; 1<<i <= depth[curStep]; i++)
kthAncestor[curStep][i] = kthAncestor[kthAncestor[curStep][i-1]][i-1];
}
void UndoCommands(int U) {
curStep++;
charOfStep[curStep] = charOfStep[curStep-1-U];
depth[curStep] = depth[curStep-1-U];
kthAncestor[curStep][0] = kthAncestor[curStep-1-U][0];
for(int i = 1; 1<<i <= depth[curStep]; i++)
kthAncestor[curStep][i] = kthAncestor[kthAncestor[curStep][i-1]][i-1];
}
char GetLetter(int P) {
int node = curStep;
for(int i = 21; i >= 0; i--)
if(depth[node] - (1<<i) >= P+1)
node = kthAncestor[node][i];
return charOfStep[node];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
380 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
3 ms |
640 KB |
Output is correct |
3 |
Correct |
3 ms |
768 KB |
Output is correct |
4 |
Correct |
4 ms |
768 KB |
Output is correct |
5 |
Correct |
3 ms |
768 KB |
Output is correct |
6 |
Correct |
3 ms |
768 KB |
Output is correct |
7 |
Correct |
3 ms |
768 KB |
Output is correct |
8 |
Correct |
3 ms |
768 KB |
Output is correct |
9 |
Correct |
3 ms |
768 KB |
Output is correct |
10 |
Correct |
3 ms |
768 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
680 ms |
66440 KB |
Output is correct |
2 |
Correct |
693 ms |
80396 KB |
Output is correct |
3 |
Correct |
458 ms |
80640 KB |
Output is correct |
4 |
Correct |
493 ms |
85648 KB |
Output is correct |
5 |
Correct |
490 ms |
74956 KB |
Output is correct |
6 |
Correct |
412 ms |
87200 KB |
Output is correct |
7 |
Execution timed out |
1029 ms |
76900 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
711 ms |
62008 KB |
Output is correct |
2 |
Correct |
770 ms |
55032 KB |
Output is correct |
3 |
Correct |
417 ms |
68728 KB |
Output is correct |
4 |
Correct |
423 ms |
61468 KB |
Output is correct |
5 |
Correct |
472 ms |
78112 KB |
Output is correct |
6 |
Correct |
453 ms |
80900 KB |
Output is correct |
7 |
Correct |
496 ms |
80580 KB |
Output is correct |
8 |
Execution timed out |
1016 ms |
69868 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |