#include<bits/stdc++.h>
using namespace std;
const int logN = 17;
const int N = 2e5 + 5;
static int depth[N], node, lca[N][logN], C, S, W[N];
char col[N];
void Init() {
}
void TypeLetter(char L) {
W[++S] = ++C;
col[C] = L;
lca[C][0] = node;
node = C;
for(int i = 1; i <= logN; i++)
lca[node][i] = lca[lca[node][i-1]][i-1];
depth[node] = depth[lca[node][0]] + 1;
}
void UndoCommands(int U) {
node = W[S - U];
W[++S] = node;
}
char GetLetter(int P) {
P = depth[node] - P - 1;
int tt = node;
for(int i = logN; i >= 0; i--)
if((1 << i) <= P) {
P -= (1 << i);
tt = lca[tt][i];
}
return col[tt];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
16752 KB |
Output is correct |
2 |
Correct |
0 ms |
16752 KB |
Output is correct |
3 |
Correct |
0 ms |
16752 KB |
Output is correct |
4 |
Correct |
0 ms |
16752 KB |
Output is correct |
5 |
Correct |
1 ms |
16752 KB |
Output is correct |
6 |
Correct |
0 ms |
16752 KB |
Output is correct |
7 |
Correct |
0 ms |
16752 KB |
Output is correct |
8 |
Correct |
0 ms |
16752 KB |
Output is correct |
9 |
Correct |
0 ms |
16752 KB |
Output is correct |
10 |
Correct |
0 ms |
16752 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
16752 KB |
Output is correct |
2 |
Correct |
0 ms |
16752 KB |
Output is correct |
3 |
Correct |
0 ms |
16752 KB |
Output is correct |
4 |
Correct |
0 ms |
16752 KB |
Output is correct |
5 |
Correct |
0 ms |
16752 KB |
Output is correct |
6 |
Correct |
0 ms |
16752 KB |
Output is correct |
7 |
Correct |
0 ms |
16752 KB |
Output is correct |
8 |
Correct |
0 ms |
16752 KB |
Output is correct |
9 |
Correct |
0 ms |
16752 KB |
Output is correct |
10 |
Correct |
0 ms |
16752 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
16752 KB |
Output is correct |
2 |
Correct |
0 ms |
16752 KB |
Output is correct |
3 |
Correct |
0 ms |
16752 KB |
Output is correct |
4 |
Correct |
0 ms |
16752 KB |
Output is correct |
5 |
Correct |
2 ms |
16752 KB |
Output is correct |
6 |
Correct |
2 ms |
16752 KB |
Output is correct |
7 |
Correct |
0 ms |
16752 KB |
Output is correct |
8 |
Correct |
0 ms |
16752 KB |
Output is correct |
9 |
Correct |
0 ms |
16752 KB |
Output is correct |
10 |
Correct |
0 ms |
16752 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
78 ms |
16752 KB |
Program hung waiting for input |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
113 ms |
16752 KB |
SIGSEGV Segmentation fault |
2 |
Halted |
0 ms |
0 KB |
- |