#include <algorithm>
#include <vector>
#define M 1000000
using namespace std;
struct Node{
char c;
int h;
Node *nxt;
vector<Node *> par;
};
Node *a[M+1];
int t;
void Init() {
a[t=0]=new Node();
}
void TypeLetter(char L) {
a[t]->nxt=a[t+1]=new Node();
a[t+1]->c=L;
a[t+1]->h=a[t]->h+1;
Node *p=a[t];
while(p){
a[t+1]->par.push_back(p);
p=p->par.size()>=a[t+1]->par.size() ? p->par[a[t+1]->par.size()-1] : NULL;
}
t++;
}
void UndoCommands(int U) {
a[t+1]=a[t-U];
t++;
}
char GetLetter(int P) {
Node *p=a[t];
P=p->h-P-1;
for(int i=0;P;i++){
if((1<<i)&P){
P-=(1<<i);
p=p->par[i];
}
}
return p->c;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
9020 KB |
Output is correct |
2 |
Correct |
0 ms |
9152 KB |
Output is correct |
3 |
Correct |
0 ms |
9152 KB |
Output is correct |
4 |
Correct |
0 ms |
9152 KB |
Output is correct |
5 |
Correct |
0 ms |
9152 KB |
Output is correct |
6 |
Correct |
0 ms |
9152 KB |
Output is correct |
7 |
Correct |
0 ms |
9152 KB |
Output is correct |
8 |
Correct |
0 ms |
9152 KB |
Output is correct |
9 |
Correct |
0 ms |
9152 KB |
Output is correct |
10 |
Correct |
0 ms |
9152 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
9020 KB |
Output is correct |
2 |
Correct |
0 ms |
9152 KB |
Output is correct |
3 |
Correct |
0 ms |
9152 KB |
Output is correct |
4 |
Correct |
0 ms |
9152 KB |
Output is correct |
5 |
Correct |
0 ms |
9152 KB |
Output is correct |
6 |
Correct |
0 ms |
9152 KB |
Output is correct |
7 |
Correct |
0 ms |
9152 KB |
Output is correct |
8 |
Correct |
0 ms |
9152 KB |
Output is correct |
9 |
Correct |
0 ms |
9152 KB |
Output is correct |
10 |
Correct |
0 ms |
9152 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
9284 KB |
Output is correct |
2 |
Correct |
2 ms |
9284 KB |
Output is correct |
3 |
Correct |
0 ms |
9284 KB |
Output is correct |
4 |
Correct |
0 ms |
9416 KB |
Output is correct |
5 |
Correct |
0 ms |
9284 KB |
Output is correct |
6 |
Correct |
0 ms |
9680 KB |
Output is correct |
7 |
Correct |
2 ms |
9548 KB |
Output is correct |
8 |
Correct |
0 ms |
9548 KB |
Output is correct |
9 |
Correct |
0 ms |
9548 KB |
Output is correct |
10 |
Correct |
3 ms |
9284 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
982 ms |
171644 KB |
Output is correct |
2 |
Execution timed out |
1000 ms |
199760 KB |
Program timed out |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
914 ms |
142736 KB |
Output is correct |
2 |
Correct |
950 ms |
121484 KB |
Output is correct |
3 |
Correct |
619 ms |
97064 KB |
Output is correct |
4 |
Correct |
532 ms |
72380 KB |
Output is correct |
5 |
Correct |
864 ms |
161876 KB |
Output is correct |
6 |
Correct |
719 ms |
132176 KB |
Output is correct |
7 |
Correct |
783 ms |
156728 KB |
Output is correct |
8 |
Correct |
769 ms |
70664 KB |
Output is correct |
9 |
Execution timed out |
1000 ms |
137060 KB |
Program timed out |
10 |
Halted |
0 ms |
0 KB |
- |