oj.uz

Submission #867642

# Submission time Handle Problem Language Result Execution time Memory
867642 2023-10-29T04:02:40 Z sleepntsheep Monkey and Apple-trees (IZhO12_apple) C++17
100 / 100
 270 ms 173364 KB 
#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
using ll = long long;
#define N 200005
#define M 80*N

int ALLOC = 1, A[M], L[M], R[M], TL[M], TR[M];

int sparse0(int tl, int tr, int x)
{
    TL[ALLOC] = tl, TR[ALLOC] = tr; A[ALLOC] = x; return ALLOC++;
}

void push(int v)
{
    if (!L[v] && TL[v] != TR[v])
    {
        int m = (TL[v] + TR[v])/2;
        L[v] = sparse0(TL[v], m, 0);
        R[v] = sparse0(m+1, TR[v], 0);
    }
    if (A[v] == TR[v] - TL[v] + 1)
    {
        if (TL[v] != TR[v])
            A[L[v]] = TR[L[v]] - TL[L[v]] + 1, A[R[v]] = TR[R[v]] - TL[R[v]] + 1;
    }
}

void ripe(int v, int x, int y)
{
    push(v);
    int l = TL[v], r = TR[v];
    if (r < x || y < l) return;
    if (x <= l && r <= y) { A[v] = r-l+1; push(v); return; }
    ripe(L[v], x, y), ripe(R[v], x, y); A[v] = A[L[v]] + A[R[v]];
}

int query(int v, int x, int y)
{
    push(v);
    int l = TL[v], r = TR[v];
    if (r < x || y < l) return 0;
    if (x <= l && r <= y) return A[v];
    assert(l!=r);
    return query(L[v], x, y) + query(R[v], x, y);
}

int main()
{
    sparse0(1, 1e9, 0);
    ShinLena;
    int m = 1, d, x, y, c = 0;
    for (cin >> m; m--;)
    {
        cin >> d >> x >> y;
        if (d == 1) cout << (c = query(1, x+c, y+c)) << '\n';
        else ripe(1, x+c, y+c);
    }
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 10 ms 13660 KB Output is correct
5 Correct 14 ms 13768 KB Output is correct
6 Correct 12 ms 13656 KB Output is correct
7 Correct 12 ms 13660 KB Output is correct
8 Correct 82 ms 44116 KB Output is correct
9 Correct 192 ms 65104 KB Output is correct
10 Correct 193 ms 68356 KB Output is correct
11 Correct 192 ms 75600 KB Output is correct
12 Correct 206 ms 78504 KB Output is correct
13 Correct 169 ms 96084 KB Output is correct
14 Correct 180 ms 96252 KB Output is correct
15 Correct 270 ms 169976 KB Output is correct
16 Correct 257 ms 170324 KB Output is correct
17 Correct 173 ms 100948 KB Output is correct
18 Correct 210 ms 100980 KB Output is correct
19 Correct 259 ms 173140 KB Output is correct
20 Correct 262 ms 173364 KB Output is correct