//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
//#include "grader.h"
using namespace std;
typedef long long int ll;
const int MAXN = 1e6 + 5;
struct node
{
node *par[20];
char c;
int len = 1;
};
node *arr[MAXN];
int cnt = -1;
node *add(char x, node *cur) {
node *ret = new node;
if (cur != NULL)
ret->len = cur->len + 1;
ret->c = x;
ret->par[0] = cur;
for (int i = 1; i < 20; i++) {
if (ret->par[i-1] != NULL)
ret->par[i] = ret->par[i - 1]->par[i - 1];
else
ret->par[i] = NULL;
}
return ret;
}
void Init() {
}
void TypeLetter(char c) {
cnt++;
if (cnt == 0)
arr[cnt] = add(c, NULL);
else
arr[cnt] = add(c, arr[cnt-1]);
}
void UndoCommands(int u) {
cnt++;
arr[cnt] = arr[cnt - u - 1];
}
char GetLetter(int k) {
node *tmp = arr[cnt];
k = tmp->len - k - 1;
for (int i = 19; i > -1; i--)
if ((k >> i) & 1)
tmp = tmp->par[i];
return tmp->c;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
3 ms |
384 KB |
Output is correct |
5 |
Correct |
3 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
3 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
3 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
612 KB |
Output is correct |
2 |
Correct |
5 ms |
640 KB |
Output is correct |
3 |
Correct |
4 ms |
640 KB |
Output is correct |
4 |
Correct |
5 ms |
896 KB |
Output is correct |
5 |
Correct |
5 ms |
640 KB |
Output is correct |
6 |
Correct |
5 ms |
1024 KB |
Output is correct |
7 |
Correct |
6 ms |
1152 KB |
Output is correct |
8 |
Correct |
5 ms |
896 KB |
Output is correct |
9 |
Correct |
4 ms |
896 KB |
Output is correct |
10 |
Correct |
4 ms |
640 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
933 ms |
109672 KB |
Output is correct |
2 |
Correct |
980 ms |
121040 KB |
Output is correct |
3 |
Correct |
619 ms |
119416 KB |
Output is correct |
4 |
Correct |
578 ms |
97272 KB |
Output is correct |
5 |
Correct |
758 ms |
104344 KB |
Output is correct |
6 |
Correct |
860 ms |
131104 KB |
Output is correct |
7 |
Correct |
794 ms |
66808 KB |
Output is correct |
8 |
Correct |
913 ms |
98424 KB |
Output is correct |
9 |
Execution timed out |
1059 ms |
133608 KB |
Time limit exceeded |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
943 ms |
94460 KB |
Output is correct |
2 |
Execution timed out |
1052 ms |
82992 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |