#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define itr ::iterator
typedef pair<int,int> pii;
const int MAX=3e6;
char last;
char X[MAX];
int ind,cur,tot,arr[MAX],height[MAX],Parent[MAX][21];
void Init()
{
}
void TypeLetter(char L)
{
++ind;
++tot;
X[ind]=L;
Parent[ind][0]=arr[tot-1];
height[ind]=height[Parent[ind][0]]+1;
for(int A=1;A<21;A++)
Parent[ind][A]=Parent[Parent[ind][A-1]][A-1];
arr[tot]=ind;
cur=ind;
return ;
}
void UndoCommands(int U)
{
++tot;
arr[tot]=arr[tot-U-1];
return ;
}
char GetLetter(int P)
{
P++;
int res=arr[tot];
for(int A=20;A>=0;A--)
{
if(height[Parent[res][A]]>=P)
res=Parent[res][A];
}
//cout<<cur<<" "<<res<<" "<<height[res]<<"\n";
return X[res];
}
/*signed main()
{
ios_base::sync_with_stdio(false);
TypeLetter('a');
TypeLetter('b');
TypeLetter('d');
UndoCommands(2);
UndoCommands(1);
cout<<GetLetter(2);
return 0;
}*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
420 KB |
Output is correct |
4 |
Correct |
3 ms |
472 KB |
Output is correct |
5 |
Correct |
4 ms |
476 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
3 ms |
668 KB |
Output is correct |
8 |
Correct |
3 ms |
668 KB |
Output is correct |
9 |
Correct |
4 ms |
668 KB |
Output is correct |
10 |
Correct |
3 ms |
712 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
712 KB |
Output is correct |
2 |
Correct |
2 ms |
764 KB |
Output is correct |
3 |
Correct |
2 ms |
788 KB |
Output is correct |
4 |
Correct |
3 ms |
788 KB |
Output is correct |
5 |
Correct |
3 ms |
788 KB |
Output is correct |
6 |
Correct |
3 ms |
788 KB |
Output is correct |
7 |
Correct |
2 ms |
788 KB |
Output is correct |
8 |
Correct |
3 ms |
812 KB |
Output is correct |
9 |
Correct |
3 ms |
812 KB |
Output is correct |
10 |
Correct |
3 ms |
812 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
836 KB |
Output is correct |
2 |
Correct |
32 ms |
848 KB |
Output is correct |
3 |
Correct |
5 ms |
896 KB |
Output is correct |
4 |
Correct |
5 ms |
1028 KB |
Output is correct |
5 |
Correct |
4 ms |
1028 KB |
Output is correct |
6 |
Correct |
5 ms |
1212 KB |
Output is correct |
7 |
Correct |
6 ms |
1232 KB |
Output is correct |
8 |
Correct |
6 ms |
1232 KB |
Output is correct |
9 |
Correct |
6 ms |
1280 KB |
Output is correct |
10 |
Correct |
4 ms |
1280 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
981 ms |
58068 KB |
Output is correct |
2 |
Correct |
919 ms |
64000 KB |
Output is correct |
3 |
Correct |
576 ms |
64000 KB |
Output is correct |
4 |
Correct |
572 ms |
64000 KB |
Output is correct |
5 |
Correct |
827 ms |
64000 KB |
Output is correct |
6 |
Correct |
524 ms |
68956 KB |
Output is correct |
7 |
Correct |
760 ms |
68956 KB |
Output is correct |
8 |
Correct |
636 ms |
68956 KB |
Output is correct |
9 |
Correct |
976 ms |
81632 KB |
Output is correct |
10 |
Correct |
256 ms |
81632 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1081 ms |
81632 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |