#include <string>
#include <algorithm>
using namespace std;
int const N=1e6+10;
char com[N]={};
int ind[N]={};
int num=0;
string g="";
bool w=1;
void Init()
{
com[num]=' ';
ind[0]=0;
}
void TypeLetter(char L)
{
num++;
com[num]=L;
ind[num]=num;
g+=L;
}
void UndoCommands(int U)
{
w=1;
ind[num+1]=ind[num-U];
com[num+1]=com[num-U];
num++;
}
char GetLetter(int P)
{
if (w)
{
int i=ind[num];
while (i!=0)
{
g+=com[i];
i=ind[i-1];
}
reverse(begin(g),end(g));
w=0;
}
return g[P];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
348 KB |
Output is correct |
2 |
Incorrect |
51 ms |
824 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
73 ms |
5264 KB |
Output is correct |
2 |
Correct |
81 ms |
5812 KB |
Output is correct |
3 |
Correct |
83 ms |
5576 KB |
Output is correct |
4 |
Correct |
103 ms |
5872 KB |
Output is correct |
5 |
Correct |
104 ms |
5640 KB |
Output is correct |
6 |
Correct |
96 ms |
7024 KB |
Output is correct |
7 |
Correct |
113 ms |
5644 KB |
Output is correct |
8 |
Correct |
102 ms |
6896 KB |
Output is correct |
9 |
Correct |
89 ms |
6668 KB |
Output is correct |
10 |
Correct |
83 ms |
6128 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1010 ms |
18204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |