제출 #639763

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
639763		ghostwriter	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++14	34 / 100	250 ms	262144 KiB

scrivener

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Cay ngay cay dem nhung deo duoc cong nhan
*/
const int N = 1e6 + 5;
struct Node {
    int l, r;
    char c;
    Node *left, *right;
    Node() {}
    Node(const Node &a) { l = a.l; r = a.r; c = a.c; left = a.left; right = a.right; }
    Node(int l, int r, char c, Node *left, Node *right) : l(l), r(r), c(c), left(left), right(right) {}
};
Node *root[N];
char last;
int cnt = 0, s[N];
void build(Node *cur) {
    int l = cur -> l, r = cur -> r;
    if (l == r) return;
    int mid = l + (r - l) / 2;
    cur -> left = new Node(l, mid, 0, 0, 0);
    cur -> right = new Node(mid + 1, r, 0, 0, 0);
    build(cur -> left);
    build(cur -> right);
}
void upd(Node *&cur, int q, char v) {
    int l = cur -> l, r = cur -> r;
    if (r < q || l > q) return;
    if (l == r) {
        cur = new Node(l, r, v, 0, 0);
        return;
    }
    cur -> left = new Node(*cur -> left);
    cur -> right = new Node(*cur -> right);
    upd(cur -> left, q, v);
    upd(cur -> right, q, v);
}
char get(Node *cur, int q) {
    int l = cur -> l, r = cur -> r;
    char c = cur -> c;
    if (r < q || l > q) return 0;
    if (l == r) return c;
    return get(cur -> left, q) + get(cur -> right, q);
}
void Init() { root[0] = new Node(0, 1e6, 0, 0, 0); build(root[0]); }
void TypeLetter(char L) {
    ++cnt;
    root[cnt] = new Node(*root[cnt - 1]);
    s[cnt] = s[cnt - 1] + 1;
    upd(root[cnt], s[cnt] - 1, L);
    last = L;
}
void UndoCommands(int U) {
    ++cnt;
    root[cnt] = new Node(*root[cnt - 1 - U]);
    s[cnt] = s[cnt - 1 - U];
}
char GetLetter(int P) {
    return get(root[cnt], P);
}
/*
14
T a
T b
P 1
T d
U 2
U 1
P 2
T e
U 1
U 5
T c
P 2
U 2
P 2
*/

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 22 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 40