#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define MEM(i,j) memset(i,j,sizeof i)
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(),v.end()
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
char letter[1000005];
int Len[1000005],pa[20][1000005],ti[1000005],lg=19,t;
void Init(){
t=0,Len[0]=-1;
}
int finds(int x)
{
if(ti[x]==x) return x;
return ti[x]=finds(ti[x]);
}
void TypeLetter(char L)
{
++t,ti[t]=t,Len[t]=Len[finds(t-1)]+1,letter[t]=L;
pa[0][t]=finds(t-1);
for(int i=1;i<=lg;++i)
pa[i][t]=pa[i-1][pa[i-1][t]];
}
void UndoCommands(int U)
{
++t,ti[t]=finds(t-U-1),Len[t]=Len[finds(t-U-1)];
}
char GetLetter(int P)
{
int x=finds(t);
for(int i=__lg(t);i>=0;--i)
if(Len[pa[i][x]]>=P)
x=pa[i][x];
if(Len[pa[0][x]]>=P)
x=pa[0][x];
return letter[x];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
4 |
Correct |
2 ms |
484 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
2 ms |
512 KB |
Output is correct |
8 |
Correct |
3 ms |
512 KB |
Output is correct |
9 |
Correct |
4 ms |
512 KB |
Output is correct |
10 |
Correct |
2 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
2 ms |
512 KB |
Output is correct |
8 |
Correct |
3 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Correct |
3 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
640 KB |
Output is correct |
2 |
Correct |
4 ms |
768 KB |
Output is correct |
3 |
Correct |
4 ms |
896 KB |
Output is correct |
4 |
Correct |
4 ms |
896 KB |
Output is correct |
5 |
Correct |
4 ms |
896 KB |
Output is correct |
6 |
Correct |
4 ms |
896 KB |
Output is correct |
7 |
Correct |
3 ms |
896 KB |
Output is correct |
8 |
Correct |
3 ms |
896 KB |
Output is correct |
9 |
Correct |
4 ms |
896 KB |
Output is correct |
10 |
Correct |
3 ms |
896 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
429 ms |
62840 KB |
Output is correct |
2 |
Correct |
465 ms |
76552 KB |
Output is correct |
3 |
Correct |
392 ms |
76152 KB |
Output is correct |
4 |
Correct |
452 ms |
79648 KB |
Output is correct |
5 |
Correct |
666 ms |
70512 KB |
Output is correct |
6 |
Correct |
377 ms |
83064 KB |
Output is correct |
7 |
Correct |
675 ms |
71048 KB |
Output is correct |
8 |
Correct |
538 ms |
80120 KB |
Output is correct |
9 |
Correct |
554 ms |
76992 KB |
Output is correct |
10 |
Correct |
237 ms |
86776 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
834 ms |
57720 KB |
Output is correct |
2 |
Execution timed out |
1069 ms |
49536 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |