#include <bits/stdc++.h>
using namespace std;
//#include "grader.cpp"
#define MAX_COMM 1000006
#define LOG_COMM 20
int curr_comm;
char edg_char[MAX_COMM];
int par[LOG_COMM][MAX_COMM] ,dist[LOG_COMM][MAX_COMM];
int dist_root[MAX_COMM];
void bld_anc(int u ,int p ,int v){
par[0][u] = p;
dist[0][u] = (bool)v;
dist_root[u] = dist_root[p]+(bool)v;
edg_char[u] = (v ? v : edg_char[p]);
for(int i=1; i<LOG_COMM; i++)
if(~par[i-1][u]){
par[i][u] = par[i-1][par[i-1][u]];
dist[i][u] = dist[i-1][u] + dist[i-1][par[i-1][u]];
}
}
void Init(){
curr_comm = 0;
memset(par ,-1 ,sizeof par);
memset(dist ,0 ,sizeof dist);
memset(dist_root ,0 ,sizeof dist_root);
}
void TypeLetter(char L){++curr_comm;
bld_anc(curr_comm ,curr_comm-1 ,L);
}
void UndoCommands(int U){++curr_comm;
bld_anc(curr_comm ,curr_comm-U-1 ,0);
}
char GetLetter(int P){
int u = curr_comm;
P = dist_root[u]-P-1;
for(int i=LOG_COMM-1; ~i; i--)
if(~par[i][u] && dist[i][u] <= P){
P -= dist[i][u];
u = par[i][u];
}
return edg_char[u];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
121 ms |
160888 KB |
Output is correct |
2 |
Correct |
123 ms |
160760 KB |
Output is correct |
3 |
Correct |
121 ms |
160760 KB |
Output is correct |
4 |
Correct |
120 ms |
160760 KB |
Output is correct |
5 |
Correct |
121 ms |
160764 KB |
Output is correct |
6 |
Correct |
127 ms |
160852 KB |
Output is correct |
7 |
Correct |
120 ms |
160780 KB |
Output is correct |
8 |
Correct |
120 ms |
160836 KB |
Output is correct |
9 |
Correct |
120 ms |
160736 KB |
Output is correct |
10 |
Correct |
120 ms |
160744 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
121 ms |
160812 KB |
Output is correct |
2 |
Correct |
119 ms |
160760 KB |
Output is correct |
3 |
Correct |
128 ms |
160888 KB |
Output is correct |
4 |
Correct |
116 ms |
160760 KB |
Output is correct |
5 |
Correct |
115 ms |
160760 KB |
Output is correct |
6 |
Correct |
117 ms |
160760 KB |
Output is correct |
7 |
Correct |
123 ms |
160716 KB |
Output is correct |
8 |
Correct |
121 ms |
160716 KB |
Output is correct |
9 |
Correct |
122 ms |
160732 KB |
Output is correct |
10 |
Correct |
133 ms |
160760 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
124 ms |
160848 KB |
Output is correct |
2 |
Correct |
121 ms |
160820 KB |
Output is correct |
3 |
Correct |
119 ms |
160876 KB |
Output is correct |
4 |
Correct |
117 ms |
160764 KB |
Output is correct |
5 |
Correct |
118 ms |
160888 KB |
Output is correct |
6 |
Correct |
118 ms |
160888 KB |
Output is correct |
7 |
Correct |
121 ms |
160860 KB |
Output is correct |
8 |
Correct |
144 ms |
160876 KB |
Output is correct |
9 |
Correct |
122 ms |
160860 KB |
Output is correct |
10 |
Correct |
120 ms |
160844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
563 ms |
162004 KB |
Output is correct |
2 |
Correct |
649 ms |
161808 KB |
Output is correct |
3 |
Correct |
610 ms |
161892 KB |
Output is correct |
4 |
Correct |
642 ms |
162140 KB |
Output is correct |
5 |
Correct |
680 ms |
162292 KB |
Output is correct |
6 |
Correct |
545 ms |
162036 KB |
Output is correct |
7 |
Execution timed out |
1088 ms |
162024 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
793 ms |
162192 KB |
Output is correct |
2 |
Correct |
943 ms |
162252 KB |
Output is correct |
3 |
Correct |
558 ms |
162004 KB |
Output is correct |
4 |
Correct |
604 ms |
162424 KB |
Output is correct |
5 |
Correct |
502 ms |
162168 KB |
Output is correct |
6 |
Correct |
565 ms |
162148 KB |
Output is correct |
7 |
Correct |
569 ms |
162148 KB |
Output is correct |
8 |
Execution timed out |
1077 ms |
162040 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |