#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
char last;
pair<int,int> A[1010101];
int te,X;
int p[22][1000001];
int LO[1000005],ii;
/*void cek()
{
ll ii;
for(ii=0;ii<te;ii++)
cout<<ii<<" "<<char(A[ii].fi)<<" "<<A[ii].se<<"\n";
cout<<"\n";
}*/
void Init()
{
for(ii=1;ii<=1000002;ii++)
LO[ii]=ceil(log(ii)/log(2));
}
void TypeLetter(char L)
{
if(te==0)
A[te]=mp(L,0);
else
A[te]=mp(L,A[te-1].se+1);
if(te==0)
p[0][te]=0;
else
p[0][te]=te-1;
for(ii=1;ii<20;ii++)
p[ii][te]=p[ii-1][p[ii-1][te]];
te++;
}
void UndoCommands(int U)
{
A[te]=A[te-U-1];
p[0][te]=p[0][te-U-1];
for(ii=1;ii<20;ii++)
p[ii][te]=p[ii-1][p[ii-1][te]];
te++;
// cek();
}
char GetLetter(int P)
{
X=te-1;
for(ii=19;ii>=0;ii--)
if(A[p[ii][X]].se>=P)
X=p[ii][X];
return char(A[X].fi);
// return hai[P];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
4344 KB |
Output is correct |
2 |
Correct |
35 ms |
4472 KB |
Output is correct |
3 |
Correct |
33 ms |
4472 KB |
Output is correct |
4 |
Correct |
31 ms |
4472 KB |
Output is correct |
5 |
Correct |
34 ms |
4472 KB |
Output is correct |
6 |
Correct |
32 ms |
4472 KB |
Output is correct |
7 |
Correct |
33 ms |
4420 KB |
Output is correct |
8 |
Correct |
31 ms |
4344 KB |
Output is correct |
9 |
Correct |
32 ms |
4472 KB |
Output is correct |
10 |
Correct |
42 ms |
4344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
4344 KB |
Output is correct |
2 |
Correct |
30 ms |
4344 KB |
Output is correct |
3 |
Correct |
34 ms |
4364 KB |
Output is correct |
4 |
Correct |
32 ms |
4448 KB |
Output is correct |
5 |
Correct |
31 ms |
4344 KB |
Output is correct |
6 |
Correct |
31 ms |
4472 KB |
Output is correct |
7 |
Correct |
44 ms |
4344 KB |
Output is correct |
8 |
Correct |
44 ms |
4472 KB |
Output is correct |
9 |
Correct |
31 ms |
4344 KB |
Output is correct |
10 |
Correct |
36 ms |
4344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
31 ms |
4596 KB |
Output is correct |
2 |
Correct |
33 ms |
4700 KB |
Output is correct |
3 |
Correct |
29 ms |
4736 KB |
Output is correct |
4 |
Correct |
32 ms |
4856 KB |
Output is correct |
5 |
Correct |
32 ms |
4728 KB |
Output is correct |
6 |
Correct |
32 ms |
4856 KB |
Output is correct |
7 |
Correct |
31 ms |
4736 KB |
Output is correct |
8 |
Correct |
31 ms |
4728 KB |
Output is correct |
9 |
Correct |
31 ms |
4856 KB |
Output is correct |
10 |
Correct |
32 ms |
4864 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
487 ms |
66080 KB |
Output is correct |
2 |
Correct |
482 ms |
79736 KB |
Output is correct |
3 |
Correct |
399 ms |
79180 KB |
Output is correct |
4 |
Correct |
455 ms |
82652 KB |
Output is correct |
5 |
Correct |
610 ms |
73528 KB |
Output is correct |
6 |
Correct |
474 ms |
86312 KB |
Output is correct |
7 |
Execution timed out |
1091 ms |
74360 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1071 ms |
56928 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |