oj.uz

Submission #717526

# Submission time Handle Problem Language Result Execution time Memory
717526 2023-04-02T04:50:38 Z walterw Two Antennas (JOI19_antennas) C++17
100 / 100
 599 ms 69476 KB 
#include "bits/stdc++.h"

using namespace std;

void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.first >> a.second;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.first << ", " << a.second << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}

#ifdef local
#define test(args...) abc("[" + string(#args) + "]", args)
#else
#define test(args...) void(0)
#endif

using ll = long long;

#define int ll

int H[200005], A[200005], B[200005];

struct event {
    int time, idx, height; bool add;

    bool operator<(event o) const {

        return time < o.time;
    }
};

vector<event> events;

pair<int, int> vals[4 * 200005];
int ans[4 * 200005];
pair<int, int> qs[4 * 200005];
const pair<int, int> null = {1e16, 0};

void build() {
    fill(ans, ans+ 4 * 200005, -1);
    for (int i = 1; i < 4 * 200005; i++) {
        vals[i] = qs[i] = null;
    }
}

pair<int, int> comb(pair<int, int> a, pair<int, int> b) {
    return {min(a.first, b.first), max(a.second, b.second)};
}

int eval(pair<int, int> vals, pair<int, int> qs) {
    int res = - 1;

    if (qs.first < (ll) 1e16) {
        if (vals.first < (ll) 1e16) res = max(res, abs(qs.first - vals.first));
        if (vals.second > 0) res = max(res, abs(qs.first - vals.second));
    }
    if (qs.second > 0) {
        if (vals.first < (ll) 1e16) res = max(res, abs(qs.second - vals.first));
        if (vals.second > 0) res = max(res, abs(qs.second - vals.second));
    }

    return res;
}

void push(int x) {
    if (qs[x] != null) {
        ans[2 * x] = max(ans[2 * x], eval(vals[2 * x], qs[x]));
        qs[2 * x] = comb(qs[2 * x], qs[x]);

        ans[2 * x + 1] = max(ans[2 * x + 1], eval(vals[2 * x + 1], qs[x]));
        qs[2 * x + 1] = comb(qs[2 * x + 1], qs[x]);

        qs[x] = null;
    }
}

void update(int x, int l, int r, int idx, int h) {
    if (l == r) {
        if (h) vals[x] = {h, h};
        else vals[x] = null;
        return;
    }

    push(x);
    int mid = (l + r) / 2;
    if (idx <= mid) update(2 * x, l, mid, idx, h);
    else update(2 * x + 1, mid + 1, r, idx, h);

    vals[x] = comb(vals[2 * x], vals[2 * x + 1]);
    ans[x] = max(ans[2 * x], ans[2 * x + 1]);
}

void updatequery(int x, int l, int r, int ql, int qr, int curh) {
    if (ql <= l && r <= qr) {
        // fully within
        ans[x] = max(ans[x], eval(vals[x], {curh, curh}));
        qs[x] = comb(qs[x], {curh, curh});
        return;
    }

    if (l > qr || ql > r) return;

    int mid = (l + r) / 2;
    push(x);

    updatequery(2 * x, l, mid, ql, qr , curh);
    updatequery(2 * x + 1, mid + 1, r, ql, qr, curh);

    vals[x] = comb(vals[2 * x], vals[2 * x + 1]);
    ans[x] = max(ans[2 * x], ans[2 * x + 1]);
}

int query(int x, int l, int r, int ql, int qr) {
    if (ql <= l && r <= qr) return ans[x];
    if (l > qr || ql > r) return -1;

    int mid = (l + r) / 2;
    push(x);

    int ans1 = query(2 * x, l, mid, ql, qr);
    int ans2 = query(2 * x + 1, mid + 1, r, ql, qr);

    vals[x] = comb(vals[2 * x], vals[2 * x + 1]);
    ans[x] = max(ans[2 * x], ans[2 * x + 1]);

    return max(ans1, ans2);
}


vector<pair<int, int>> queries[200005];
int toprint[200005];

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    int n; cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> H[i] >> A[i] >> B[i];
    }

    int q; cin >> q;
    for (int i = 1; i <= q; i++) {
        int a, b; cin >> a >> b;
        queries[b].emplace_back(a, i);
    }

    for (int i = 1; i <= n; i++) {
        events.push_back({i + A[i], i,  H[i], true});
        events.push_back({i + B[i] + 1, i, H[i], false});
    }

    sort(events.begin(), events.end());
    int idx = 0;

    build();

    for (int i = 1; i <= n; i++) {
        while (idx < events.size() && events[idx].time == i) {
            if (events[idx].add) {
                update(1, 1, n, events[idx].idx, events[idx].height);
            } else {
                update(1, 1, n, events[idx].idx, 0);
            }

            idx++;
        }

        if (i - A[i] >= 1) updatequery(1, 1, n, max((ll) 1, i - B[i]), max((ll) 1, i - A[i]), H[i]);

        for (auto [l, id] : queries[i]) {
            toprint[id] = query(1, 1, n, l, i);
        }
    }

    for (int i = 1; i <= q; i++) {
        cout << toprint[i] << "\n";
    }

}

Compilation message

antennas.cpp: In function 'int32_t main()':
antennas.cpp:173:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<event>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |         while (idx < events.size() && events[idx].time == i) {
      |                ~~~~^~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36308 KB Output is correct
2 Correct 17 ms 36436 KB Output is correct
3 Correct 17 ms 36300 KB Output is correct
4 Correct 16 ms 36412 KB Output is correct
5 Correct 16 ms 36308 KB Output is correct
6 Correct 16 ms 36340 KB Output is correct
7 Correct 17 ms 36396 KB Output is correct
8 Correct 16 ms 36436 KB Output is correct
9 Correct 17 ms 36308 KB Output is correct
10 Correct 18 ms 36404 KB Output is correct
11 Correct 16 ms 36328 KB Output is correct
12 Correct 17 ms 36412 KB Output is correct
13 Correct 17 ms 36360 KB Output is correct
14 Correct 17 ms 36288 KB Output is correct
15 Correct 17 ms 36400 KB Output is correct
16 Correct 17 ms 36308 KB Output is correct
17 Correct 16 ms 36404 KB Output is correct
18 Correct 17 ms 36360 KB Output is correct
19 Correct 16 ms 36404 KB Output is correct
20 Correct 20 ms 36404 KB Output is correct
21 Correct 16 ms 36308 KB Output is correct
22 Correct 16 ms 36308 KB Output is correct
23 Correct 17 ms 36308 KB Output is correct
24 Correct 17 ms 36380 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36308 KB Output is correct
2 Correct 17 ms 36436 KB Output is correct
3 Correct 17 ms 36300 KB Output is correct
4 Correct 16 ms 36412 KB Output is correct
5 Correct 16 ms 36308 KB Output is correct
6 Correct 16 ms 36340 KB Output is correct
7 Correct 17 ms 36396 KB Output is correct
8 Correct 16 ms 36436 KB Output is correct
9 Correct 17 ms 36308 KB Output is correct
10 Correct 18 ms 36404 KB Output is correct
11 Correct 16 ms 36328 KB Output is correct
12 Correct 17 ms 36412 KB Output is correct
13 Correct 17 ms 36360 KB Output is correct
14 Correct 17 ms 36288 KB Output is correct
15 Correct 17 ms 36400 KB Output is correct
16 Correct 17 ms 36308 KB Output is correct
17 Correct 16 ms 36404 KB Output is correct
18 Correct 17 ms 36360 KB Output is correct
19 Correct 16 ms 36404 KB Output is correct
20 Correct 20 ms 36404 KB Output is correct
21 Correct 16 ms 36308 KB Output is correct
22 Correct 16 ms 36308 KB Output is correct
23 Correct 17 ms 36308 KB Output is correct
24 Correct 17 ms 36380 KB Output is correct
25 Correct 82 ms 43636 KB Output is correct
26 Correct 27 ms 37332 KB Output is correct
27 Correct 118 ms 46544 KB Output is correct
28 Correct 124 ms 46680 KB Output is correct
29 Correct 81 ms 43488 KB Output is correct
30 Correct 86 ms 43300 KB Output is correct
31 Correct 93 ms 45176 KB Output is correct
32 Correct 115 ms 46732 KB Output is correct
33 Correct 128 ms 45972 KB Output is correct
34 Correct 65 ms 41424 KB Output is correct
35 Correct 115 ms 46364 KB Output is correct
36 Correct 115 ms 46660 KB Output is correct
37 Correct 71 ms 41804 KB Output is correct
38 Correct 110 ms 45668 KB Output is correct
39 Correct 32 ms 37832 KB Output is correct
40 Correct 111 ms 45716 KB Output is correct
41 Correct 94 ms 43212 KB Output is correct
42 Correct 108 ms 45664 KB Output is correct
43 Correct 49 ms 39588 KB Output is correct
44 Correct 111 ms 45724 KB Output is correct
45 Correct 36 ms 38168 KB Output is correct
46 Correct 110 ms 45736 KB Output is correct
47 Correct 49 ms 38960 KB Output is correct
48 Correct 116 ms 45728 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 51848 KB Output is correct
2 Correct 354 ms 53684 KB Output is correct
3 Correct 219 ms 48508 KB Output is correct
4 Correct 316 ms 53584 KB Output is correct
5 Correct 141 ms 44396 KB Output is correct
6 Correct 305 ms 53656 KB Output is correct
7 Correct 303 ms 51392 KB Output is correct
8 Correct 311 ms 53640 KB Output is correct
9 Correct 49 ms 39168 KB Output is correct
10 Correct 317 ms 53676 KB Output is correct
11 Correct 187 ms 47196 KB Output is correct
12 Correct 306 ms 53608 KB Output is correct
13 Correct 186 ms 53624 KB Output is correct
14 Correct 174 ms 53648 KB Output is correct
15 Correct 192 ms 53660 KB Output is correct
16 Correct 216 ms 53552 KB Output is correct
17 Correct 186 ms 53688 KB Output is correct
18 Correct 179 ms 53656 KB Output is correct
19 Correct 180 ms 53676 KB Output is correct
20 Correct 179 ms 53588 KB Output is correct
21 Correct 173 ms 53676 KB Output is correct
22 Correct 192 ms 53608 KB Output is correct
23 Correct 178 ms 53660 KB Output is correct
24 Correct 189 ms 53680 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36308 KB Output is correct
2 Correct 17 ms 36436 KB Output is correct
3 Correct 17 ms 36300 KB Output is correct
4 Correct 16 ms 36412 KB Output is correct
5 Correct 16 ms 36308 KB Output is correct
6 Correct 16 ms 36340 KB Output is correct
7 Correct 17 ms 36396 KB Output is correct
8 Correct 16 ms 36436 KB Output is correct
9 Correct 17 ms 36308 KB Output is correct
10 Correct 18 ms 36404 KB Output is correct
11 Correct 16 ms 36328 KB Output is correct
12 Correct 17 ms 36412 KB Output is correct
13 Correct 17 ms 36360 KB Output is correct
14 Correct 17 ms 36288 KB Output is correct
15 Correct 17 ms 36400 KB Output is correct
16 Correct 17 ms 36308 KB Output is correct
17 Correct 16 ms 36404 KB Output is correct
18 Correct 17 ms 36360 KB Output is correct
19 Correct 16 ms 36404 KB Output is correct
20 Correct 20 ms 36404 KB Output is correct
21 Correct 16 ms 36308 KB Output is correct
22 Correct 16 ms 36308 KB Output is correct
23 Correct 17 ms 36308 KB Output is correct
24 Correct 17 ms 36380 KB Output is correct
25 Correct 82 ms 43636 KB Output is correct
26 Correct 27 ms 37332 KB Output is correct
27 Correct 118 ms 46544 KB Output is correct
28 Correct 124 ms 46680 KB Output is correct
29 Correct 81 ms 43488 KB Output is correct
30 Correct 86 ms 43300 KB Output is correct
31 Correct 93 ms 45176 KB Output is correct
32 Correct 115 ms 46732 KB Output is correct
33 Correct 128 ms 45972 KB Output is correct
34 Correct 65 ms 41424 KB Output is correct
35 Correct 115 ms 46364 KB Output is correct
36 Correct 115 ms 46660 KB Output is correct
37 Correct 71 ms 41804 KB Output is correct
38 Correct 110 ms 45668 KB Output is correct
39 Correct 32 ms 37832 KB Output is correct
40 Correct 111 ms 45716 KB Output is correct
41 Correct 94 ms 43212 KB Output is correct
42 Correct 108 ms 45664 KB Output is correct
43 Correct 49 ms 39588 KB Output is correct
44 Correct 111 ms 45724 KB Output is correct
45 Correct 36 ms 38168 KB Output is correct
46 Correct 110 ms 45736 KB Output is correct
47 Correct 49 ms 38960 KB Output is correct
48 Correct 116 ms 45728 KB Output is correct
49 Correct 280 ms 51848 KB Output is correct
50 Correct 354 ms 53684 KB Output is correct
51 Correct 219 ms 48508 KB Output is correct
52 Correct 316 ms 53584 KB Output is correct
53 Correct 141 ms 44396 KB Output is correct
54 Correct 305 ms 53656 KB Output is correct
55 Correct 303 ms 51392 KB Output is correct
56 Correct 311 ms 53640 KB Output is correct
57 Correct 49 ms 39168 KB Output is correct
58 Correct 317 ms 53676 KB Output is correct
59 Correct 187 ms 47196 KB Output is correct
60 Correct 306 ms 53608 KB Output is correct
61 Correct 186 ms 53624 KB Output is correct
62 Correct 174 ms 53648 KB Output is correct
63 Correct 192 ms 53660 KB Output is correct
64 Correct 216 ms 53552 KB Output is correct
65 Correct 186 ms 53688 KB Output is correct
66 Correct 179 ms 53656 KB Output is correct
67 Correct 180 ms 53676 KB Output is correct
68 Correct 179 ms 53588 KB Output is correct
69 Correct 173 ms 53676 KB Output is correct
70 Correct 192 ms 53608 KB Output is correct
71 Correct 178 ms 53660 KB Output is correct
72 Correct 189 ms 53680 KB Output is correct
73 Correct 509 ms 64416 KB Output is correct
74 Correct 386 ms 59108 KB Output is correct
75 Correct 466 ms 62768 KB Output is correct
76 Correct 564 ms 69448 KB Output is correct
77 Correct 299 ms 54456 KB Output is correct
78 Correct 489 ms 65800 KB Output is correct
79 Correct 516 ms 66480 KB Output is correct
80 Correct 599 ms 69476 KB Output is correct
81 Correct 210 ms 50104 KB Output is correct
82 Correct 447 ms 63784 KB Output is correct
83 Correct 421 ms 60996 KB Output is correct
84 Correct 548 ms 69460 KB Output is correct
85 Correct 320 ms 63948 KB Output is correct
86 Correct 410 ms 68180 KB Output is correct
87 Correct 208 ms 59536 KB Output is correct
88 Correct 389 ms 68176 KB Output is correct
89 Correct 402 ms 65480 KB Output is correct
90 Correct 399 ms 68216 KB Output is correct
91 Correct 261 ms 61552 KB Output is correct
92 Correct 408 ms 68156 KB Output is correct
93 Correct 235 ms 59900 KB Output is correct
94 Correct 401 ms 68112 KB Output is correct
95 Correct 239 ms 60784 KB Output is correct
96 Correct 363 ms 68212 KB Output is correct