char last;
int p[100010][21],a[100010],pos[100010],n,len[100010];
char str[100010];
void Init() {}
void TypeLetter(char L)
{
int i;
n++;
p[n][0]=pos[n-1];
for(i=1;i<=20;i++)
{
p[n][i]=p[p[n][i-1]][i-1];
}
pos[n]=n;
len[n]=len[p[n][0]]+1;
str[n]=L;
}
void UndoCommands(int U)
{
int i;
n++;
pos[n]=pos[n-U-1];
len[n]=len[pos[n]];
}
char GetLetter(int P)
{
int i;
int m,dir=pos[n];
m=len[n]-P-1;
for(i=0;i<=20;i++)
{
if(m&(1<<i))
{
m-=(1<<i);
dir=p[dir][i];
}
}
return str[dir];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
10552 KB |
Output is correct |
2 |
Correct |
0 ms |
10552 KB |
Output is correct |
3 |
Correct |
0 ms |
10552 KB |
Output is correct |
4 |
Correct |
0 ms |
10552 KB |
Output is correct |
5 |
Correct |
0 ms |
10552 KB |
Output is correct |
6 |
Correct |
0 ms |
10552 KB |
Output is correct |
7 |
Correct |
0 ms |
10552 KB |
Output is correct |
8 |
Correct |
0 ms |
10552 KB |
Output is correct |
9 |
Correct |
0 ms |
10552 KB |
Output is correct |
10 |
Correct |
0 ms |
10552 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
10552 KB |
Output is correct |
2 |
Correct |
0 ms |
10552 KB |
Output is correct |
3 |
Correct |
0 ms |
10552 KB |
Output is correct |
4 |
Correct |
0 ms |
10552 KB |
Output is correct |
5 |
Correct |
0 ms |
10552 KB |
Output is correct |
6 |
Correct |
0 ms |
10552 KB |
Output is correct |
7 |
Correct |
0 ms |
10552 KB |
Output is correct |
8 |
Correct |
0 ms |
10552 KB |
Output is correct |
9 |
Correct |
0 ms |
10552 KB |
Output is correct |
10 |
Correct |
0 ms |
10552 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
10552 KB |
Output is correct |
2 |
Correct |
0 ms |
10552 KB |
Output is correct |
3 |
Correct |
0 ms |
10552 KB |
Output is correct |
4 |
Correct |
0 ms |
10552 KB |
Output is correct |
5 |
Correct |
0 ms |
10552 KB |
Output is correct |
6 |
Correct |
0 ms |
10552 KB |
Output is correct |
7 |
Correct |
0 ms |
10552 KB |
Output is correct |
8 |
Correct |
0 ms |
10552 KB |
Output is correct |
9 |
Correct |
0 ms |
10552 KB |
Output is correct |
10 |
Correct |
0 ms |
10552 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
68 ms |
10552 KB |
Program hung waiting for input |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
116 ms |
10552 KB |
SIGSEGV Segmentation fault |
2 |
Halted |
0 ms |
0 KB |
- |