oj.uz

Submission #259410

# Submission time Handle Problem Language Result Execution time Memory
259410 2020-08-07T18:26:55 Z keko37 Two Antennas (JOI19_antennas) C++14
35 / 100
 200 ms 55928 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long llint;
typedef pair <llint, llint> pi;

const int MAXN = 200005;
const int MAXM = 2005;
const llint INF = 1000000000000000000LL;

int n, q, ofs = 1;
int h[MAXN], a[MAXN], b[MAXN];
int cost[MAXM][MAXM], dp[MAXM][MAXM], res[MAXM][MAXM];
vector <int> v[MAXN];
llint mx[MAXN * 4], mn[MAXN * 4];

void precompute () {
    memset(cost, -1, sizeof cost);
    memset(dp, -1, sizeof dp);
    memset(res, -1, sizeof res);
    for (int i = 1; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            if (a[i] <= j - i && j - i <= b[i] && a[j] <= j - i && j - i <= b[j]) {
                cost[i][j] = abs(h[i] - h[j]);
            }
            dp[i][j] = max(dp[i][j - 1], cost[i][j]);
        }
    }
    for (int rig = 1; rig <= n; rig++) {
        for (int lef = rig - 1; lef >= 1; lef--) {
            res[lef][rig] = max(res[lef + 1][rig], dp[lef][rig]);
        }
    }
}

void update (int pos, int val, bool flg) {
    //cout << "update " << pos << " " << val << " " << flg << endl;
    pos += ofs;
    if (flg == 1) {
        mn[pos] = mx[pos] = val;
    } else {
        mn[pos] = INF; mx[pos] = -INF;
    }
    pos /= 2;
    while (pos > 0) {
        mn[pos] = min(mn[pos * 2], mn[pos * 2 + 1]);
        mx[pos] = max(mx[pos * 2], mx[pos * 2 + 1]);
        pos /= 2;
    }
}

pi upit (int x, int from, int to, int lo, int hi) {
    if (from <= lo && hi <= to) return {mn[x], mx[x]};
    if (to < lo || hi < from) return {INF, -INF};
    pi lef = upit(2 * x, from, to, lo, (lo + hi) / 2);
    pi rig = upit(2 * x + 1, from, to, (lo + hi) / 2 + 1, hi);
    return {min(lef.first, rig.first), max(lef.second, rig.second)};
}

void sweep () {
    for (int i = 1; i <= n; i++) {
        int lo = i + a[i], hi = i + b[i];
        if (lo <= n) v[lo].push_back(i);
        if (hi + 1 <= n) v[hi + 1].push_back(-i);
    }
    llint sol = 0;
    for (int i = 1; i <= n; i++) {
        for (auto x : v[i]) {
            if (x > 0) {
                update(x, h[x], 1);
            } else {
                update(-x, 0, 0);
            }
        }
        int lo = i - b[i], hi = i - a[i];
        if (hi < 1) continue;
        lo = max(lo, 1);
        //cout << "bla " << lo << " " << hi << endl;

        pi res = upit(1, lo, hi, 0, ofs - 1);
        if (res.first <= h[i]) sol = max(sol, h[i] - res.first);
        if (h[i] <= res.second) sol = max(sol, res.second - h[i]);
    }
    cout << sol << endl;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> h[i] >> a[i] >> b[i];
    }
    cin >> q;
    if (n <= 2000) {
        precompute();
        for (int i = 0; i < q; i++) {
            int lef, rig;
            cin >> lef >> rig;
            cout << res[lef][rig] << '\n';
        }
    } else if (q <= 1) {
        cin >> q >> q;
        while (ofs < n + 1) ofs *= 2;
        for (int i = 0; i < 2 * ofs; i++) {
            mn[i] = INF;
            mx[i] = -INF;
        }
        sweep();
    }
    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 52220 KB Output is correct
2 Correct 28 ms 52224 KB Output is correct
3 Correct 28 ms 52224 KB Output is correct
4 Correct 29 ms 52352 KB Output is correct
5 Correct 28 ms 52216 KB Output is correct
6 Correct 28 ms 52216 KB Output is correct
7 Correct 29 ms 52216 KB Output is correct
8 Correct 28 ms 52224 KB Output is correct
9 Correct 29 ms 52472 KB Output is correct
10 Correct 28 ms 52224 KB Output is correct
11 Correct 28 ms 52216 KB Output is correct
12 Correct 28 ms 52224 KB Output is correct
13 Correct 29 ms 52216 KB Output is correct
14 Correct 28 ms 52224 KB Output is correct
15 Correct 29 ms 52216 KB Output is correct
16 Correct 28 ms 52216 KB Output is correct
17 Correct 29 ms 52216 KB Output is correct
18 Correct 28 ms 52224 KB Output is correct
19 Correct 28 ms 52216 KB Output is correct
20 Correct 28 ms 52208 KB Output is correct
21 Correct 28 ms 52216 KB Output is correct
22 Correct 28 ms 52216 KB Output is correct
23 Correct 28 ms 52224 KB Output is correct
24 Correct 28 ms 52224 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 52220 KB Output is correct
2 Correct 28 ms 52224 KB Output is correct
3 Correct 28 ms 52224 KB Output is correct
4 Correct 29 ms 52352 KB Output is correct
5 Correct 28 ms 52216 KB Output is correct
6 Correct 28 ms 52216 KB Output is correct
7 Correct 29 ms 52216 KB Output is correct
8 Correct 28 ms 52224 KB Output is correct
9 Correct 29 ms 52472 KB Output is correct
10 Correct 28 ms 52224 KB Output is correct
11 Correct 28 ms 52216 KB Output is correct
12 Correct 28 ms 52224 KB Output is correct
13 Correct 29 ms 52216 KB Output is correct
14 Correct 28 ms 52224 KB Output is correct
15 Correct 29 ms 52216 KB Output is correct
16 Correct 28 ms 52216 KB Output is correct
17 Correct 29 ms 52216 KB Output is correct
18 Correct 28 ms 52224 KB Output is correct
19 Correct 28 ms 52216 KB Output is correct
20 Correct 28 ms 52208 KB Output is correct
21 Correct 28 ms 52216 KB Output is correct
22 Correct 28 ms 52216 KB Output is correct
23 Correct 28 ms 52224 KB Output is correct
24 Correct 28 ms 52224 KB Output is correct
25 Correct 78 ms 54648 KB Output is correct
26 Correct 73 ms 52600 KB Output is correct
27 Correct 131 ms 55800 KB Output is correct
28 Correct 145 ms 55928 KB Output is correct
29 Correct 83 ms 54648 KB Output is correct
30 Correct 119 ms 54776 KB Output is correct
31 Correct 88 ms 55288 KB Output is correct
32 Correct 148 ms 55928 KB Output is correct
33 Correct 112 ms 55672 KB Output is correct
34 Correct 104 ms 54008 KB Output is correct
35 Correct 132 ms 55800 KB Output is correct
36 Correct 146 ms 55928 KB Output is correct
37 Correct 107 ms 53880 KB Output is correct
38 Correct 136 ms 54976 KB Output is correct
39 Correct 79 ms 52728 KB Output is correct
40 Correct 138 ms 54864 KB Output is correct
41 Correct 118 ms 54264 KB Output is correct
42 Correct 139 ms 54904 KB Output is correct
43 Correct 87 ms 53112 KB Output is correct
44 Correct 140 ms 54904 KB Output is correct
45 Correct 74 ms 52728 KB Output is correct
46 Correct 136 ms 54884 KB Output is correct
47 Correct 79 ms 52984 KB Output is correct
48 Correct 136 ms 54904 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 18040 KB Output is correct
2 Correct 187 ms 23160 KB Output is correct
3 Correct 125 ms 20088 KB Output is correct
4 Correct 189 ms 23032 KB Output is correct
5 Correct 77 ms 13560 KB Output is correct
6 Correct 182 ms 23032 KB Output is correct
7 Correct 158 ms 21752 KB Output is correct
8 Correct 183 ms 23032 KB Output is correct
9 Correct 26 ms 7672 KB Output is correct
10 Correct 182 ms 23032 KB Output is correct
11 Correct 119 ms 15320 KB Output is correct
12 Correct 200 ms 23184 KB Output is correct
13 Correct 152 ms 21068 KB Output is correct
14 Correct 159 ms 20984 KB Output is correct
15 Correct 138 ms 21112 KB Output is correct
16 Correct 151 ms 21576 KB Output is correct
17 Correct 150 ms 21332 KB Output is correct
18 Correct 141 ms 21752 KB Output is correct
19 Correct 141 ms 21100 KB Output is correct
20 Correct 153 ms 21048 KB Output is correct
21 Correct 140 ms 20852 KB Output is correct
22 Correct 145 ms 21108 KB Output is correct
23 Correct 144 ms 20984 KB Output is correct
24 Correct 141 ms 21236 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 52220 KB Output is correct
2 Correct 28 ms 52224 KB Output is correct
3 Correct 28 ms 52224 KB Output is correct
4 Correct 29 ms 52352 KB Output is correct
5 Correct 28 ms 52216 KB Output is correct
6 Correct 28 ms 52216 KB Output is correct
7 Correct 29 ms 52216 KB Output is correct
8 Correct 28 ms 52224 KB Output is correct
9 Correct 29 ms 52472 KB Output is correct
10 Correct 28 ms 52224 KB Output is correct
11 Correct 28 ms 52216 KB Output is correct
12 Correct 28 ms 52224 KB Output is correct
13 Correct 29 ms 52216 KB Output is correct
14 Correct 28 ms 52224 KB Output is correct
15 Correct 29 ms 52216 KB Output is correct
16 Correct 28 ms 52216 KB Output is correct
17 Correct 29 ms 52216 KB Output is correct
18 Correct 28 ms 52224 KB Output is correct
19 Correct 28 ms 52216 KB Output is correct
20 Correct 28 ms 52208 KB Output is correct
21 Correct 28 ms 52216 KB Output is correct
22 Correct 28 ms 52216 KB Output is correct
23 Correct 28 ms 52224 KB Output is correct
24 Correct 28 ms 52224 KB Output is correct
25 Correct 78 ms 54648 KB Output is correct
26 Correct 73 ms 52600 KB Output is correct
27 Correct 131 ms 55800 KB Output is correct
28 Correct 145 ms 55928 KB Output is correct
29 Correct 83 ms 54648 KB Output is correct
30 Correct 119 ms 54776 KB Output is correct
31 Correct 88 ms 55288 KB Output is correct
32 Correct 148 ms 55928 KB Output is correct
33 Correct 112 ms 55672 KB Output is correct
34 Correct 104 ms 54008 KB Output is correct
35 Correct 132 ms 55800 KB Output is correct
36 Correct 146 ms 55928 KB Output is correct
37 Correct 107 ms 53880 KB Output is correct
38 Correct 136 ms 54976 KB Output is correct
39 Correct 79 ms 52728 KB Output is correct
40 Correct 138 ms 54864 KB Output is correct
41 Correct 118 ms 54264 KB Output is correct
42 Correct 139 ms 54904 KB Output is correct
43 Correct 87 ms 53112 KB Output is correct
44 Correct 140 ms 54904 KB Output is correct
45 Correct 74 ms 52728 KB Output is correct
46 Correct 136 ms 54884 KB Output is correct
47 Correct 79 ms 52984 KB Output is correct
48 Correct 136 ms 54904 KB Output is correct
49 Correct 160 ms 18040 KB Output is correct
50 Correct 187 ms 23160 KB Output is correct
51 Correct 125 ms 20088 KB Output is correct
52 Correct 189 ms 23032 KB Output is correct
53 Correct 77 ms 13560 KB Output is correct
54 Correct 182 ms 23032 KB Output is correct
55 Correct 158 ms 21752 KB Output is correct
56 Correct 183 ms 23032 KB Output is correct
57 Correct 26 ms 7672 KB Output is correct
58 Correct 182 ms 23032 KB Output is correct
59 Correct 119 ms 15320 KB Output is correct
60 Correct 200 ms 23184 KB Output is correct
61 Correct 152 ms 21068 KB Output is correct
62 Correct 159 ms 20984 KB Output is correct
63 Correct 138 ms 21112 KB Output is correct
64 Correct 151 ms 21576 KB Output is correct
65 Correct 150 ms 21332 KB Output is correct
66 Correct 141 ms 21752 KB Output is correct
67 Correct 141 ms 21100 KB Output is correct
68 Correct 153 ms 21048 KB Output is correct
69 Correct 140 ms 20852 KB Output is correct
70 Correct 145 ms 21108 KB Output is correct
71 Correct 144 ms 20984 KB Output is correct
72 Correct 141 ms 21236 KB Output is correct
73 Incorrect 81 ms 11392 KB Output isn't correct
74 Halted 0 ms 0 KB -