This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define allarr(a) a , a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio ios_base::sync_with_stdio(false) ; cin.tie(NULL); cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll,ll> pll;
typedef pair<int,pi> trp ;
typedef vector<pi> vpi;
typedef vector<pll> vpll ;
// int ab (int x ) { return (x>0?x:-x); }
//
string s = "" ;
const int N = 1e5+5;
vector<int> adj[N] ;
int cnt = 0 ;
bool isleaf[N] ;
char leter[N] ;
void Init(){
}
void dfs ( int u , int d ){
if( isleaf [u] ){
if( d % 2 == 0){
s.pop_back() ;
}
else{
s += leter[u] ;
}
return ;
}
for(int v : adj[u]){
dfs(v,d+1) ;
}
}
void UndoCommands(int U)
{
for(int i = cnt - U ; i < cnt ; i++ ){
adj[cnt].pb(i) ;
}
for(int i = cnt - 1 , j = 0 ; j < U; i-- , j++ ){
dfs(i,0);
}
cnt ++ ;
}
void TypeLetter(char L){
s+=L;
isleaf[cnt]=1;
leter [cnt] = L ;
cnt ++ ;
}
char GetLetter(int P)
{
// cout << s[P] << endl
if( P < (int)s.length() )
return s[P] ;
return 0;
}
// int main(){
// Init();
// TypeLetter('a');TypeLetter('b');
// GetLetter(1);
// TypeLetter('d');
// UndoCommands(2);
// UndoCommands(1);
// GetLetter(2);
// TypeLetter('e');
// UndoCommands(1);
// UndoCommands(5);
// TypeLetter('c');
// GetLetter(2);
// UndoCommands(2); GetLetter(2);
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |