oj.uz

답안 #743843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743843 2023-05-18T04:50:45 Z nguyentunglam Two Antennas (JOI19_antennas) C++17
100 / 100
 597 ms 38196 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 2e5 + 10;
int h[N], a[N], b[N], T[N << 2], mx[N << 2], mn[N << 2], ans[N];
vector<ii> query[N], event[N];
int n;
void push(int s, int l, int r) {
    T[s] = max(T[s], mx[s] - mn[s]);
    if (l != r) {
        mx[s << 1] = max(mx[s << 1], mx[s]);
        mx[s << 1 | 1] = max(mx[s << 1 | 1], mx[s]);
    }
    mx[s] = 0;
}
void upval (int s, int l, int r, int pos, int val) {
    push(s, l, r);
    if (l == r) {
        mn[s] = val;
        return;
    }
    int mid = l + r >> 1;
    if (pos <= mid) upval(s << 1, l, mid, pos, val);
    else upval(s << 1 | 1, mid + 1, r, pos, val);
    mn[s] = min(mn[s << 1], mn[s << 1 | 1]);
}
void upans (int s, int l, int r, int from, int to, int val) {
    push(s, l, r);
    if (l > to || r < from) return;
    if (from <= l && r <= to) {
        mx[s] = val;
        push(s, l, r);
        return;
    }
    int mid = l + r >> 1;
    upans(s << 1, l, mid, from, to, val);
    upans(s << 1 | 1, mid + 1, r, from, to, val);
    T[s] = max(T[s << 1], T[s << 1 | 1]);
}
int get(int s, int l, int r, int from, int to) {
    push(s, l, r);
    if (l > to || r < from) return -1;
    if (from <= l && r <= to) return T[s];
    int mid = l + r >> 1;
    return max(get(s << 1, l, mid, from, to), get(s << 1 | 1, mid + 1, r, from, to));
}
void solve() {
    for(int i = 1; i <= 4 * n; i++) T[i] = -1, mx[i] = 0, mn[i] = 1e9;

    for(int i = 1; i <= n; i++) {
        if (i + a[i] <= n) event[i + a[i]].emplace_back(i, h[i]);
        if (i + b[i] + 1 <= n) event[i + b[i] + 1].emplace_back(i, 1e9);
    }
    for(int r = 1; r <= n; r++) {
        for(auto &[pos, val] : event[r]) upval(1, 1, n, pos, val);
        upans(1, 1, n, r - b[r], r - a[r], h[r]);
        for(auto &[l, idx] : query[r]) ans[idx] = max(ans[idx], get(1, 1, n, l, n));
        event[r].clear();
    }
}
int main() {
    #define task ""
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen ("task.inp", "r")) {
        freopen ("task.inp", "r", stdin);
        freopen ("task.out", "w", stdout);
    }
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    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 l, r; cin >> l >> r;
        query[r].emplace_back(l, i);
        ans[i] = -1;
    }
    solve();
    for(int i = 1; i <= n; i++) h[i] = 1e9 - h[i];
    solve();
    for(int i = 1; i <= q; i++) cout << ans[i] << endl;
}

Compilation message

antennas.cpp: In function 'void upval(int, int, int, int, int)':
antennas.cpp:25:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |     int mid = l + r >> 1;
      |               ~~^~~
antennas.cpp: In function 'void upans(int, int, int, int, int, int)':
antennas.cpp:38:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |     int mid = l + r >> 1;
      |               ~~^~~
antennas.cpp: In function 'int get(int, int, int, int, int)':
antennas.cpp:47:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 |     int mid = l + r >> 1;
      |               ~~^~~
antennas.cpp: In function 'int main()':
antennas.cpp:68:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         freopen ("task.inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:69:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |         freopen ("task.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:72:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:73:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9744 KB Output is correct
4 Correct 5 ms 9732 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9692 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 6 ms 9728 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 7 ms 9684 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 6 ms 9756 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
16 Correct 7 ms 9684 KB Output is correct
17 Correct 6 ms 9788 KB Output is correct
18 Correct 6 ms 9780 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 6 ms 9736 KB Output is correct
21 Correct 5 ms 9736 KB Output is correct
22 Correct 6 ms 9796 KB Output is correct
23 Correct 5 ms 9732 KB Output is correct
24 Correct 6 ms 9728 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9744 KB Output is correct
4 Correct 5 ms 9732 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9692 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 6 ms 9728 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 7 ms 9684 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 6 ms 9756 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
16 Correct 7 ms 9684 KB Output is correct
17 Correct 6 ms 9788 KB Output is correct
18 Correct 6 ms 9780 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 6 ms 9736 KB Output is correct
21 Correct 5 ms 9736 KB Output is correct
22 Correct 6 ms 9796 KB Output is correct
23 Correct 5 ms 9732 KB Output is correct
24 Correct 6 ms 9728 KB Output is correct
25 Correct 84 ms 14404 KB Output is correct
26 Correct 16 ms 10432 KB Output is correct
27 Correct 117 ms 15872 KB Output is correct
28 Correct 148 ms 15836 KB Output is correct
29 Correct 85 ms 14440 KB Output is correct
30 Correct 81 ms 14092 KB Output is correct
31 Correct 102 ms 15208 KB Output is correct
32 Correct 147 ms 15864 KB Output is correct
33 Correct 105 ms 15564 KB Output is correct
34 Correct 59 ms 13116 KB Output is correct
35 Correct 133 ms 15852 KB Output is correct
36 Correct 117 ms 15868 KB Output is correct
37 Correct 68 ms 13132 KB Output is correct
38 Correct 155 ms 14924 KB Output is correct
39 Correct 22 ms 10640 KB Output is correct
40 Correct 115 ms 14892 KB Output is correct
41 Correct 86 ms 13816 KB Output is correct
42 Correct 146 ms 15032 KB Output is correct
43 Correct 44 ms 11820 KB Output is correct
44 Correct 116 ms 14952 KB Output is correct
45 Correct 33 ms 10828 KB Output is correct
46 Correct 137 ms 14896 KB Output is correct
47 Correct 34 ms 11356 KB Output is correct
48 Correct 121 ms 14952 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 300 ms 24172 KB Output is correct
2 Correct 295 ms 29136 KB Output is correct
3 Correct 212 ms 23328 KB Output is correct
4 Correct 286 ms 29100 KB Output is correct
5 Correct 123 ms 18588 KB Output is correct
6 Correct 309 ms 29132 KB Output is correct
7 Correct 233 ms 26576 KB Output is correct
8 Correct 364 ms 29140 KB Output is correct
9 Correct 41 ms 12656 KB Output is correct
10 Correct 292 ms 29052 KB Output is correct
11 Correct 167 ms 21948 KB Output is correct
12 Correct 318 ms 29088 KB Output is correct
13 Correct 272 ms 27668 KB Output is correct
14 Correct 210 ms 27632 KB Output is correct
15 Correct 212 ms 27852 KB Output is correct
16 Correct 179 ms 28244 KB Output is correct
17 Correct 260 ms 27924 KB Output is correct
18 Correct 222 ms 28328 KB Output is correct
19 Correct 224 ms 27720 KB Output is correct
20 Correct 216 ms 27880 KB Output is correct
21 Correct 262 ms 27332 KB Output is correct
22 Correct 246 ms 27624 KB Output is correct
23 Correct 220 ms 27632 KB Output is correct
24 Correct 193 ms 27868 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9744 KB Output is correct
4 Correct 5 ms 9732 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9692 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 6 ms 9728 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 7 ms 9684 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 6 ms 9756 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
16 Correct 7 ms 9684 KB Output is correct
17 Correct 6 ms 9788 KB Output is correct
18 Correct 6 ms 9780 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 6 ms 9736 KB Output is correct
21 Correct 5 ms 9736 KB Output is correct
22 Correct 6 ms 9796 KB Output is correct
23 Correct 5 ms 9732 KB Output is correct
24 Correct 6 ms 9728 KB Output is correct
25 Correct 84 ms 14404 KB Output is correct
26 Correct 16 ms 10432 KB Output is correct
27 Correct 117 ms 15872 KB Output is correct
28 Correct 148 ms 15836 KB Output is correct
29 Correct 85 ms 14440 KB Output is correct
30 Correct 81 ms 14092 KB Output is correct
31 Correct 102 ms 15208 KB Output is correct
32 Correct 147 ms 15864 KB Output is correct
33 Correct 105 ms 15564 KB Output is correct
34 Correct 59 ms 13116 KB Output is correct
35 Correct 133 ms 15852 KB Output is correct
36 Correct 117 ms 15868 KB Output is correct
37 Correct 68 ms 13132 KB Output is correct
38 Correct 155 ms 14924 KB Output is correct
39 Correct 22 ms 10640 KB Output is correct
40 Correct 115 ms 14892 KB Output is correct
41 Correct 86 ms 13816 KB Output is correct
42 Correct 146 ms 15032 KB Output is correct
43 Correct 44 ms 11820 KB Output is correct
44 Correct 116 ms 14952 KB Output is correct
45 Correct 33 ms 10828 KB Output is correct
46 Correct 137 ms 14896 KB Output is correct
47 Correct 34 ms 11356 KB Output is correct
48 Correct 121 ms 14952 KB Output is correct
49 Correct 300 ms 24172 KB Output is correct
50 Correct 295 ms 29136 KB Output is correct
51 Correct 212 ms 23328 KB Output is correct
52 Correct 286 ms 29100 KB Output is correct
53 Correct 123 ms 18588 KB Output is correct
54 Correct 309 ms 29132 KB Output is correct
55 Correct 233 ms 26576 KB Output is correct
56 Correct 364 ms 29140 KB Output is correct
57 Correct 41 ms 12656 KB Output is correct
58 Correct 292 ms 29052 KB Output is correct
59 Correct 167 ms 21948 KB Output is correct
60 Correct 318 ms 29088 KB Output is correct
61 Correct 272 ms 27668 KB Output is correct
62 Correct 210 ms 27632 KB Output is correct
63 Correct 212 ms 27852 KB Output is correct
64 Correct 179 ms 28244 KB Output is correct
65 Correct 260 ms 27924 KB Output is correct
66 Correct 222 ms 28328 KB Output is correct
67 Correct 224 ms 27720 KB Output is correct
68 Correct 216 ms 27880 KB Output is correct
69 Correct 262 ms 27332 KB Output is correct
70 Correct 246 ms 27624 KB Output is correct
71 Correct 220 ms 27632 KB Output is correct
72 Correct 193 ms 27868 KB Output is correct
73 Correct 519 ms 34044 KB Output is correct
74 Correct 337 ms 29968 KB Output is correct
75 Correct 391 ms 31992 KB Output is correct
76 Correct 593 ms 38196 KB Output is correct
77 Correct 304 ms 24736 KB Output is correct
78 Correct 482 ms 35332 KB Output is correct
79 Correct 514 ms 35432 KB Output is correct
80 Correct 597 ms 38184 KB Output is correct
81 Correct 204 ms 19988 KB Output is correct
82 Correct 388 ms 33860 KB Output is correct
83 Correct 421 ms 30316 KB Output is correct
84 Correct 570 ms 38184 KB Output is correct
85 Correct 389 ms 32628 KB Output is correct
86 Correct 494 ms 35612 KB Output is correct
87 Correct 249 ms 29008 KB Output is correct
88 Correct 496 ms 36276 KB Output is correct
89 Correct 426 ms 33936 KB Output is correct
90 Correct 449 ms 36244 KB Output is correct
91 Correct 312 ms 30608 KB Output is correct
92 Correct 462 ms 35680 KB Output is correct
93 Correct 259 ms 28864 KB Output is correct
94 Correct 454 ms 35512 KB Output is correct
95 Correct 316 ms 29904 KB Output is correct
96 Correct 465 ms 35756 KB Output is correct