#include <bits/stdc++.h>
#define P(x) do {if(debug) cout << x << endl;} while(false)
#define H(x) P(#x << ": " << x)
#define FR(i, a, b) for(int i = (a); i < (b); ++i)
#define F(i, n) FR(i, 0, n)
using namespace std;
const bool debug = 0 ;
const int inf = 1e9;
const int N = 1000005;
//int ind[N];
char parent[N];
int depth[N];
vector<vector<int> > memo;
int cur;
/*int root(int a){
if(a==ind[a]){
return a;
}
return ind[a] = root(ind[a]);
}*/
void print(){
if(debug){
//cout<<"ind: ";
//F(i, cur+1) cout<<ind[i]<<" ";
cout<<"\nparent: ";
F(i, cur+1) cout<<parent[i]<<" ";
cout<<"\ndepth: ";
F(i, cur+1) cout<<depth[i]<<" ";
cout<<"\nmemo: ";
F(i, cur+1) cout<<memo[i][0]<<" ";
}
}
int f(int i, int h){
if(memo[i][h]!=-1){
return memo[i][h];
}
return memo[i][h] = f(f(i,h-1) , h-1);
}
void Init() {
//ind[0] = 0;
parent[0] = '\\';
depth[0] = 0;
P("I");
memo.resize(N, vector<int> (23, -1));
memo[0][0] = 0;
P("II");
cur = 0;
}
void TypeLetter(char L) {
H(L);
int n = cur+1;
//ind[n] = n;
parent[n]=L;
memo[n][0] = cur;
depth[n] = depth[cur]+1;
//cout<<endl;
cur = n;
}
void UndoCommands(int U) {
H(U);
parent[cur+1] = parent[cur-U];
depth[cur+1] = depth[cur-U];
memo[cur+1][0] = memo[cur-U][0];
cur++;
}
char GetLetter(int P) {
H(P);
print();
int res = cur;
for(int h = 22; h>=0; h--){
if(depth[f(res, h)]>P) res = f(res, h);
}
return parent[res];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
159 ms |
133496 KB |
Output is correct |
2 |
Correct |
157 ms |
133496 KB |
Output is correct |
3 |
Correct |
158 ms |
133368 KB |
Output is correct |
4 |
Correct |
159 ms |
133496 KB |
Output is correct |
5 |
Correct |
161 ms |
133500 KB |
Output is correct |
6 |
Correct |
162 ms |
133384 KB |
Output is correct |
7 |
Correct |
158 ms |
133356 KB |
Output is correct |
8 |
Correct |
162 ms |
133496 KB |
Output is correct |
9 |
Correct |
159 ms |
133372 KB |
Output is correct |
10 |
Correct |
167 ms |
133452 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
159 ms |
133416 KB |
Output is correct |
2 |
Correct |
160 ms |
133340 KB |
Output is correct |
3 |
Correct |
159 ms |
133424 KB |
Output is correct |
4 |
Correct |
159 ms |
133368 KB |
Output is correct |
5 |
Correct |
156 ms |
133496 KB |
Output is correct |
6 |
Correct |
157 ms |
133512 KB |
Output is correct |
7 |
Correct |
157 ms |
133340 KB |
Output is correct |
8 |
Correct |
157 ms |
133496 KB |
Output is correct |
9 |
Correct |
156 ms |
133372 KB |
Output is correct |
10 |
Correct |
158 ms |
133368 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
164 ms |
133520 KB |
Output is correct |
2 |
Correct |
170 ms |
133468 KB |
Output is correct |
3 |
Correct |
160 ms |
133496 KB |
Output is correct |
4 |
Correct |
158 ms |
133492 KB |
Output is correct |
5 |
Correct |
158 ms |
133500 KB |
Output is correct |
6 |
Correct |
160 ms |
133480 KB |
Output is correct |
7 |
Correct |
159 ms |
133548 KB |
Output is correct |
8 |
Correct |
160 ms |
133528 KB |
Output is correct |
9 |
Correct |
160 ms |
133484 KB |
Output is correct |
10 |
Correct |
160 ms |
133496 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
414 ms |
139900 KB |
Output is correct |
2 |
Correct |
392 ms |
140408 KB |
Output is correct |
3 |
Correct |
422 ms |
140408 KB |
Output is correct |
4 |
Correct |
536 ms |
140728 KB |
Output is correct |
5 |
Correct |
595 ms |
140540 KB |
Output is correct |
6 |
Correct |
429 ms |
140756 KB |
Output is correct |
7 |
Correct |
717 ms |
140292 KB |
Output is correct |
8 |
Correct |
604 ms |
140792 KB |
Output is correct |
9 |
Correct |
460 ms |
140536 KB |
Output is correct |
10 |
Correct |
323 ms |
140920 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1087 ms |
140280 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |