#include <bits/stdc++.h>
using namespace std ;
const int N = 1e6+2 ;
int last, delCommands;
string let ;
string ot ;
int q ;
int acc[N] ;
void Init() {q = 0 ;last = 0;}
void TypeLetter(char L) {
ot.push_back ( L );
++q ;
acc[q]++ ; acc[q]+=acc[q-1];
}
void UndoCommands(int U) {
++q ;
last = q ;
delCommands = U+1;
//cout << last << ' ' << delCommands << '\n' ;
reverse ( ot.begin(), ot.end() ) ;
while ( ot.size() ) {
let.push_back ( ot.back() ) ;
ot.pop_back() ;
}
}
char GetLetter(int P) {
// cout << last << ' ' << delCommands << ' ' << acc[3] << '\n' ;
if ( P+1 > acc[last-delCommands] ) {
P -= acc[last-delCommands] ;
return ot[P] ;
}
return let[P];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
3 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
252 KB |
Output is correct |
9 |
Correct |
2 ms |
256 KB |
Output is correct |
10 |
Correct |
2 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
112 ms |
7852 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 |
Runtime error |
161 ms |
7272 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |