oj.uz

Submission #122826

# Submission time Handle Problem Language Result Execution time Memory
122826 2019-06-29T10:44:23 Z win11905 Two Antennas (JOI19_antennas) C++11
35 / 100
 3000 ms 330560 KB 
#include <bits/stdc++.h>
#define iii tuple<int, int, int>
using namespace std;

const int N = 1<<18;
const int INF = 1e9+1;

int n, m;
int H[N], x[N], y[N];
vector<int> preadd[N], predel[N];

struct node {
    int mn, mx;
    node *l, *r;
    node(int mn, int mx, node *l, node *r) : mn(mn), mx(mx), l(l), r(r) {}
};

node* newson(int mn, int mx) { return new node(mn, mx, nullptr, nullptr); }
node * newpar(node *l, node *r) { return new node(min(l->mn, r->mn), max(l->mx, r->mx), l, r); }

node* build(int l = 1, int r = n) {
    if(l == r) return newson(INF, -INF);
    int m = (l + r) >> 1;
    return newpar(build(l, m), build(m+1, r));
}

node* update(int v, bool st, node* p, int l = 1, int r = n) {
    if(l == r) {
        if(st) return newson(H[v], H[v]);
        return newson(INF, -INF);
    }
    int m = (l + r) >> 1;
    if(v <= m) return newpar(update(v, st, p->l, l, m), p->r);
    return newpar(p->l, update(v, st, p->r, m+1, r));
}

int qmin(int x, int y, node* p, int l = 1, int r = n) {
    if(x > r || l > y) return INF;
    if(x <= l && r <= y) return p->mn;
    int m = (l + r) >> 1;
    return min(qmin(x, y, p->l, l, m), qmin(x, y, p->r, m+1, r));
}

int qmax(int x, int y, node* p, int l = 1, int r = n) {
    if(x > r || l > y) return -INF;
    if(x <= l && r <= y) return p-> mx;
    int m = (l + r) >> 1;
    return max(qmax(x, y, p->l, l, m), qmax(x, y, p->r, m+1, r)); 
}

node *ver[N];
int ans[N];
const int sz = 300;
vector<iii> block[1000];

int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) {
        scanf("%d %d %d", H+i, x+i, y+i);
        if(i + x[i] <= n) preadd[i+x[i]].emplace_back(i), predel[min(n, i+y[i]) + 1].emplace_back(i);
        if(i - x[i] >= 1) preadd[max(1, i-y[i])].emplace_back(i), predel[i-x[i] + 1].emplace_back(i);
    }
    ver[0] = ver[1] = build();
    for(int i = 1; i <= n; ++i) {
        for(int v : preadd[i]) ver[i] = update(v, true, ver[i]);//, cerr << "add -> " << i << ' ' << v << endl;
        for(int v : predel[i]) ver[i] = update(v, false, ver[i]);//, cerr << "del -> " << i << ' ' << v << endl;
        ver[i+1] = ver[i];
    }
    scanf("%d", &m);
    memset(ans, -1, sizeof ans);
    for(int i = 0, l, r; i < m; ++i) {
        scanf("%d %d", &l, &r); 
        block[l / sz].emplace_back(r, l, i);
    }
    for(int i = 0; i < sz; ++i) {
        sort(block[i].begin(), block[i].end());
        int pa = (i+1) * sz;
        int pmx = -1, ptr = pa;
        for(auto z : block[i]) {
            int l, r, idx; tie(r, l, idx) = z;
            // cerr << l << ' ' << r << endl;
            int imx = -1;
            while(ptr <= r) {
                pmx = max({pmx, H[ptr] - qmin(max(pa, ptr - y[ptr]), ptr - x[ptr], ver[ptr]), qmax(max(pa, ptr - y[ptr]), ptr - x[ptr], ver[ptr]) - H[ptr]});
                ptr++;
            }
            for(int i = min(r, pa-1); i >= l; --i) {
                imx = max({imx, H[i] - qmin(i+x[i], min(r, i+y[i]), ver[i]), qmax(i+x[i], min(r, i+y[i]), ver[i]) - H[i]});
            }
            ans[idx] = max(pmx, imx);
        }
    }
    for(int i = 0; i < m; ++i) printf("%d\n", ans[i]);
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:57:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
antennas.cpp:59:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", H+i, x+i, y+i);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:69:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &m);
     ~~~~~^~~~~~~~~~
antennas.cpp:72:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &l, &r); 
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 13816 KB Output is correct
2 Correct 15 ms 13944 KB Output is correct
3 Correct 15 ms 13816 KB Output is correct
4 Correct 15 ms 13816 KB Output is correct
5 Correct 14 ms 13816 KB Output is correct
6 Correct 15 ms 13944 KB Output is correct
7 Correct 15 ms 13816 KB Output is correct
8 Correct 15 ms 13944 KB Output is correct
9 Correct 14 ms 13788 KB Output is correct
10 Correct 15 ms 13816 KB Output is correct
11 Correct 14 ms 13776 KB Output is correct
12 Correct 15 ms 13816 KB Output is correct
13 Correct 14 ms 13816 KB Output is correct
14 Correct 14 ms 13944 KB Output is correct
15 Correct 14 ms 13916 KB Output is correct
16 Correct 15 ms 13820 KB Output is correct
17 Correct 14 ms 13816 KB Output is correct
18 Correct 15 ms 13944 KB Output is correct
19 Correct 14 ms 13944 KB Output is correct
20 Correct 15 ms 13944 KB Output is correct
21 Correct 14 ms 13816 KB Output is correct
22 Correct 14 ms 13920 KB Output is correct
23 Correct 15 ms 13944 KB Output is correct
24 Correct 14 ms 13944 KB Output is correct
25 Correct 1375 ms 17616 KB Output is correct
26 Correct 208 ms 15736 KB Output is correct
27 Correct 2301 ms 19416 KB Output is correct
28 Correct 2525 ms 19664 KB Output is correct
29 Correct 1461 ms 17612 KB Output is correct
30 Correct 1615 ms 18076 KB Output is correct
31 Correct 807 ms 17888 KB Output is correct
32 Correct 2489 ms 19528 KB Output is correct
33 Correct 1942 ms 18684 KB Output is correct
34 Correct 1189 ms 17744 KB Output is correct
35 Correct 2131 ms 19016 KB Output is correct
36 Correct 2432 ms 19920 KB Output is correct
37 Correct 677 ms 17832 KB Output is correct
38 Correct 2135 ms 18876 KB Output is correct
39 Correct 210 ms 16120 KB Output is correct
40 Correct 1673 ms 18964 KB Output is correct
41 Correct 972 ms 18132 KB Output is correct
42 Correct 1531 ms 19228 KB Output is correct
43 Correct 405 ms 16820 KB Output is correct
44 Correct 1337 ms 18800 KB Output is correct
45 Correct 233 ms 16348 KB Output is correct
46 Correct 1335 ms 18908 KB Output is correct
47 Correct 324 ms 16248 KB Output is correct
48 Correct 1603 ms 19080 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 913 ms 217836 KB Output is correct
2 Correct 1057 ms 241904 KB Output is correct
3 Correct 692 ms 169972 KB Output is correct
4 Correct 1095 ms 242156 KB Output is correct
5 Correct 448 ms 113280 KB Output is correct
6 Correct 1080 ms 241716 KB Output is correct
7 Correct 914 ms 209828 KB Output is correct
8 Correct 1066 ms 241968 KB Output is correct
9 Correct 129 ms 45092 KB Output is correct
10 Correct 1083 ms 242788 KB Output is correct
11 Correct 615 ms 151928 KB Output is correct
12 Correct 1051 ms 242160 KB Output is correct
13 Correct 789 ms 313992 KB Output is correct
14 Correct 678 ms 289132 KB Output is correct
15 Correct 601 ms 259400 KB Output is correct
16 Correct 637 ms 277640 KB Output is correct
17 Correct 787 ms 330560 KB Output is correct
18 Correct 663 ms 287604 KB Output is correct
19 Correct 678 ms 292748 KB Output is correct
20 Correct 666 ms 281616 KB Output is correct
21 Correct 676 ms 275940 KB Output is correct
22 Correct 673 ms 284144 KB Output is correct
23 Correct 689 ms 288856 KB Output is correct
24 Correct 608 ms 267300 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 13816 KB Output is correct
2 Correct 15 ms 13944 KB Output is correct
3 Correct 15 ms 13816 KB Output is correct
4 Correct 15 ms 13816 KB Output is correct
5 Correct 14 ms 13816 KB Output is correct
6 Correct 15 ms 13944 KB Output is correct
7 Correct 15 ms 13816 KB Output is correct
8 Correct 15 ms 13944 KB Output is correct
9 Correct 14 ms 13788 KB Output is correct
10 Correct 15 ms 13816 KB Output is correct
11 Correct 14 ms 13776 KB Output is correct
12 Correct 15 ms 13816 KB Output is correct
13 Correct 14 ms 13816 KB Output is correct
14 Correct 14 ms 13944 KB Output is correct
15 Correct 14 ms 13916 KB Output is correct
16 Correct 15 ms 13820 KB Output is correct
17 Correct 14 ms 13816 KB Output is correct
18 Correct 15 ms 13944 KB Output is correct
19 Correct 14 ms 13944 KB Output is correct
20 Correct 15 ms 13944 KB Output is correct
21 Correct 14 ms 13816 KB Output is correct
22 Correct 14 ms 13920 KB Output is correct
23 Correct 15 ms 13944 KB Output is correct
24 Correct 14 ms 13944 KB Output is correct
25 Correct 1375 ms 17616 KB Output is correct
26 Correct 208 ms 15736 KB Output is correct
27 Correct 2301 ms 19416 KB Output is correct
28 Correct 2525 ms 19664 KB Output is correct
29 Correct 1461 ms 17612 KB Output is correct
30 Correct 1615 ms 18076 KB Output is correct
31 Correct 807 ms 17888 KB Output is correct
32 Correct 2489 ms 19528 KB Output is correct
33 Correct 1942 ms 18684 KB Output is correct
34 Correct 1189 ms 17744 KB Output is correct
35 Correct 2131 ms 19016 KB Output is correct
36 Correct 2432 ms 19920 KB Output is correct
37 Correct 677 ms 17832 KB Output is correct
38 Correct 2135 ms 18876 KB Output is correct
39 Correct 210 ms 16120 KB Output is correct
40 Correct 1673 ms 18964 KB Output is correct
41 Correct 972 ms 18132 KB Output is correct
42 Correct 1531 ms 19228 KB Output is correct
43 Correct 405 ms 16820 KB Output is correct
44 Correct 1337 ms 18800 KB Output is correct
45 Correct 233 ms 16348 KB Output is correct
46 Correct 1335 ms 18908 KB Output is correct
47 Correct 324 ms 16248 KB Output is correct
48 Correct 1603 ms 19080 KB Output is correct
49 Correct 913 ms 217836 KB Output is correct
50 Correct 1057 ms 241904 KB Output is correct
51 Correct 692 ms 169972 KB Output is correct
52 Correct 1095 ms 242156 KB Output is correct
53 Correct 448 ms 113280 KB Output is correct
54 Correct 1080 ms 241716 KB Output is correct
55 Correct 914 ms 209828 KB Output is correct
56 Correct 1066 ms 241968 KB Output is correct
57 Correct 129 ms 45092 KB Output is correct
58 Correct 1083 ms 242788 KB Output is correct
59 Correct 615 ms 151928 KB Output is correct
60 Correct 1051 ms 242160 KB Output is correct
61 Correct 789 ms 313992 KB Output is correct
62 Correct 678 ms 289132 KB Output is correct
63 Correct 601 ms 259400 KB Output is correct
64 Correct 637 ms 277640 KB Output is correct
65 Correct 787 ms 330560 KB Output is correct
66 Correct 663 ms 287604 KB Output is correct
67 Correct 678 ms 292748 KB Output is correct
68 Correct 666 ms 281616 KB Output is correct
69 Correct 676 ms 275940 KB Output is correct
70 Correct 673 ms 284144 KB Output is correct
71 Correct 689 ms 288856 KB Output is correct
72 Correct 608 ms 267300 KB Output is correct
73 Execution timed out 3052 ms 220748 KB Time limit exceeded
74 Halted 0 ms 0 KB -