#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;
char last;
char X[MAX];
int ind,size[MAX],par[MAX],Parent[MAX][21];
void Init()
{
}
int get(int u)
{
if(par[u]==u or (X[u]>='a' and X[u]<='z'))
return u;
return par[u]=get(par[u]);
}
void TypeLetter(char L)
{
++ind;
X[ind]=L;
par[ind]=get(ind-1);
size[ind]=size[par[ind]]+1;
Parent[ind][0]=par[ind];
for(int A=1;A<21;A++)
Parent[ind][A]=Parent[Parent[ind][A-1]][A-1];
return ;
}
void UndoCommands(int U)
{
++ind;
par[ind]=get(ind-U-1);
size[ind]=size[par[ind]];
Parent[ind][0]=par[ind];
for(int A=1;A<21;A++)
Parent[ind][A]=Parent[Parent[ind][A-1]][A-1];
return ;
}
char GetLetter(int P)
{
P++;
int cur=ind;
for(int A=20;A>=0;A--)
{
if(size[Parent[cur][A]]>=P)
cur=Parent[cur][A];
}
return X[cur];
}
/*signed main()
{
ios_base::sync_with_stdio(false);
TypeLetter('a');
TypeLetter('b');
TypeLetter('d');
UndoCommands(2);
UndoCommands(1);
cout<<GetLetter(2);
//cout<<ind<<" "<<par[ind]<<"\n";
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 |
2 ms |
520 KB |
Output is correct |
4 |
Correct |
3 ms |
600 KB |
Output is correct |
5 |
Correct |
3 ms |
644 KB |
Output is correct |
6 |
Correct |
2 ms |
644 KB |
Output is correct |
7 |
Correct |
2 ms |
644 KB |
Output is correct |
8 |
Correct |
3 ms |
644 KB |
Output is correct |
9 |
Correct |
2 ms |
644 KB |
Output is correct |
10 |
Correct |
3 ms |
644 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
644 KB |
Output is correct |
2 |
Correct |
2 ms |
644 KB |
Output is correct |
3 |
Correct |
4 ms |
644 KB |
Output is correct |
4 |
Correct |
2 ms |
644 KB |
Output is correct |
5 |
Correct |
2 ms |
644 KB |
Output is correct |
6 |
Correct |
2 ms |
644 KB |
Output is correct |
7 |
Correct |
2 ms |
644 KB |
Output is correct |
8 |
Correct |
3 ms |
644 KB |
Output is correct |
9 |
Correct |
3 ms |
644 KB |
Output is correct |
10 |
Correct |
2 ms |
644 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
700 KB |
Output is correct |
2 |
Correct |
5 ms |
828 KB |
Output is correct |
3 |
Correct |
5 ms |
956 KB |
Output is correct |
4 |
Correct |
5 ms |
956 KB |
Output is correct |
5 |
Correct |
4 ms |
956 KB |
Output is correct |
6 |
Correct |
5 ms |
1004 KB |
Output is correct |
7 |
Correct |
5 ms |
1004 KB |
Output is correct |
8 |
Correct |
5 ms |
1004 KB |
Output is correct |
9 |
Correct |
7 ms |
1004 KB |
Output is correct |
10 |
Correct |
5 ms |
1068 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1029 ms |
66412 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1075 ms |
66412 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |