#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
break;
}
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 = 0; k != 0 && i < 20; i++) {
if (k & 1)
tmp = tmp->par[i];
k /= 2;
}
return tmp->c;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
3 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
384 KB |
Output is correct |
9 |
Correct |
3 ms |
384 KB |
Output is correct |
10 |
Correct |
3 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
3 ms |
256 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 |
256 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Correct |
5 ms |
640 KB |
Output is correct |
3 |
Correct |
4 ms |
640 KB |
Output is correct |
4 |
Correct |
4 ms |
896 KB |
Output is correct |
5 |
Correct |
4 ms |
640 KB |
Output is correct |
6 |
Correct |
6 ms |
1024 KB |
Output is correct |
7 |
Correct |
5 ms |
1024 KB |
Output is correct |
8 |
Correct |
4 ms |
896 KB |
Output is correct |
9 |
Correct |
4 ms |
896 KB |
Output is correct |
10 |
Correct |
4 ms |
640 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
848 ms |
105884 KB |
Output is correct |
2 |
Correct |
966 ms |
116988 KB |
Output is correct |
3 |
Correct |
578 ms |
114588 KB |
Output is correct |
4 |
Correct |
548 ms |
91128 KB |
Output is correct |
5 |
Correct |
701 ms |
99756 KB |
Output is correct |
6 |
Correct |
753 ms |
126840 KB |
Output is correct |
7 |
Correct |
689 ms |
60924 KB |
Output is correct |
8 |
Correct |
766 ms |
93080 KB |
Output is correct |
9 |
Correct |
934 ms |
129252 KB |
Output is correct |
10 |
Correct |
274 ms |
98812 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
867 ms |
90100 KB |
Output is correct |
2 |
Correct |
883 ms |
78856 KB |
Output is correct |
3 |
Correct |
502 ms |
92556 KB |
Output is correct |
4 |
Correct |
477 ms |
70904 KB |
Output is correct |
5 |
Correct |
700 ms |
100576 KB |
Output is correct |
6 |
Correct |
597 ms |
94840 KB |
Output is correct |
7 |
Correct |
543 ms |
101060 KB |
Output is correct |
8 |
Correct |
760 ms |
51036 KB |
Output is correct |
9 |
Correct |
933 ms |
86940 KB |
Output is correct |
10 |
Correct |
265 ms |
98036 KB |
Output is correct |