#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
int pct(int x) { return __builtin_popcount(x); }
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x))
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) {
bool fst = 1; str res = "{";
F0R(i,sz(v)) {
if (!fst) res += ", ";
fst = 0; res += ts(v[i]);
}
res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
str res = ""; F0R(i,SZ) res += char('0'+b[i]);
return res; }
template<class T> str ts(T v) {
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
return "("+ts(p.f)+", "+ts(p.s)+")"; }
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) {
pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) {
pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif
// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
unsyncIO();
// cin.exceptions(cin.failbit);
// throws exception when do smth illegal
// ex. try to read letter into int
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
int curind = 1; //next number of new node
int to[1000005][26];
int par[1000005][26];
int echar[1000005];
int opnum = 1; //current operation number
int nodenum[1000005]; //for an operation number, the right node number
int depth[1000005];
int tpow[30];
void Init() {
for(int i = 0; i < 1000005; i++){
for(int j = 0; j < 26; j++){
to[i][j] = -1;
par[i][j] = -1;
}
echar[i] = -1;
}
tpow[0] = 1;
for(int i = 1; i < 26; i++){
tpow[i] = tpow[i-1]*2;
}
}
void TypeLetter(char L) {
int node = nodenum[opnum-1];
if(to[node][L-'a'] == -1){
to[node][L-'a'] = curind;
//ps(L, curind);
echar[curind] = L-'a';
depth[curind] = depth[node]+1;
par[curind][0] = node;
for(int j = 1; j < 26; j++){
par[curind][j] = par[par[curind][j-1]][j-1];
}
node = to[node][L-'a'];
curind++;
}
else{
node = to[node][L-'a'];
}
nodenum[opnum] = node;
opnum++;
}
void UndoCommands(int U) {
nodenum[opnum] = nodenum[opnum-1-U];
opnum++;
}
char GetLetter(int P) {
int node = nodenum[opnum-1];
int len = depth[node];
P = (len-1-P);
//ps("GET", P);
//ps("node", node, par[node][0]);
for(int i = 25; i >= 0; i--){
if(P >= tpow[i]){
node = par[node][i];
P-=tpow[i];
}
}
//ps("node aft", node);
return char(echar[node]+'a');
}
Compilation message
scrivener.cpp: In function 'void setIn(std::__cxx11::string)':
scrivener.cpp:123:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~
scrivener.cpp: In function 'void setOut(std::__cxx11::string)':
scrivener.cpp:124:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
109 ms |
207736 KB |
Output is correct |
2 |
Correct |
114 ms |
207844 KB |
Output is correct |
3 |
Correct |
112 ms |
207864 KB |
Output is correct |
4 |
Correct |
112 ms |
207736 KB |
Output is correct |
5 |
Correct |
109 ms |
207736 KB |
Output is correct |
6 |
Correct |
119 ms |
207736 KB |
Output is correct |
7 |
Correct |
107 ms |
207716 KB |
Output is correct |
8 |
Correct |
113 ms |
207736 KB |
Output is correct |
9 |
Correct |
110 ms |
207736 KB |
Output is correct |
10 |
Correct |
111 ms |
207736 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
109 ms |
207784 KB |
Output is correct |
2 |
Correct |
110 ms |
207736 KB |
Output is correct |
3 |
Correct |
116 ms |
207744 KB |
Output is correct |
4 |
Correct |
111 ms |
207736 KB |
Output is correct |
5 |
Correct |
119 ms |
207908 KB |
Output is correct |
6 |
Correct |
112 ms |
207736 KB |
Output is correct |
7 |
Correct |
111 ms |
207700 KB |
Output is correct |
8 |
Correct |
108 ms |
207736 KB |
Output is correct |
9 |
Correct |
112 ms |
207736 KB |
Output is correct |
10 |
Correct |
110 ms |
207736 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
110 ms |
207736 KB |
Output is correct |
2 |
Correct |
114 ms |
207864 KB |
Output is correct |
3 |
Correct |
107 ms |
207864 KB |
Output is correct |
4 |
Correct |
109 ms |
207864 KB |
Output is correct |
5 |
Correct |
108 ms |
207864 KB |
Output is correct |
6 |
Correct |
110 ms |
207864 KB |
Output is correct |
7 |
Correct |
114 ms |
207824 KB |
Output is correct |
8 |
Correct |
120 ms |
207864 KB |
Output is correct |
9 |
Correct |
111 ms |
207864 KB |
Output is correct |
10 |
Correct |
112 ms |
207868 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
490 ms |
216824 KB |
Output is correct |
2 |
Correct |
538 ms |
217848 KB |
Output is correct |
3 |
Correct |
485 ms |
218744 KB |
Output is correct |
4 |
Correct |
484 ms |
219512 KB |
Output is correct |
5 |
Correct |
501 ms |
218232 KB |
Output is correct |
6 |
Correct |
445 ms |
218744 KB |
Output is correct |
7 |
Correct |
487 ms |
218488 KB |
Output is correct |
8 |
Correct |
468 ms |
218872 KB |
Output is correct |
9 |
Correct |
567 ms |
218872 KB |
Output is correct |
10 |
Correct |
372 ms |
217720 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
626 ms |
217340 KB |
Output is correct |
2 |
Correct |
701 ms |
217848 KB |
Output is correct |
3 |
Correct |
488 ms |
218232 KB |
Output is correct |
4 |
Correct |
503 ms |
219056 KB |
Output is correct |
5 |
Correct |
449 ms |
218232 KB |
Output is correct |
6 |
Correct |
526 ms |
217848 KB |
Output is correct |
7 |
Correct |
515 ms |
218140 KB |
Output is correct |
8 |
Correct |
581 ms |
218108 KB |
Output is correct |
9 |
Correct |
649 ms |
218488 KB |
Output is correct |
10 |
Correct |
382 ms |
217832 KB |
Output is correct |