#include <bits/stdc++.h>
using namespace std;
const int N=1e6+55;
int trie[N*2][26];
char letter[N];
int p[N][22];
int a[N];
int l[N];
int node;
int cnt=1;
int k=0;
void Init()
{
node=cnt++;
memset(trie,-1,sizeof trie);
}
int c,temp,nd;
void TypeLetter(char L)
{
c=L-'a';
temp=node;
if(trie[node][c]==-1)
trie[node][c]=cnt++;
node=trie[node][c];
letter[node]=L;
a[k]=node;
if(k!=0)
l[k]=l[k-1]+1;
else
l[k]=1;
if(p[node][0]==0)
{
p[node][0]=temp;
for(int i=1;i<21;i++)
{
p[node][i]=p[p[node][i-1]][i-1];
if(p[node][i]==0)
break;
}
}
k++;
}
void UndoCommands(int U)
{
node=a[k-U-1];
l[k]=l[k-U-1];
a[k]=node;
k++;
}
char GetLetter(int P)
{
P=l[k-1]-P-1;
nd=node;
for(int i=20;i>=0;i--)
{
if((P&(1<<i)))
nd=p[nd][i];
}
return letter[nd];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
188 ms |
203848 KB |
Output is correct |
2 |
Correct |
159 ms |
204012 KB |
Output is correct |
3 |
Correct |
153 ms |
204204 KB |
Output is correct |
4 |
Correct |
188 ms |
204204 KB |
Output is correct |
5 |
Correct |
173 ms |
204204 KB |
Output is correct |
6 |
Correct |
187 ms |
204240 KB |
Output is correct |
7 |
Correct |
169 ms |
204240 KB |
Output is correct |
8 |
Correct |
173 ms |
204240 KB |
Output is correct |
9 |
Correct |
170 ms |
204240 KB |
Output is correct |
10 |
Correct |
165 ms |
204240 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
170 ms |
204296 KB |
Output is correct |
2 |
Correct |
170 ms |
204332 KB |
Output is correct |
3 |
Correct |
156 ms |
204332 KB |
Output is correct |
4 |
Correct |
180 ms |
204332 KB |
Output is correct |
5 |
Correct |
186 ms |
204332 KB |
Output is correct |
6 |
Correct |
163 ms |
204332 KB |
Output is correct |
7 |
Correct |
182 ms |
204332 KB |
Output is correct |
8 |
Correct |
170 ms |
204332 KB |
Output is correct |
9 |
Correct |
173 ms |
204332 KB |
Output is correct |
10 |
Correct |
172 ms |
204332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
176 ms |
204368 KB |
Output is correct |
2 |
Correct |
179 ms |
204448 KB |
Output is correct |
3 |
Correct |
179 ms |
204544 KB |
Output is correct |
4 |
Correct |
198 ms |
204572 KB |
Output is correct |
5 |
Correct |
181 ms |
204596 KB |
Output is correct |
6 |
Correct |
171 ms |
204784 KB |
Output is correct |
7 |
Correct |
156 ms |
204784 KB |
Output is correct |
8 |
Correct |
156 ms |
204784 KB |
Output is correct |
9 |
Correct |
151 ms |
204784 KB |
Output is correct |
10 |
Correct |
155 ms |
204784 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1042 ms |
263168 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1080 ms |
263168 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |