int ops[1000005], prev[1000005], size[1000005], sz;
void Init(){
}
void TypeLetter(char L){
ops[sz] = L;
if(sz) size[sz] = size[prev[sz]]+1;
else size[sz] = 1;
sz++;
prev[sz] = sz-1;
}
void UndoCommands(int U){
prev[sz] = sz-U-1;
size[sz] = size[prev[sz]];
sz++;
prev[sz] = sz-1;
}
char GetLetter(int P){
int i = prev[sz];
int piv = size[i] - P - 1;
while (piv) {
while(!ops[i]) i = prev[i];
i = prev[i];
piv--;
}
while (!ops[i]) i = prev[i];
return ops[i];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
12796 KB |
Output is correct |
2 |
Correct |
0 ms |
12796 KB |
Output is correct |
3 |
Correct |
0 ms |
12796 KB |
Output is correct |
4 |
Correct |
0 ms |
12796 KB |
Output is correct |
5 |
Correct |
0 ms |
12796 KB |
Output is correct |
6 |
Correct |
0 ms |
12796 KB |
Output is correct |
7 |
Correct |
0 ms |
12796 KB |
Output is correct |
8 |
Correct |
0 ms |
12796 KB |
Output is correct |
9 |
Correct |
0 ms |
12796 KB |
Output is correct |
10 |
Correct |
0 ms |
12796 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
12796 KB |
Output is correct |
2 |
Correct |
0 ms |
12796 KB |
Output is correct |
3 |
Correct |
0 ms |
12796 KB |
Output is correct |
4 |
Correct |
0 ms |
12796 KB |
Output is correct |
5 |
Correct |
0 ms |
12796 KB |
Output is correct |
6 |
Correct |
0 ms |
12796 KB |
Output is correct |
7 |
Correct |
0 ms |
12796 KB |
Output is correct |
8 |
Correct |
0 ms |
12796 KB |
Output is correct |
9 |
Correct |
0 ms |
12796 KB |
Output is correct |
10 |
Correct |
0 ms |
12796 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
12796 KB |
Output is correct |
2 |
Correct |
0 ms |
12796 KB |
Output is correct |
3 |
Correct |
0 ms |
12796 KB |
Output is correct |
4 |
Correct |
0 ms |
12796 KB |
Output is correct |
5 |
Correct |
0 ms |
12796 KB |
Output is correct |
6 |
Correct |
0 ms |
12796 KB |
Output is correct |
7 |
Correct |
0 ms |
12796 KB |
Output is correct |
8 |
Correct |
0 ms |
12796 KB |
Output is correct |
9 |
Correct |
0 ms |
12796 KB |
Output is correct |
10 |
Correct |
0 ms |
12796 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1000 ms |
12796 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1000 ms |
12796 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |