oj.uz

Submission #592681

# Submission time Handle Problem Language Result Execution time Memory
592681 2022-07-09T13:16:26 Z pakhomovee Two Antennas (JOI19_antennas) C++17
13 / 100
 3000 ms 26100 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <iomanip>
#include <cassert>
#include <deque>
#include <functional>
#include <set>
#include <queue>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <complex>

#define int long long
using namespace std;

struct antenna {
    int a, b, h;

    antenna() {}
    antenna(int a, int b, int h): a(a), b(b), h(h) {}
};

const int maxn = 3e5;
const int inf = 1e18;
int gta[maxn];
int h[maxn];
vector<antenna> a;

void init() {
    fill(gta, gta + maxn, -inf);
    fill(h, h + maxn, -1);
}

void upd(int l, int r, int x) {
    for (int i = l; i < r; ++i) {
        if (h[i] != -1) {
            gta[i] = max(gta[i], x - h[i]);
        }
    }
}

void enable(int j) {
    h[j] = a[j].h;
}

void disable(int j) {
    h[j] = -1;
}

int get(int l, int r) {
    int res = -inf;
    for (int i = l; i < r; ++i) {
        res = max(res, gta[i]);
    }
    return res;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    a.resize(n);
    for (int i = 0; i < n; ++i) {
        int x, y, h;
        cin >> h >> x >> y;
        a[i] = antenna(x, y, h);
    }
    vector<vector<pair<int, int>>> queries(n + 1);
    int q;
    cin >> q;
    vector<int> ans(q, -1);
    for (int i = 0; i < q; ++i) {
        int l, r;
        cin >> l >> r;
        queries[r - 1].push_back({ l - 1, i });
    }
    auto solve = [&] {
        init();
        vector<vector<int>> add(n + 1);
        vector<vector<int>> del(n + 1);
        for (int i = 0; i < n; ++i) {
            add[min(i + a[i].a, n)].push_back(i);
            del[min(i + a[i].b + 1, n)].push_back(i);
            for (int j : add[i]) {
                enable(j);
            }
            for (int j : del[i]) {
                disable(j);
            }
            int L = max(0ll, i - a[i].b);
            int R = max(0ll, i - a[i].a + 1);
            upd(L, R, a[i].h);
            for (auto [l, j] : queries[i]) {
                ans[j] = max(ans[j], get(l, i + 1));
            }
        }
    };
    solve();
    for (int i = 0; i < n; ++i) {
        a[i].h *= -1;
    }
    solve();
    for (int i : ans) {
        cout << i << '\n';
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 4 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 4 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 110 ms 10912 KB Output is correct
26 Correct 25 ms 5868 KB Output is correct
27 Correct 218 ms 13276 KB Output is correct
28 Correct 270 ms 13448 KB Output is correct
29 Correct 103 ms 11020 KB Output is correct
30 Correct 167 ms 10816 KB Output is correct
31 Correct 77 ms 12432 KB Output is correct
32 Correct 267 ms 13328 KB Output is correct
33 Correct 166 ms 12784 KB Output is correct
34 Correct 135 ms 9100 KB Output is correct
35 Correct 197 ms 13240 KB Output is correct
36 Correct 251 ms 13372 KB Output is correct
37 Correct 147 ms 9364 KB Output is correct
38 Correct 236 ms 12412 KB Output is correct
39 Correct 36 ms 6224 KB Output is correct
40 Correct 247 ms 12340 KB Output is correct
41 Correct 177 ms 10456 KB Output is correct
42 Correct 251 ms 12432 KB Output is correct
43 Correct 84 ms 7620 KB Output is correct
44 Correct 246 ms 12452 KB Output is correct
45 Correct 45 ms 6308 KB Output is correct
46 Correct 251 ms 12452 KB Output is correct
47 Correct 68 ms 7116 KB Output is correct
48 Correct 241 ms 12452 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3062 ms 26100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 4 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 110 ms 10912 KB Output is correct
26 Correct 25 ms 5868 KB Output is correct
27 Correct 218 ms 13276 KB Output is correct
28 Correct 270 ms 13448 KB Output is correct
29 Correct 103 ms 11020 KB Output is correct
30 Correct 167 ms 10816 KB Output is correct
31 Correct 77 ms 12432 KB Output is correct
32 Correct 267 ms 13328 KB Output is correct
33 Correct 166 ms 12784 KB Output is correct
34 Correct 135 ms 9100 KB Output is correct
35 Correct 197 ms 13240 KB Output is correct
36 Correct 251 ms 13372 KB Output is correct
37 Correct 147 ms 9364 KB Output is correct
38 Correct 236 ms 12412 KB Output is correct
39 Correct 36 ms 6224 KB Output is correct
40 Correct 247 ms 12340 KB Output is correct
41 Correct 177 ms 10456 KB Output is correct
42 Correct 251 ms 12432 KB Output is correct
43 Correct 84 ms 7620 KB Output is correct
44 Correct 246 ms 12452 KB Output is correct
45 Correct 45 ms 6308 KB Output is correct
46 Correct 251 ms 12452 KB Output is correct
47 Correct 68 ms 7116 KB Output is correct
48 Correct 241 ms 12452 KB Output is correct
49 Execution timed out 3062 ms 26100 KB Time limit exceeded
50 Halted 0 ms 0 KB -