#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;
pair<char,int> A[1000001];
int te,X;
int p[20][1000001],ii;
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);
p[0][te]=0;
}
else
{
A[te]=mp(L,A[te-1].se+1);
p[0][te]=te-1;
for(ii=1;ii<19;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<19;ii++)
p[ii][te]=p[ii-1][p[ii-1][te]];
te++;
// cek();
}
char GetLetter(int P)
{
X=te-1;
for(ii=18;ii>=0;ii--)
if(A[p[ii][X]].se>=P)
{
if(A[p[ii][X]].se==P)
{
X=p[ii][X];
break;
}
X=p[ii][X];
}
return A[X].fi;
// return hai[P];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 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 |
3 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 |
2 ms |
640 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Correct |
2 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
3 ms |
640 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
2 ms |
512 KB |
Output is correct |
8 |
Correct |
2 ms |
484 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Correct |
2 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
640 KB |
Output is correct |
2 |
Correct |
3 ms |
768 KB |
Output is correct |
3 |
Correct |
3 ms |
796 KB |
Output is correct |
4 |
Correct |
3 ms |
896 KB |
Output is correct |
5 |
Correct |
3 ms |
768 KB |
Output is correct |
6 |
Correct |
4 ms |
868 KB |
Output is correct |
7 |
Correct |
3 ms |
896 KB |
Output is correct |
8 |
Correct |
4 ms |
896 KB |
Output is correct |
9 |
Correct |
3 ms |
896 KB |
Output is correct |
10 |
Correct |
4 ms |
896 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
389 ms |
59496 KB |
Output is correct |
2 |
Correct |
464 ms |
72624 KB |
Output is correct |
3 |
Correct |
380 ms |
71800 KB |
Output is correct |
4 |
Correct |
438 ms |
75324 KB |
Output is correct |
5 |
Correct |
466 ms |
66524 KB |
Output is correct |
6 |
Correct |
306 ms |
78452 KB |
Output is correct |
7 |
Correct |
985 ms |
67360 KB |
Output is correct |
8 |
Correct |
826 ms |
76040 KB |
Output is correct |
9 |
Correct |
453 ms |
72924 KB |
Output is correct |
10 |
Correct |
242 ms |
82040 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
650 ms |
54520 KB |
Output is correct |
2 |
Correct |
839 ms |
47164 KB |
Output is correct |
3 |
Correct |
398 ms |
59972 KB |
Output is correct |
4 |
Correct |
434 ms |
52096 KB |
Output is correct |
5 |
Correct |
368 ms |
69704 KB |
Output is correct |
6 |
Correct |
393 ms |
72056 KB |
Output is correct |
7 |
Correct |
405 ms |
71972 KB |
Output is correct |
8 |
Execution timed out |
1064 ms |
53932 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |