oj.uz

Submission #122824

# Submission time Handle Problem Language Result Execution time Memory
122824 2019-06-29T10:43:08 Z win11905 Two Antennas (JOI19_antennas) C++11
35 / 100
 3000 ms 330520 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 = 200;
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 14 ms 13820 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 13944 KB Output is correct
5 Correct 14 ms 13816 KB Output is correct
6 Correct 14 ms 13816 KB Output is correct
7 Correct 15 ms 13916 KB Output is correct
8 Correct 15 ms 13816 KB Output is correct
9 Correct 14 ms 13816 KB Output is correct
10 Correct 15 ms 13948 KB Output is correct
11 Correct 14 ms 13816 KB Output is correct
12 Correct 15 ms 13916 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 13820 KB Output is correct
16 Correct 14 ms 13816 KB Output is correct
17 Correct 14 ms 13816 KB Output is correct
18 Correct 14 ms 13944 KB Output is correct
19 Correct 14 ms 13828 KB Output is correct
20 Correct 14 ms 13944 KB Output is correct
21 Correct 14 ms 13944 KB Output is correct
22 Correct 14 ms 13816 KB Output is correct
23 Correct 14 ms 13816 KB Output is correct
24 Correct 15 ms 13816 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 13820 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 13944 KB Output is correct
5 Correct 14 ms 13816 KB Output is correct
6 Correct 14 ms 13816 KB Output is correct
7 Correct 15 ms 13916 KB Output is correct
8 Correct 15 ms 13816 KB Output is correct
9 Correct 14 ms 13816 KB Output is correct
10 Correct 15 ms 13948 KB Output is correct
11 Correct 14 ms 13816 KB Output is correct
12 Correct 15 ms 13916 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 13820 KB Output is correct
16 Correct 14 ms 13816 KB Output is correct
17 Correct 14 ms 13816 KB Output is correct
18 Correct 14 ms 13944 KB Output is correct
19 Correct 14 ms 13828 KB Output is correct
20 Correct 14 ms 13944 KB Output is correct
21 Correct 14 ms 13944 KB Output is correct
22 Correct 14 ms 13816 KB Output is correct
23 Correct 14 ms 13816 KB Output is correct
24 Correct 15 ms 13816 KB Output is correct
25 Correct 988 ms 17452 KB Output is correct
26 Correct 150 ms 15608 KB Output is correct
27 Correct 1579 ms 19500 KB Output is correct
28 Correct 1705 ms 19652 KB Output is correct
29 Correct 1016 ms 17520 KB Output is correct
30 Correct 1116 ms 18260 KB Output is correct
31 Correct 720 ms 18592 KB Output is correct
32 Correct 1705 ms 19576 KB Output is correct
33 Correct 1421 ms 18608 KB Output is correct
34 Correct 832 ms 17872 KB Output is correct
35 Correct 1485 ms 19192 KB Output is correct
36 Correct 1692 ms 19444 KB Output is correct
37 Correct 498 ms 17908 KB Output is correct
38 Correct 1466 ms 19192 KB Output is correct
39 Correct 153 ms 15992 KB Output is correct
40 Correct 1109 ms 19208 KB Output is correct
41 Correct 692 ms 18232 KB Output is correct
42 Correct 1083 ms 19052 KB Output is correct
43 Correct 301 ms 16632 KB Output is correct
44 Correct 935 ms 18824 KB Output is correct
45 Correct 168 ms 16216 KB Output is correct
46 Correct 937 ms 18872 KB Output is correct
47 Correct 237 ms 16504 KB Output is correct
48 Correct 1184 ms 19028 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 964 ms 217884 KB Output is correct
2 Correct 1054 ms 241776 KB Output is correct
3 Correct 686 ms 169804 KB Output is correct
4 Correct 1033 ms 242296 KB Output is correct
5 Correct 428 ms 113272 KB Output is correct
6 Correct 1037 ms 241520 KB Output is correct
7 Correct 902 ms 210004 KB Output is correct
8 Correct 1046 ms 241904 KB Output is correct
9 Correct 128 ms 45224 KB Output is correct
10 Correct 1053 ms 242672 KB Output is correct
11 Correct 666 ms 151800 KB Output is correct
12 Correct 1055 ms 242108 KB Output is correct
13 Correct 768 ms 313988 KB Output is correct
14 Correct 684 ms 289336 KB Output is correct
15 Correct 625 ms 259616 KB Output is correct
16 Correct 649 ms 277872 KB Output is correct
17 Correct 783 ms 330520 KB Output is correct
18 Correct 664 ms 287700 KB Output is correct
19 Correct 679 ms 292876 KB Output is correct
20 Correct 666 ms 281664 KB Output is correct
21 Correct 663 ms 275768 KB Output is correct
22 Correct 674 ms 284240 KB Output is correct
23 Correct 679 ms 288884 KB Output is correct
24 Correct 609 ms 267380 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 13820 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 13944 KB Output is correct
5 Correct 14 ms 13816 KB Output is correct
6 Correct 14 ms 13816 KB Output is correct
7 Correct 15 ms 13916 KB Output is correct
8 Correct 15 ms 13816 KB Output is correct
9 Correct 14 ms 13816 KB Output is correct
10 Correct 15 ms 13948 KB Output is correct
11 Correct 14 ms 13816 KB Output is correct
12 Correct 15 ms 13916 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 13820 KB Output is correct
16 Correct 14 ms 13816 KB Output is correct
17 Correct 14 ms 13816 KB Output is correct
18 Correct 14 ms 13944 KB Output is correct
19 Correct 14 ms 13828 KB Output is correct
20 Correct 14 ms 13944 KB Output is correct
21 Correct 14 ms 13944 KB Output is correct
22 Correct 14 ms 13816 KB Output is correct
23 Correct 14 ms 13816 KB Output is correct
24 Correct 15 ms 13816 KB Output is correct
25 Correct 988 ms 17452 KB Output is correct
26 Correct 150 ms 15608 KB Output is correct
27 Correct 1579 ms 19500 KB Output is correct
28 Correct 1705 ms 19652 KB Output is correct
29 Correct 1016 ms 17520 KB Output is correct
30 Correct 1116 ms 18260 KB Output is correct
31 Correct 720 ms 18592 KB Output is correct
32 Correct 1705 ms 19576 KB Output is correct
33 Correct 1421 ms 18608 KB Output is correct
34 Correct 832 ms 17872 KB Output is correct
35 Correct 1485 ms 19192 KB Output is correct
36 Correct 1692 ms 19444 KB Output is correct
37 Correct 498 ms 17908 KB Output is correct
38 Correct 1466 ms 19192 KB Output is correct
39 Correct 153 ms 15992 KB Output is correct
40 Correct 1109 ms 19208 KB Output is correct
41 Correct 692 ms 18232 KB Output is correct
42 Correct 1083 ms 19052 KB Output is correct
43 Correct 301 ms 16632 KB Output is correct
44 Correct 935 ms 18824 KB Output is correct
45 Correct 168 ms 16216 KB Output is correct
46 Correct 937 ms 18872 KB Output is correct
47 Correct 237 ms 16504 KB Output is correct
48 Correct 1184 ms 19028 KB Output is correct
49 Correct 964 ms 217884 KB Output is correct
50 Correct 1054 ms 241776 KB Output is correct
51 Correct 686 ms 169804 KB Output is correct
52 Correct 1033 ms 242296 KB Output is correct
53 Correct 428 ms 113272 KB Output is correct
54 Correct 1037 ms 241520 KB Output is correct
55 Correct 902 ms 210004 KB Output is correct
56 Correct 1046 ms 241904 KB Output is correct
57 Correct 128 ms 45224 KB Output is correct
58 Correct 1053 ms 242672 KB Output is correct
59 Correct 666 ms 151800 KB Output is correct
60 Correct 1055 ms 242108 KB Output is correct
61 Correct 768 ms 313988 KB Output is correct
62 Correct 684 ms 289336 KB Output is correct
63 Correct 625 ms 259616 KB Output is correct
64 Correct 649 ms 277872 KB Output is correct
65 Correct 783 ms 330520 KB Output is correct
66 Correct 664 ms 287700 KB Output is correct
67 Correct 679 ms 292876 KB Output is correct
68 Correct 666 ms 281664 KB Output is correct
69 Correct 663 ms 275768 KB Output is correct
70 Correct 674 ms 284240 KB Output is correct
71 Correct 679 ms 288884 KB Output is correct
72 Correct 609 ms 267380 KB Output is correct
73 Execution timed out 3034 ms 220908 KB Time limit exceeded
74 Halted 0 ms 0 KB -