oj.uz

답안 #862863

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862863 2023-10-19T07:04:45 Z sleepntsheep 크레이피쉬 글쓰는 기계 (IOI12_scrivener) C++17
100 / 100
 288 ms 165204 KB 
#include <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll = long long;
using ld = long double;
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false)

#define N 1000005
#define M 40000005
#define ALL(x) x.begin(), x.end()

char A[M]; int L[M], R[M], root[N], len[N], ALLOC = 1, cur = 0;

int persist0(char c)
{
    A[ALLOC] = c;
    return ALLOC++;
}

int persist1(int l, int r)
{
    int p = ALLOC++;
    L[p] = l, R[p] = r;
    return p;
}

int build(int l, int r)
{
    if (l == r) return persist0(0);
    return persist1(build(l, (l+r)/2), build((l+r)/2+1, r));
}

int upd(int v, int l, int r, int p, char c)
{
    if (l == r) return persist0(c);
    if (p <= (l+r)/2) return persist1(upd(L[v], l, (l+r)/2, p, c), R[v]);
    return persist1(L[v], upd(R[v], (l+r)/2+1, r, p, c));
}

int qry(int v, int l, int r, int p)
{
    if (l == r) return A[v];
    if (p <= (l+r)/2) return qry(L[v], l, (l+r)/2, p);
    return qry(R[v], (l+r)/2+1, r, p);
}

void P()
{
#if 0
    for (int i = 0; i < len[cur]; ++i) printf("%c", qry(root[cur], 0, 1000000, i));
            puts("");
#endif
}

void Init()
{
    root[0] = build(0, 1000000);
    P();
}

void TypeLetter(char c)
{
    ++cur; len[cur] = len[cur - 1] + 1;
    root[cur] = upd(root[cur-1], 0, 1000000, len[cur - 1], c);
    P();
}

void UndoCommands(int u)
{
    int f = cur++ - u;
    root[cur] = root[f]; len[cur] = len[f];
    P();
}

char GetLetter(int k)
{
    P();
    return qry(root[cur], 0, 1000000, k);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 24924 KB Output is correct
2 Correct 7 ms 25048 KB Output is correct
3 Correct 7 ms 24924 KB Output is correct
4 Correct 8 ms 24924 KB Output is correct
5 Correct 7 ms 24924 KB Output is correct
6 Correct 7 ms 25044 KB Output is correct
7 Correct 8 ms 25048 KB Output is correct
8 Correct 7 ms 24924 KB Output is correct
9 Correct 7 ms 24924 KB Output is correct
10 Correct 7 ms 24924 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 24924 KB Output is correct
2 Correct 8 ms 24924 KB Output is correct
3 Correct 8 ms 24920 KB Output is correct
4 Correct 7 ms 24924 KB Output is correct
5 Correct 8 ms 25040 KB Output is correct
6 Correct 7 ms 24924 KB Output is correct
7 Correct 8 ms 25076 KB Output is correct
8 Correct 7 ms 25176 KB Output is correct
9 Correct 8 ms 24924 KB Output is correct
10 Correct 7 ms 24924 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 24924 KB Output is correct
2 Correct 9 ms 24924 KB Output is correct
3 Correct 8 ms 25064 KB Output is correct
4 Correct 8 ms 24924 KB Output is correct
5 Correct 8 ms 24924 KB Output is correct
6 Correct 9 ms 24924 KB Output is correct
7 Correct 8 ms 25372 KB Output is correct
8 Correct 8 ms 25056 KB Output is correct
9 Correct 9 ms 24924 KB Output is correct
10 Correct 8 ms 25036 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 201 ms 136212 KB Output is correct
2 Correct 202 ms 146260 KB Output is correct
3 Correct 195 ms 144400 KB Output is correct
4 Correct 218 ms 120156 KB Output is correct
5 Correct 234 ms 128260 KB Output is correct
6 Correct 207 ms 162900 KB Output is correct
7 Correct 247 ms 95400 KB Output is correct
8 Correct 226 ms 127060 KB Output is correct
9 Correct 225 ms 165204 KB Output is correct
10 Correct 156 ms 125532 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 245 ms 122140 KB Output is correct
2 Correct 281 ms 113656 KB Output is correct
3 Correct 218 ms 121168 KB Output is correct
4 Correct 245 ms 100460 KB Output is correct
5 Correct 203 ms 130580 KB Output is correct
6 Correct 197 ms 124240 KB Output is correct
7 Correct 205 ms 130388 KB Output is correct
8 Correct 260 ms 77140 KB Output is correct
9 Correct 288 ms 115448 KB Output is correct
10 Correct 158 ms 125776 KB Output is correct