#include <bits/stdc++.h>
using namespace std;
const int mx = 1e6 + 5;
const int lg = 20;
int C[mx], I[mx];
char X[mx];
int p[mx][lg];
int n;
void show(int i){
printf("C : %d I : %d X : %c\n",C[i],I[i],X[C[i]]);
}
void Init() {
}
void TypeLetter(char L) {
++n;
I[n] = I[n-1] + 1;
C[n] = n;
X[n] = L;
p[n][0] = n - 1;
for(int j = 1; j < lg; j++){
p[n][j] = p[p[n][j-1]][j-1];
}
}
void UndoCommands(int U) {
++n;
if(U == n){
I[n] = 0;
C[n] = 0;
X[n] = 'U';
return;
}
I[n] = I[n - 1 - U];
C[n] = C[n - 1 - U];
p[n][0] = n - 1 - U;
for(int j = 1; j < lg; j++){
p[n][j] = p[p[n][j-1]][j-1];
}
}
char GetLetter(int P) {
++P;
int b = n;
for(int j = lg-1; j >= 0; j--){
if(I[b] == P) return X[C[b]];
if(I[p[b][j]] >= P) b = p[b][j];
}
return I[b] == P ? X[C[b]] : X[C[p[b][0]]];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
508 KB |
Output is correct |
3 |
Correct |
2 ms |
508 KB |
Output is correct |
4 |
Correct |
2 ms |
508 KB |
Output is correct |
5 |
Correct |
2 ms |
508 KB |
Output is correct |
6 |
Correct |
2 ms |
516 KB |
Output is correct |
7 |
Correct |
2 ms |
720 KB |
Output is correct |
8 |
Correct |
2 ms |
720 KB |
Output is correct |
9 |
Correct |
2 ms |
720 KB |
Output is correct |
10 |
Correct |
2 ms |
720 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
720 KB |
Output is correct |
2 |
Correct |
2 ms |
720 KB |
Output is correct |
3 |
Correct |
2 ms |
720 KB |
Output is correct |
4 |
Correct |
2 ms |
720 KB |
Output is correct |
5 |
Correct |
2 ms |
720 KB |
Output is correct |
6 |
Correct |
2 ms |
720 KB |
Output is correct |
7 |
Correct |
2 ms |
720 KB |
Output is correct |
8 |
Correct |
2 ms |
720 KB |
Output is correct |
9 |
Correct |
2 ms |
720 KB |
Output is correct |
10 |
Correct |
2 ms |
720 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
720 KB |
Output is correct |
2 |
Correct |
5 ms |
864 KB |
Output is correct |
3 |
Correct |
3 ms |
992 KB |
Output is correct |
4 |
Correct |
4 ms |
992 KB |
Output is correct |
5 |
Correct |
4 ms |
992 KB |
Output is correct |
6 |
Correct |
3 ms |
992 KB |
Output is correct |
7 |
Correct |
4 ms |
992 KB |
Output is correct |
8 |
Correct |
4 ms |
992 KB |
Output is correct |
9 |
Correct |
4 ms |
992 KB |
Output is correct |
10 |
Correct |
3 ms |
992 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
656 ms |
63000 KB |
Output is correct |
2 |
Correct |
722 ms |
76688 KB |
Output is correct |
3 |
Correct |
553 ms |
76688 KB |
Output is correct |
4 |
Correct |
627 ms |
80012 KB |
Output is correct |
5 |
Correct |
595 ms |
80012 KB |
Output is correct |
6 |
Correct |
432 ms |
83356 KB |
Output is correct |
7 |
Execution timed out |
1085 ms |
83356 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
834 ms |
83356 KB |
Output is correct |
2 |
Correct |
858 ms |
83356 KB |
Output is correct |
3 |
Correct |
511 ms |
83356 KB |
Output is correct |
4 |
Correct |
566 ms |
83356 KB |
Output is correct |
5 |
Correct |
544 ms |
83356 KB |
Output is correct |
6 |
Correct |
585 ms |
83356 KB |
Output is correct |
7 |
Correct |
580 ms |
83356 KB |
Output is correct |
8 |
Execution timed out |
1085 ms |
83356 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |