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