이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
const int DIM = 1e6 + 5;
pair <int, int> cur = {0, 0};
vector <vector <pair <int, int>>> tt;
vector <vector <int>> pref;
int nr1, nr2;
char ch[DIM];
int le[DIM], le2[DIM];
void Init() {tt.emplace_back(); pref.emplace_back();}
void TypeLetter(char L) {
++nr1; ++nr2;
le[nr1] = le[cur.first] + 1;
ch[nr1] = L;
pref.emplace_back();
pref[nr1].push_back(cur.first);
for (int k = 1; (1 << k) < le[nr1] ; ++k)
pref[nr1].push_back(pref[pref[nr1][k - 1]][k - 1]);
le2[nr2] = le2[cur.second] + 1;
tt.emplace_back();
tt[nr2].push_back(cur);
for (int k = 1; (1 << k) < le2[nr2] ; ++k)
tt[nr2].push_back(tt[tt[nr2][k - 1].second][k - 1]);
cur = {nr1, nr2};
}
void UndoCommands(int U) {
++nr2;
pair <int, int> aux = cur;
for (int k = 20; k >= 0 ; --k) {
if ((1 << k) & U) {
cur = tt[cur.second][k];
U = U - (1 << k);
}
}
cur = {cur.first, nr2};
le2[cur.second] = le2[aux.second] + 1;
tt.emplace_back();
tt[cur.second].push_back(aux);
for (int k = 1; (1 << k) < le2[cur.second] ; ++k)
tt[cur.second].push_back(tt[tt[cur.second][k - 1].second][k - 1]);
}
char GetLetter(int P) {
++P;
int dif = le[cur.first] - P;
int ind = cur.first;
for (int k = 20; k >= 0 ; --k) {
if ((1 << k) & dif) {
ind = pref[ind][k];
dif = dif - (1 << k);
}
}
return ch[ind];
}
# | 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... |