int rear,cnt;
int a[1000010];
int ans[1000010];
bool first;
void Init(){
rear = -1;
first = true;
}
void TypeLetter(char L) {
rear++;
a[rear] = -(L-'a'+1);
first = true;
}
void UndoCommands(int U) {
rear++;
a[rear] = U;
first = true;
}
char GetLetter(int P) {
int i;
if(first){
first = false;
cnt = -1;
for(i=rear; i>=0; i--){
if(a[i] < 0){
ans[++cnt] = -a[i];
}else{
i = i-a[i];
}
}
}
return ans[cnt-P]+'a'-1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
8888 KB |
Output is correct |
2 |
Correct |
0 ms |
8888 KB |
Output is correct |
3 |
Correct |
0 ms |
8888 KB |
Output is correct |
4 |
Correct |
0 ms |
8888 KB |
Output is correct |
5 |
Correct |
0 ms |
8888 KB |
Output is correct |
6 |
Correct |
0 ms |
8888 KB |
Output is correct |
7 |
Correct |
0 ms |
8888 KB |
Output is correct |
8 |
Correct |
0 ms |
8888 KB |
Output is correct |
9 |
Correct |
0 ms |
8888 KB |
Output is correct |
10 |
Correct |
0 ms |
8888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
8888 KB |
Output is correct |
2 |
Correct |
0 ms |
8888 KB |
Output is correct |
3 |
Correct |
0 ms |
8888 KB |
Output is correct |
4 |
Correct |
0 ms |
8888 KB |
Output is correct |
5 |
Correct |
0 ms |
8888 KB |
Output is correct |
6 |
Correct |
0 ms |
8888 KB |
Output is correct |
7 |
Correct |
0 ms |
8888 KB |
Output is correct |
8 |
Correct |
0 ms |
8888 KB |
Output is correct |
9 |
Correct |
0 ms |
8888 KB |
Output is correct |
10 |
Correct |
0 ms |
8888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
8888 KB |
Output is correct |
2 |
Correct |
0 ms |
8888 KB |
Output is correct |
3 |
Correct |
2 ms |
8888 KB |
Output is correct |
4 |
Correct |
1 ms |
8888 KB |
Output is correct |
5 |
Correct |
0 ms |
8888 KB |
Output is correct |
6 |
Correct |
1 ms |
8888 KB |
Output is correct |
7 |
Correct |
0 ms |
8888 KB |
Output is correct |
8 |
Correct |
3 ms |
8888 KB |
Output is correct |
9 |
Correct |
3 ms |
8888 KB |
Output is correct |
10 |
Correct |
0 ms |
8888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
137 ms |
8888 KB |
Output is correct |
2 |
Correct |
142 ms |
8888 KB |
Output is correct |
3 |
Correct |
157 ms |
8888 KB |
Output is correct |
4 |
Correct |
194 ms |
8888 KB |
Output is correct |
5 |
Correct |
188 ms |
8888 KB |
Output is correct |
6 |
Correct |
162 ms |
8888 KB |
Output is correct |
7 |
Correct |
202 ms |
8888 KB |
Output is correct |
8 |
Correct |
187 ms |
8888 KB |
Output is correct |
9 |
Correct |
160 ms |
8888 KB |
Output is correct |
10 |
Correct |
161 ms |
8888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1000 ms |
8888 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |