#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=1;
void Init()
{
node=cnt++;
}
int c,temp,nd;
void TypeLetter(char L)
{
c=L-'a';
temp=node;
if(!trie[node][c])
trie[node][c]=cnt++;
node=trie[node][c];
letter[node]=L;
a[k]=node;
l[k]=l[k-1]+1;
if(p[node][0]==0)
{
p[node][0]=temp;
for(int i=1;i<20;i++)
p[node][i]=p[p[node][i-1]][i-1];
}
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=19;i>=0;i--)
{
if(P&(1<<i))
nd=p[nd][i];
}
return letter[nd];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
392 KB |
Output is correct |
4 |
Correct |
3 ms |
392 KB |
Output is correct |
5 |
Correct |
3 ms |
468 KB |
Output is correct |
6 |
Correct |
3 ms |
468 KB |
Output is correct |
7 |
Correct |
2 ms |
468 KB |
Output is correct |
8 |
Correct |
3 ms |
596 KB |
Output is correct |
9 |
Correct |
2 ms |
596 KB |
Output is correct |
10 |
Correct |
4 ms |
596 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
596 KB |
Output is correct |
2 |
Correct |
3 ms |
596 KB |
Output is correct |
3 |
Correct |
2 ms |
596 KB |
Output is correct |
4 |
Correct |
2 ms |
612 KB |
Output is correct |
5 |
Correct |
3 ms |
612 KB |
Output is correct |
6 |
Correct |
2 ms |
612 KB |
Output is correct |
7 |
Correct |
2 ms |
612 KB |
Output is correct |
8 |
Correct |
2 ms |
612 KB |
Output is correct |
9 |
Correct |
2 ms |
612 KB |
Output is correct |
10 |
Correct |
3 ms |
612 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
868 KB |
Output is correct |
2 |
Correct |
5 ms |
868 KB |
Output is correct |
3 |
Correct |
3 ms |
868 KB |
Output is correct |
4 |
Correct |
3 ms |
1124 KB |
Output is correct |
5 |
Correct |
5 ms |
1124 KB |
Output is correct |
6 |
Correct |
6 ms |
1252 KB |
Output is correct |
7 |
Correct |
4 ms |
1256 KB |
Output is correct |
8 |
Correct |
4 ms |
1256 KB |
Output is correct |
9 |
Correct |
5 ms |
1256 KB |
Output is correct |
10 |
Correct |
4 ms |
1256 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
862 ms |
116896 KB |
Output is correct |
2 |
Correct |
922 ms |
128660 KB |
Output is correct |
3 |
Correct |
686 ms |
128660 KB |
Output is correct |
4 |
Correct |
471 ms |
128660 KB |
Output is correct |
5 |
Correct |
746 ms |
128660 KB |
Output is correct |
6 |
Correct |
786 ms |
138752 KB |
Output is correct |
7 |
Correct |
677 ms |
138752 KB |
Output is correct |
8 |
Correct |
724 ms |
138752 KB |
Output is correct |
9 |
Correct |
968 ms |
141888 KB |
Output is correct |
10 |
Correct |
352 ms |
141888 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
875 ms |
141888 KB |
Output is correct |
2 |
Execution timed out |
1032 ms |
141888 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |