#include <bits/stdc++.h>
using namespace std;
char s[1000001];
int now = 0, i = 1, dir[1000001][21], sz[1000001];
void Init() {}
int find(int i, int x){
if(sz[i] == x){
return i;
}
int j = 0;
while(sz[i] - (1 << j) >= x)j++;
j--;
return find(dir[i][j], x);
}
void TypeLetter(char L) {
s[i] = L;
dir[i][0] = now;
sz[i] = sz[now] + 1;
for(int j = 0; j < 21; j++){
if(sz[i] <= (1 << j)) break;
dir[i][j] = find(now, sz[i] - (1 << j));
}
now = i;
i++;
}
void UndoCommands(int U) {
now = i - U - 1;
s[i] = s[now];
for(int j = 0; j <= 20; j++)dir[i][j] = dir[now][j];
sz[i] = sz[now];
i++;
}
char GetLetter(int P) {
return s[find(i - 1, P + 1)];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
248 KB |
Output is correct |
2 |
Correct |
3 ms |
356 KB |
Output is correct |
3 |
Correct |
3 ms |
396 KB |
Output is correct |
4 |
Correct |
3 ms |
532 KB |
Output is correct |
5 |
Correct |
3 ms |
612 KB |
Output is correct |
6 |
Correct |
2 ms |
612 KB |
Output is correct |
7 |
Correct |
3 ms |
612 KB |
Output is correct |
8 |
Correct |
3 ms |
612 KB |
Output is correct |
9 |
Correct |
4 ms |
612 KB |
Output is correct |
10 |
Correct |
3 ms |
612 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
612 KB |
Output is correct |
2 |
Correct |
3 ms |
612 KB |
Output is correct |
3 |
Correct |
3 ms |
612 KB |
Output is correct |
4 |
Correct |
3 ms |
612 KB |
Output is correct |
5 |
Correct |
3 ms |
612 KB |
Output is correct |
6 |
Correct |
3 ms |
612 KB |
Output is correct |
7 |
Correct |
2 ms |
612 KB |
Output is correct |
8 |
Correct |
3 ms |
616 KB |
Output is correct |
9 |
Correct |
3 ms |
664 KB |
Output is correct |
10 |
Correct |
3 ms |
800 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
820 KB |
Output is correct |
2 |
Correct |
7 ms |
948 KB |
Output is correct |
3 |
Correct |
4 ms |
1100 KB |
Output is correct |
4 |
Correct |
6 ms |
1128 KB |
Output is correct |
5 |
Correct |
5 ms |
1128 KB |
Output is correct |
6 |
Correct |
8 ms |
1156 KB |
Output is correct |
7 |
Correct |
6 ms |
1204 KB |
Output is correct |
8 |
Correct |
5 ms |
1232 KB |
Output is correct |
9 |
Correct |
6 ms |
1252 KB |
Output is correct |
10 |
Correct |
6 ms |
1276 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1069 ms |
20620 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1070 ms |
21744 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |