#include <string>
struct String{
int len;
char last;
int prev;
String():last('\0'),prev(-1){
}
}str[1000001];
int curr=0;
void Init() {}
void TypeLetter(char L) {
str[curr+1].len=str[curr].len+1;
str[curr+1].last=L;
str[curr+1].prev=curr;
curr++;
}
void UndoCommands(int U) {
str[curr+1]=str[curr-U];
curr++;
}
char GetLetter(int P) {
int move=str[curr].len-1-P;
int x=curr;
while(move--){
x=str[x].prev;
}
return str[x].last;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
12024 KB |
Output is correct |
2 |
Correct |
12 ms |
12024 KB |
Output is correct |
3 |
Correct |
11 ms |
12024 KB |
Output is correct |
4 |
Correct |
11 ms |
12024 KB |
Output is correct |
5 |
Correct |
11 ms |
12024 KB |
Output is correct |
6 |
Correct |
11 ms |
12028 KB |
Output is correct |
7 |
Correct |
12 ms |
12024 KB |
Output is correct |
8 |
Correct |
11 ms |
12024 KB |
Output is correct |
9 |
Correct |
11 ms |
12024 KB |
Output is correct |
10 |
Correct |
12 ms |
12024 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
12024 KB |
Output is correct |
2 |
Correct |
11 ms |
12024 KB |
Output is correct |
3 |
Correct |
11 ms |
12024 KB |
Output is correct |
4 |
Correct |
13 ms |
12024 KB |
Output is correct |
5 |
Correct |
11 ms |
12024 KB |
Output is correct |
6 |
Correct |
14 ms |
12024 KB |
Output is correct |
7 |
Correct |
11 ms |
12024 KB |
Output is correct |
8 |
Correct |
11 ms |
12024 KB |
Output is correct |
9 |
Correct |
12 ms |
12024 KB |
Output is correct |
10 |
Correct |
11 ms |
12024 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
12024 KB |
Output is correct |
2 |
Correct |
15 ms |
12024 KB |
Output is correct |
3 |
Correct |
12 ms |
12024 KB |
Output is correct |
4 |
Correct |
15 ms |
12024 KB |
Output is correct |
5 |
Correct |
12 ms |
12040 KB |
Output is correct |
6 |
Correct |
12 ms |
12028 KB |
Output is correct |
7 |
Correct |
13 ms |
12024 KB |
Output is correct |
8 |
Correct |
15 ms |
12028 KB |
Output is correct |
9 |
Correct |
13 ms |
12024 KB |
Output is correct |
10 |
Correct |
12 ms |
12024 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1063 ms |
15344 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1071 ms |
13316 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |