#include <bits/stdc++.h>
using namespace std;
int le[1000005],n,k,par[20][1000005],dp[1000005];
char re[1000005];
void Init(void){};
void TypeLetter(char c){
int v=le[n];
k++;
re[k]=c;
par[0][k]=v;
dp[k]=dp[v]+1;
for(int i=0;i<19;i++)par[i+1][k]=par[i][par[i][k]];
n++;
le[n]=k;
}
void UndoCommands(int x){
le[n+1]=le[n-x];
n++;
}
char GetLetter(int x){
x++;
int v=le[n];
for(int i=0;i<20;i++)if((dp[v]-x)>>i&1)v=par[i][v];
return re[v];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
504 KB |
Output is correct |
3 |
Correct |
2 ms |
504 KB |
Output is correct |
4 |
Correct |
2 ms |
504 KB |
Output is correct |
5 |
Correct |
2 ms |
504 KB |
Output is correct |
6 |
Correct |
2 ms |
532 KB |
Output is correct |
7 |
Correct |
2 ms |
504 KB |
Output is correct |
8 |
Correct |
2 ms |
504 KB |
Output is correct |
9 |
Correct |
2 ms |
504 KB |
Output is correct |
10 |
Correct |
2 ms |
504 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
504 KB |
Output is correct |
3 |
Correct |
2 ms |
504 KB |
Output is correct |
4 |
Correct |
2 ms |
504 KB |
Output is correct |
5 |
Correct |
2 ms |
504 KB |
Output is correct |
6 |
Correct |
2 ms |
504 KB |
Output is correct |
7 |
Correct |
2 ms |
504 KB |
Output is correct |
8 |
Correct |
2 ms |
632 KB |
Output is correct |
9 |
Correct |
2 ms |
504 KB |
Output is correct |
10 |
Correct |
2 ms |
504 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
632 KB |
Output is correct |
2 |
Correct |
3 ms |
632 KB |
Output is correct |
3 |
Correct |
3 ms |
760 KB |
Output is correct |
4 |
Correct |
3 ms |
760 KB |
Output is correct |
5 |
Correct |
3 ms |
760 KB |
Output is correct |
6 |
Correct |
3 ms |
888 KB |
Output is correct |
7 |
Correct |
3 ms |
888 KB |
Output is correct |
8 |
Correct |
3 ms |
760 KB |
Output is correct |
9 |
Correct |
3 ms |
760 KB |
Output is correct |
10 |
Correct |
3 ms |
632 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
311 ms |
51832 KB |
Output is correct |
2 |
Correct |
348 ms |
57488 KB |
Output is correct |
3 |
Correct |
310 ms |
56188 KB |
Output is correct |
4 |
Correct |
320 ms |
44964 KB |
Output is correct |
5 |
Correct |
349 ms |
49116 KB |
Output is correct |
6 |
Correct |
269 ms |
62072 KB |
Output is correct |
7 |
Correct |
314 ms |
30488 KB |
Output is correct |
8 |
Correct |
295 ms |
45944 KB |
Output is correct |
9 |
Correct |
412 ms |
63404 KB |
Output is correct |
10 |
Correct |
217 ms |
46796 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
408 ms |
44304 KB |
Output is correct |
2 |
Correct |
457 ms |
39276 KB |
Output is correct |
3 |
Correct |
327 ms |
43256 KB |
Output is correct |
4 |
Correct |
354 ms |
32392 KB |
Output is correct |
5 |
Correct |
265 ms |
47356 KB |
Output is correct |
6 |
Correct |
275 ms |
44664 KB |
Output is correct |
7 |
Correct |
269 ms |
47612 KB |
Output is correct |
8 |
Correct |
426 ms |
22904 KB |
Output is correct |
9 |
Correct |
439 ms |
40460 KB |
Output is correct |
10 |
Correct |
218 ms |
46236 KB |
Output is correct |