int const nmax = 1000000;
char last;
int far[1 + nmax][20], ptr = 0;
int level[1 + nmax];
char chr[1 + nmax];
void Init() {}
void TypeLetter(char L) {
++ptr;
far[ptr][0] = ptr - 1;
for(int h = 1; h < 20; h++)
far[ptr][h] = far[far[ptr][h - 1]][h - 1];
level[ptr] = level[far[ptr][0]] + 1;
chr[ptr] = L;
}
void UndoCommands(int U) {
++ptr;
far[ptr][0] = ptr - 1 - U;
for(int h = 1; h < 20; h++)
far[ptr][h] = far[far[ptr][h - 1]][h - 1];
level[ptr] = level[far[ptr][0]];
}
char GetLetter(int P) {
int pos = ptr;
P++;
for(int h = 19; 0 <= h; h--)
if(P <= level[far[pos][h]] )
pos = far[pos][h];
return chr[pos];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
380 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
252 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
252 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
508 KB |
Output is correct |
2 |
Correct |
3 ms |
504 KB |
Output is correct |
3 |
Correct |
3 ms |
632 KB |
Output is correct |
4 |
Correct |
3 ms |
760 KB |
Output is correct |
5 |
Correct |
3 ms |
632 KB |
Output is correct |
6 |
Correct |
3 ms |
760 KB |
Output is correct |
7 |
Correct |
3 ms |
632 KB |
Output is correct |
8 |
Correct |
3 ms |
760 KB |
Output is correct |
9 |
Correct |
4 ms |
760 KB |
Output is correct |
10 |
Correct |
3 ms |
760 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
583 ms |
60056 KB |
Output is correct |
2 |
Correct |
667 ms |
73160 KB |
Output is correct |
3 |
Correct |
525 ms |
72456 KB |
Output is correct |
4 |
Correct |
598 ms |
76124 KB |
Output is correct |
5 |
Correct |
591 ms |
67320 KB |
Output is correct |
6 |
Correct |
398 ms |
79224 KB |
Output is correct |
7 |
Execution timed out |
1061 ms |
67704 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
725 ms |
54944 KB |
Output is correct |
2 |
Correct |
865 ms |
47608 KB |
Output is correct |
3 |
Correct |
522 ms |
60492 KB |
Output is correct |
4 |
Correct |
585 ms |
52600 KB |
Output is correct |
5 |
Correct |
683 ms |
70588 KB |
Output is correct |
6 |
Correct |
660 ms |
72824 KB |
Output is correct |
7 |
Correct |
669 ms |
72952 KB |
Output is correct |
8 |
Execution timed out |
1091 ms |
52984 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |