#include <bits/stdc++.h>
using namespace std;
const int MAXN=1e6+3;
const int LOGN=22;
int cont[MAXN];
char letra[MAXN];
int dp[LOGN+2][MAXN];
int contv=0;
void update(int cur) {
int aux=dp[0][cur];
for(int i=1; i<=LOGN; i++) {
dp[i][cur]=dp[i-1][aux];
aux=dp[i][cur];
}
}
void Init() {}
void TypeLetter(char cur) {
contv++; int pai=contv-1;
if(pai==0) pai=contv;
letra[contv]=cur;
cont[contv]=cont[pai]+1;
dp[0][contv]=pai;
update(contv);
}
void UndoCommands(int val) {
contv++; int pai=contv-1-val;
if(pai==0) pai=contv;
cont[contv]=cont[pai];
dp[0][contv]=pai;
update(contv);
}
char GetLetter(int ind) {
int cur=contv;
int aux=cur;
for(int i=LOGN; i>=0; i--) {
if(cont[dp[i][aux]]>ind) {
aux=dp[i][aux];
}
}
return letra[aux];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
2 ms |
512 KB |
Output is correct |
8 |
Correct |
2 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Correct |
3 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
3 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
3 ms |
512 KB |
Output is correct |
8 |
Correct |
2 ms |
512 KB |
Output is correct |
9 |
Correct |
3 ms |
512 KB |
Output is correct |
10 |
Correct |
2 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
640 KB |
Output is correct |
2 |
Correct |
4 ms |
768 KB |
Output is correct |
3 |
Correct |
5 ms |
896 KB |
Output is correct |
4 |
Correct |
4 ms |
896 KB |
Output is correct |
5 |
Correct |
4 ms |
896 KB |
Output is correct |
6 |
Correct |
4 ms |
1024 KB |
Output is correct |
7 |
Correct |
4 ms |
896 KB |
Output is correct |
8 |
Correct |
5 ms |
1024 KB |
Output is correct |
9 |
Correct |
4 ms |
1024 KB |
Output is correct |
10 |
Correct |
6 ms |
1024 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
576 ms |
68632 KB |
Output is correct |
2 |
Correct |
615 ms |
83448 KB |
Output is correct |
3 |
Correct |
532 ms |
82896 KB |
Output is correct |
4 |
Correct |
591 ms |
86904 KB |
Output is correct |
5 |
Correct |
750 ms |
76764 KB |
Output is correct |
6 |
Correct |
515 ms |
90476 KB |
Output is correct |
7 |
Execution timed out |
1072 ms |
77216 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1073 ms |
62384 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |