oj.uz

Submission #104558

# Submission time Handle Problem Language Result Execution time Memory
104558 2019-04-08T03:31:25 Z minhtung0404 Two Antennas (JOI19_antennas) C++17
100 / 100
 853 ms 61704 KB 
#include<bits/stdc++.h>
#define int long long
const int N = 2e5 + 5;
const int inf = 2e9;
using namespace std;

struct query{
    int l, r, id;

    bool operator < (const query&a) const{
        return r < a.r;
    }
} qu[N];

vector <int> mv[2][N];
typedef pair <int, int> ii;
ii it[N << 2], lazy[N << 2];
int n, q, Max[N << 2], h[N], a[N], b[N], ans[N];

ii up(ii a, ii b){
    return ii(min(a.first, b.first), max(a.second, b.second));
}

void dolazy(int i, int l, int r){
    if (lazy[i] == ii(inf, -inf)) return;
    if (l != r){
        lazy[i << 1] = up(lazy[i << 1], lazy[i]);
        lazy[i << 1 | 1] = up(lazy[i << 1 | 1], lazy[i]);
    }
    Max[i] = max(Max[i], max(lazy[i].second - it[i].first, it[i].second - lazy[i].first));
    lazy[i] = ii(inf, -inf);
}

void update_h(int i, int l, int r, int pos, ii val){
    dolazy(i, l, r);
    if (l > pos || pos > r || l > r) return;
    if (l == r){
        it[i] = val;
        return;
    }
    int mid = (l + r) >> 1;
    update_h(i << 1, l, mid, pos, val); update_h(i << 1 | 1, mid+1, r, pos, val);
    it[i] = up(it[i << 1], it[i << 1 | 1]);
}

void update(int i, int l, int r, int L, int R, int val){
    dolazy(i, l, r);
    if (L > r || l > R || l > r || L > R) return;
    if (L <= l && r <= R){
        lazy[i] = ii(val, val);
        dolazy(i, l, r);
        return;
    }
    int mid = (l + r) >> 1;
    update(i << 1, l, mid, L, R, val); update(i << 1 | 1, mid+1, r, L, R, val);
    Max[i] = max(Max[i << 1], Max[i << 1 | 1]);
}

int get(int i, int l, int r, int L, int R){
    dolazy(i, l, r);
    if (L > r || l > R || l > r || L > R) return -1;
    if (L <= l && r <= R) return Max[i];
    int mid = (l + r) >> 1;
    return max(get(i << 1, l, mid, L, R), get(i << 1 | 1, mid+1, r, L, R));
}

void add(int pos){
    int l = max(1LL, pos - b[pos]), r = max(0LL, pos - a[pos]);

    for (auto p : mv[0][pos]) update_h(1, 1, n, p, ii(h[p], h[p]));
    for (auto p : mv[1][pos]) update_h(1, 1, n, p, ii(inf, -inf));

    update(1, 1, n, l, r, h[pos]);

    l = min(n+1, pos + a[pos]), r = min(n, pos + b[pos]);
    mv[0][l].push_back(pos);
    mv[1][r+1].push_back(pos);
}

signed main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    for (int i = 0; i < N << 2; i++) it[i] = lazy[i] = ii(inf, -inf), Max[i] = -1;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> h[i] >> a[i] >> b[i];
    cin >> q;
    for (int i = 1; i <= q; i++){
        cin >> qu[i].l >> qu[i].r;
        qu[i].id = i;
    }
    sort(qu+1, qu+1+q);
    int cur = 1;
    for (int i = 1; i <= q; i++){
        while (cur <= qu[i].r) add(cur++);
        ans[qu[i].id] = get(1, 1, n, qu[i].l, qu[i].r);
    }
    for (int i = 1; i <= q; i++) cout << ans[i] << "\n";
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 41080 KB Output is correct
2 Correct 35 ms 41080 KB Output is correct
3 Correct 36 ms 41208 KB Output is correct
4 Correct 35 ms 41080 KB Output is correct
5 Correct 42 ms 41080 KB Output is correct
6 Correct 35 ms 41084 KB Output is correct
7 Correct 36 ms 41100 KB Output is correct
8 Correct 41 ms 41044 KB Output is correct
9 Correct 34 ms 41080 KB Output is correct
10 Correct 41 ms 41084 KB Output is correct
11 Correct 38 ms 41080 KB Output is correct
12 Correct 37 ms 41088 KB Output is correct
13 Correct 37 ms 41080 KB Output is correct
14 Correct 39 ms 41080 KB Output is correct
15 Correct 38 ms 41080 KB Output is correct
16 Correct 38 ms 41080 KB Output is correct
17 Correct 36 ms 41080 KB Output is correct
18 Correct 38 ms 41088 KB Output is correct
19 Correct 41 ms 41248 KB Output is correct
20 Correct 41 ms 41216 KB Output is correct
21 Correct 45 ms 41208 KB Output is correct
22 Correct 38 ms 41080 KB Output is correct
23 Correct 38 ms 41080 KB Output is correct
24 Correct 38 ms 41132 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 41080 KB Output is correct
2 Correct 35 ms 41080 KB Output is correct
3 Correct 36 ms 41208 KB Output is correct
4 Correct 35 ms 41080 KB Output is correct
5 Correct 42 ms 41080 KB Output is correct
6 Correct 35 ms 41084 KB Output is correct
7 Correct 36 ms 41100 KB Output is correct
8 Correct 41 ms 41044 KB Output is correct
9 Correct 34 ms 41080 KB Output is correct
10 Correct 41 ms 41084 KB Output is correct
11 Correct 38 ms 41080 KB Output is correct
12 Correct 37 ms 41088 KB Output is correct
13 Correct 37 ms 41080 KB Output is correct
14 Correct 39 ms 41080 KB Output is correct
15 Correct 38 ms 41080 KB Output is correct
16 Correct 38 ms 41080 KB Output is correct
17 Correct 36 ms 41080 KB Output is correct
18 Correct 38 ms 41088 KB Output is correct
19 Correct 41 ms 41248 KB Output is correct
20 Correct 41 ms 41216 KB Output is correct
21 Correct 45 ms 41208 KB Output is correct
22 Correct 38 ms 41080 KB Output is correct
23 Correct 38 ms 41080 KB Output is correct
24 Correct 38 ms 41132 KB Output is correct
25 Correct 170 ms 48148 KB Output is correct
26 Correct 46 ms 41976 KB Output is correct
27 Correct 166 ms 50780 KB Output is correct
28 Correct 185 ms 50676 KB Output is correct
29 Correct 130 ms 48120 KB Output is correct
30 Correct 148 ms 47748 KB Output is correct
31 Correct 143 ms 50332 KB Output is correct
32 Correct 196 ms 50680 KB Output is correct
33 Correct 166 ms 50296 KB Output is correct
34 Correct 110 ms 45948 KB Output is correct
35 Correct 177 ms 50680 KB Output is correct
36 Correct 236 ms 50652 KB Output is correct
37 Correct 131 ms 46308 KB Output is correct
38 Correct 170 ms 49732 KB Output is correct
39 Correct 53 ms 42360 KB Output is correct
40 Correct 178 ms 49832 KB Output is correct
41 Correct 141 ms 47740 KB Output is correct
42 Correct 181 ms 49784 KB Output is correct
43 Correct 87 ms 44120 KB Output is correct
44 Correct 172 ms 49648 KB Output is correct
45 Correct 68 ms 42656 KB Output is correct
46 Correct 181 ms 49792 KB Output is correct
47 Correct 75 ms 43384 KB Output is correct
48 Correct 198 ms 49804 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 469 ms 53384 KB Output is correct
2 Correct 463 ms 54232 KB Output is correct
3 Correct 295 ms 50428 KB Output is correct
4 Correct 486 ms 54252 KB Output is correct
5 Correct 203 ms 47984 KB Output is correct
6 Correct 516 ms 54172 KB Output is correct
7 Correct 407 ms 51832 KB Output is correct
8 Correct 522 ms 54136 KB Output is correct
9 Correct 93 ms 43512 KB Output is correct
10 Correct 443 ms 54248 KB Output is correct
11 Correct 267 ms 49392 KB Output is correct
12 Correct 441 ms 54124 KB Output is correct
13 Correct 217 ms 51300 KB Output is correct
14 Correct 209 ms 52180 KB Output is correct
15 Correct 219 ms 51088 KB Output is correct
16 Correct 207 ms 51568 KB Output is correct
17 Correct 216 ms 51316 KB Output is correct
18 Correct 204 ms 51560 KB Output is correct
19 Correct 336 ms 51632 KB Output is correct
20 Correct 254 ms 51180 KB Output is correct
21 Correct 233 ms 51680 KB Output is correct
22 Correct 240 ms 51824 KB Output is correct
23 Correct 213 ms 51432 KB Output is correct
24 Correct 216 ms 51860 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 41080 KB Output is correct
2 Correct 35 ms 41080 KB Output is correct
3 Correct 36 ms 41208 KB Output is correct
4 Correct 35 ms 41080 KB Output is correct
5 Correct 42 ms 41080 KB Output is correct
6 Correct 35 ms 41084 KB Output is correct
7 Correct 36 ms 41100 KB Output is correct
8 Correct 41 ms 41044 KB Output is correct
9 Correct 34 ms 41080 KB Output is correct
10 Correct 41 ms 41084 KB Output is correct
11 Correct 38 ms 41080 KB Output is correct
12 Correct 37 ms 41088 KB Output is correct
13 Correct 37 ms 41080 KB Output is correct
14 Correct 39 ms 41080 KB Output is correct
15 Correct 38 ms 41080 KB Output is correct
16 Correct 38 ms 41080 KB Output is correct
17 Correct 36 ms 41080 KB Output is correct
18 Correct 38 ms 41088 KB Output is correct
19 Correct 41 ms 41248 KB Output is correct
20 Correct 41 ms 41216 KB Output is correct
21 Correct 45 ms 41208 KB Output is correct
22 Correct 38 ms 41080 KB Output is correct
23 Correct 38 ms 41080 KB Output is correct
24 Correct 38 ms 41132 KB Output is correct
25 Correct 170 ms 48148 KB Output is correct
26 Correct 46 ms 41976 KB Output is correct
27 Correct 166 ms 50780 KB Output is correct
28 Correct 185 ms 50676 KB Output is correct
29 Correct 130 ms 48120 KB Output is correct
30 Correct 148 ms 47748 KB Output is correct
31 Correct 143 ms 50332 KB Output is correct
32 Correct 196 ms 50680 KB Output is correct
33 Correct 166 ms 50296 KB Output is correct
34 Correct 110 ms 45948 KB Output is correct
35 Correct 177 ms 50680 KB Output is correct
36 Correct 236 ms 50652 KB Output is correct
37 Correct 131 ms 46308 KB Output is correct
38 Correct 170 ms 49732 KB Output is correct
39 Correct 53 ms 42360 KB Output is correct
40 Correct 178 ms 49832 KB Output is correct
41 Correct 141 ms 47740 KB Output is correct
42 Correct 181 ms 49784 KB Output is correct
43 Correct 87 ms 44120 KB Output is correct
44 Correct 172 ms 49648 KB Output is correct
45 Correct 68 ms 42656 KB Output is correct
46 Correct 181 ms 49792 KB Output is correct
47 Correct 75 ms 43384 KB Output is correct
48 Correct 198 ms 49804 KB Output is correct
49 Correct 469 ms 53384 KB Output is correct
50 Correct 463 ms 54232 KB Output is correct
51 Correct 295 ms 50428 KB Output is correct
52 Correct 486 ms 54252 KB Output is correct
53 Correct 203 ms 47984 KB Output is correct
54 Correct 516 ms 54172 KB Output is correct
55 Correct 407 ms 51832 KB Output is correct
56 Correct 522 ms 54136 KB Output is correct
57 Correct 93 ms 43512 KB Output is correct
58 Correct 443 ms 54248 KB Output is correct
59 Correct 267 ms 49392 KB Output is correct
60 Correct 441 ms 54124 KB Output is correct
61 Correct 217 ms 51300 KB Output is correct
62 Correct 209 ms 52180 KB Output is correct
63 Correct 219 ms 51088 KB Output is correct
64 Correct 207 ms 51568 KB Output is correct
65 Correct 216 ms 51316 KB Output is correct
66 Correct 204 ms 51560 KB Output is correct
67 Correct 336 ms 51632 KB Output is correct
68 Correct 254 ms 51180 KB Output is correct
69 Correct 233 ms 51680 KB Output is correct
70 Correct 240 ms 51824 KB Output is correct
71 Correct 213 ms 51432 KB Output is correct
72 Correct 216 ms 51860 KB Output is correct
73 Correct 743 ms 58664 KB Output is correct
74 Correct 512 ms 54636 KB Output is correct
75 Correct 731 ms 58236 KB Output is correct
76 Correct 853 ms 61692 KB Output is correct
77 Correct 519 ms 53668 KB Output is correct
78 Correct 677 ms 58968 KB Output is correct
79 Correct 708 ms 59872 KB Output is correct
80 Correct 825 ms 61704 KB Output is correct
81 Correct 319 ms 52320 KB Output is correct
82 Correct 611 ms 57268 KB Output is correct
83 Correct 513 ms 57324 KB Output is correct
84 Correct 745 ms 61464 KB Output is correct
85 Correct 449 ms 55276 KB Output is correct
86 Correct 499 ms 58416 KB Output is correct
87 Correct 272 ms 51872 KB Output is correct
88 Correct 513 ms 58348 KB Output is correct
89 Correct 539 ms 56348 KB Output is correct
90 Correct 470 ms 58120 KB Output is correct
91 Correct 335 ms 53736 KB Output is correct
92 Correct 638 ms 57936 KB Output is correct
93 Correct 313 ms 52696 KB Output is correct
94 Correct 524 ms 58128 KB Output is correct
95 Correct 294 ms 53056 KB Output is correct
96 Correct 505 ms 58640 KB Output is correct