#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
char c;
map<int,string> mpp;
int cev,koy,say,flag;
string s;
vector< pair<int,int> > v;
void Init(){
}
void TypeLetter(char L){
v.pb(mp(say++,L-'a'));
}
void UndoCommands(int U){
v.pb(mp(U,-1));
}
char GetLetter(int P){
if(flag==0){
reverse(v.begin(),v.end());
int ban=0;
//~ cout<<v.size()<<endl;
for(int i=0;i<(int)v.size();i++){
//~ cout<<ban<<"()"<<endl;
if(ban>0){ban--;continue;}
//~ cout<<i<<"**"<<endl;
if(v[i].se==-1)ban=v[i].fi;
else s+=v[i].se+'a';
}
reverse(s.begin(),s.end());
flag=1;
}
flag++;
//~ cout<<s.size()<<endl;
//~ if((int)s.size()<=P){return -1;}
return s[P];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Incorrect |
4 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
144 ms |
8800 KB |
Output is correct |
2 |
Correct |
158 ms |
10080 KB |
Output is correct |
3 |
Correct |
178 ms |
10088 KB |
Output is correct |
4 |
Correct |
218 ms |
10080 KB |
Output is correct |
5 |
Correct |
201 ms |
10296 KB |
Output is correct |
6 |
Correct |
171 ms |
10336 KB |
Output is correct |
7 |
Correct |
236 ms |
10340 KB |
Output is correct |
8 |
Correct |
204 ms |
10708 KB |
Output is correct |
9 |
Correct |
179 ms |
10212 KB |
Output is correct |
10 |
Correct |
183 ms |
10336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
44 ms |
3572 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |