This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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=1e6+9;
vector<char> X;
int ind,tot,arr[MAX],height[MAX],Parent[MAX][22];
void Init()
{
}
void TypeLetter(char L)
{
X.pb(L);
Parent[++ind][0]=arr[tot++];
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;
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-1];
}
/*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 |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |