#include <iostream>
using namespace std;
const int MAXT=3e6+1;
const int LG=22;
int tm=1;
int par[MAXT][LG];
int len[MAXT];
char cp[MAXT];
void Init()
{
for(int j=0;j<1000;j++)
cp[j]='$';
}
void TypeLetter(char L)
{
cp[tm]=L;
len[tm]=len[tm-1]+1;
par[tm][0]=tm-1;
for(int j=1;j<LG;j++)
par[tm][j]=par[par[tm][j-1]][j-1];
tm++;
}
void UndoCommands(int U)
{
len[tm]=len[tm-U-1];
par[tm][0]=tm-U-1;
for(int j=0;(j+1)<LG;j++)
par[tm][j+1]=par[tm-U-1][j];
tm++;
}
char GetLetter(int P)
{
int ct=tm-1;
for(int j=LG-1;j>=0;j--)
{
if(len[par[ct][j]]>P)
{
ct=par[ct][j];
// P-=len[ct];
}
}
return cp[ct];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
1 ms |
2396 KB |
Output is correct |
6 |
Correct |
1 ms |
2392 KB |
Output is correct |
7 |
Correct |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
1 ms |
2396 KB |
Output is correct |
10 |
Correct |
1 ms |
2396 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
1 ms |
2392 KB |
Output is correct |
6 |
Correct |
1 ms |
2396 KB |
Output is correct |
7 |
Correct |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
1 ms |
2396 KB |
Output is correct |
10 |
Correct |
1 ms |
2396 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
3 ms |
2396 KB |
Output is correct |
3 |
Correct |
2 ms |
2396 KB |
Output is correct |
4 |
Correct |
2 ms |
2396 KB |
Output is correct |
5 |
Correct |
2 ms |
2396 KB |
Output is correct |
6 |
Correct |
2 ms |
2396 KB |
Output is correct |
7 |
Correct |
2 ms |
2392 KB |
Output is correct |
8 |
Correct |
3 ms |
2396 KB |
Output is correct |
9 |
Correct |
2 ms |
2396 KB |
Output is correct |
10 |
Correct |
2 ms |
2396 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
261 ms |
67664 KB |
Output is correct |
2 |
Correct |
267 ms |
84048 KB |
Output is correct |
3 |
Correct |
269 ms |
82024 KB |
Output is correct |
4 |
Correct |
328 ms |
88272 KB |
Output is correct |
5 |
Correct |
286 ms |
76112 KB |
Output is correct |
6 |
Correct |
227 ms |
90704 KB |
Output is correct |
7 |
Incorrect |
231 ms |
76120 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
331 ms |
63956 KB |
Output is correct |
2 |
Correct |
356 ms |
56004 KB |
Output is correct |
3 |
Correct |
311 ms |
69952 KB |
Output is correct |
4 |
Correct |
349 ms |
60240 KB |
Output is correct |
5 |
Incorrect |
227 ms |
80208 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |