char c[1000010];
int a[1000010],lev[1000010],st[20][1000010],t;
void Init(){}
void TypeLetter(char L){
int i;
c[a[++t]=t]=L;
lev[t]=lev[st[0][t]=a[t-1]]+1;
for(i=1;i<20;++i)st[i][t]=st[i-1][st[i-1][t]];
}
void UndoCommands(int U){a[++t]=a[t-U-1];}
char GetLetter(int P){
int i,x=a[t];
for(i=20;i--;)if(lev[st[i][x]]>P)x=st[i][x];
return c[x];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
87988 KB |
Output is correct |
2 |
Correct |
0 ms |
87988 KB |
Output is correct |
3 |
Correct |
0 ms |
87988 KB |
Output is correct |
4 |
Correct |
0 ms |
87988 KB |
Output is correct |
5 |
Correct |
0 ms |
87988 KB |
Output is correct |
6 |
Correct |
0 ms |
87988 KB |
Output is correct |
7 |
Correct |
0 ms |
87988 KB |
Output is correct |
8 |
Correct |
0 ms |
87988 KB |
Output is correct |
9 |
Correct |
0 ms |
87988 KB |
Output is correct |
10 |
Correct |
0 ms |
87988 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
87988 KB |
Output is correct |
2 |
Correct |
0 ms |
87988 KB |
Output is correct |
3 |
Correct |
0 ms |
87988 KB |
Output is correct |
4 |
Correct |
0 ms |
87988 KB |
Output is correct |
5 |
Correct |
0 ms |
87988 KB |
Output is correct |
6 |
Correct |
0 ms |
87988 KB |
Output is correct |
7 |
Correct |
0 ms |
87988 KB |
Output is correct |
8 |
Correct |
0 ms |
87988 KB |
Output is correct |
9 |
Correct |
0 ms |
87988 KB |
Output is correct |
10 |
Correct |
0 ms |
87988 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
87988 KB |
Output is correct |
2 |
Correct |
0 ms |
87988 KB |
Output is correct |
3 |
Correct |
0 ms |
87988 KB |
Output is correct |
4 |
Correct |
0 ms |
87988 KB |
Output is correct |
5 |
Correct |
0 ms |
87988 KB |
Output is correct |
6 |
Correct |
0 ms |
87988 KB |
Output is correct |
7 |
Correct |
4 ms |
87988 KB |
Output is correct |
8 |
Correct |
4 ms |
87988 KB |
Output is correct |
9 |
Correct |
0 ms |
87988 KB |
Output is correct |
10 |
Correct |
0 ms |
87988 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
320 ms |
87988 KB |
Output is correct |
2 |
Correct |
327 ms |
87988 KB |
Output is correct |
3 |
Correct |
315 ms |
87988 KB |
Output is correct |
4 |
Correct |
351 ms |
87988 KB |
Output is correct |
5 |
Correct |
430 ms |
87988 KB |
Output is correct |
6 |
Correct |
263 ms |
87988 KB |
Output is correct |
7 |
Correct |
457 ms |
87988 KB |
Output is correct |
8 |
Correct |
340 ms |
87988 KB |
Output is correct |
9 |
Correct |
373 ms |
87988 KB |
Output is correct |
10 |
Correct |
209 ms |
87988 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
588 ms |
87988 KB |
Output is correct |
2 |
Correct |
756 ms |
87988 KB |
Output is correct |
3 |
Correct |
424 ms |
87988 KB |
Output is correct |
4 |
Correct |
560 ms |
87988 KB |
Output is correct |
5 |
Correct |
355 ms |
87988 KB |
Output is correct |
6 |
Correct |
363 ms |
87988 KB |
Output is correct |
7 |
Correct |
376 ms |
87988 KB |
Output is correct |
8 |
Correct |
772 ms |
87988 KB |
Output is correct |
9 |
Correct |
774 ms |
87988 KB |
Output is correct |
10 |
Correct |
220 ms |
87988 KB |
Output is correct |