#include <bits/stdc++.h>
#define ii pair < char , char >
#define fi first
#define se second
using namespace std;
const int N=1e6+5;
ii a[N];
char s[N];
bool q=0;
int i=0;
void Init() {}
void TypeLetter(char L) {
a[i]={'T',L};
i++;
}
void UndoCommands(int U) {
a[i]={'U','0'+U};
i++;
}
int j=0;
char GetLetter(int P) {
if(!q)
{
j=0;
i--;
while(i>=0)
{
if(a[i].fi=='T')
{
s[j]=a[i].se;
j++;
}
else if(a[i].fi=='U')
{
i-=(a[i].se-'0');
}
else
assert(0);
i--;
}
reverse(s,s+j);
}
q=1;
return s[P];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
248 KB |
Output is correct |
2 |
Incorrect |
2 ms |
356 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
560 KB |
Output is correct |
2 |
Incorrect |
2 ms |
560 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
640 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
133 ms |
3664 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
223 ms |
3960 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |