#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;
vector<vector<pair<int,char>>> v(1000005,vector<pair<int,char>>());
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,v[Len[t]].pb(MP(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];
auto p=lower_bound(ALL(v[P]),MP(x,'a'));
return p->S;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
23936 KB |
Output is correct |
2 |
Correct |
22 ms |
24064 KB |
Output is correct |
3 |
Correct |
21 ms |
23928 KB |
Output is correct |
4 |
Correct |
23 ms |
24064 KB |
Output is correct |
5 |
Correct |
22 ms |
24036 KB |
Output is correct |
6 |
Correct |
23 ms |
24064 KB |
Output is correct |
7 |
Correct |
22 ms |
23936 KB |
Output is correct |
8 |
Correct |
23 ms |
23936 KB |
Output is correct |
9 |
Correct |
22 ms |
24064 KB |
Output is correct |
10 |
Correct |
22 ms |
24064 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
23 ms |
24048 KB |
Output is correct |
2 |
Correct |
23 ms |
23936 KB |
Output is correct |
3 |
Correct |
22 ms |
23936 KB |
Output is correct |
4 |
Correct |
23 ms |
23928 KB |
Output is correct |
5 |
Correct |
22 ms |
23928 KB |
Output is correct |
6 |
Correct |
22 ms |
23936 KB |
Output is correct |
7 |
Correct |
22 ms |
23932 KB |
Output is correct |
8 |
Correct |
22 ms |
23936 KB |
Output is correct |
9 |
Correct |
23 ms |
24064 KB |
Output is correct |
10 |
Correct |
22 ms |
23936 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
24192 KB |
Output is correct |
2 |
Correct |
24 ms |
24320 KB |
Output is correct |
3 |
Correct |
24 ms |
24320 KB |
Output is correct |
4 |
Correct |
26 ms |
24448 KB |
Output is correct |
5 |
Correct |
25 ms |
24312 KB |
Output is correct |
6 |
Correct |
23 ms |
24440 KB |
Output is correct |
7 |
Correct |
31 ms |
24448 KB |
Output is correct |
8 |
Correct |
25 ms |
24488 KB |
Output is correct |
9 |
Correct |
25 ms |
24448 KB |
Output is correct |
10 |
Correct |
25 ms |
24448 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
527 ms |
95848 KB |
Output is correct |
2 |
Correct |
579 ms |
110476 KB |
Output is correct |
3 |
Correct |
484 ms |
106068 KB |
Output is correct |
4 |
Correct |
511 ms |
107724 KB |
Output is correct |
5 |
Correct |
661 ms |
100904 KB |
Output is correct |
6 |
Correct |
504 ms |
119288 KB |
Output is correct |
7 |
Correct |
749 ms |
103456 KB |
Output is correct |
8 |
Correct |
741 ms |
118108 KB |
Output is correct |
9 |
Correct |
600 ms |
112448 KB |
Output is correct |
10 |
Correct |
269 ms |
113964 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
974 ms |
89080 KB |
Output is correct |
2 |
Execution timed out |
1081 ms |
80088 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |