oj.uz

답안 #122742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122742 2019-06-29T07:55:36 Z sealnot123 Two Antennas (JOI19_antennas) C++14
100 / 100
 713 ms 49660 KB 
#include<bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(),(a).end()
#define SZ(a) (int)(a).size()
using namespace std;
typedef long long LL;
typedef pair<LL,LL> PLL;
typedef pair<int,int> PII;
typedef double D;
typedef long double LD;
const int N = 200007;
const int INF = 1<<30;
int validMA[4*N], validMI[4*N];
int ANS[4*N], H[N], A[N], B[N];
int MA[4*N], MI[4*N], ans[N];
int n;
vector<int> come[N], go[N];
vector<PII> qq[N];

void push(int now, int l, int r){
    ANS[now] = max(ANS[now], max(validMA[now] - MI[now], MA[now] - validMI[now]));
    if(l!=r){
        if(validMA[now<<1] != -INF){
            MA[now<<1] = max(MA[now<<1], MA[now]);
            MI[now<<1] = min(MI[now<<1], MI[now]);
        }
        if(validMA[now<<1|1] != -INF){
            MA[now<<1|1] = max(MA[now<<1|1], MA[now]);
            MI[now<<1|1] = min(MI[now<<1|1], MI[now]);
        }
    }
    MA[now] = -INF;
    MI[now] = INF;
}

void add_valid(int idx, int val, int l = 1, int r = n, int now = 1){
    push(now, l, r);
    if(l == r){
        if(val==-1) validMA[now] = -INF, validMI[now] = INF;
        else validMA[now] = validMI[now] = val;
        return ;
    }
    int m = (l+r)>>1;
    if(idx <= m) add_valid(idx, val, l, m, now<<1);
    else add_valid(idx, val, m+1, r, now<<1|1);
    validMA[now] = max(validMA[now<<1], validMA[now<<1|1]);
    validMI[now] = min(validMI[now<<1], validMI[now<<1|1]);
}

void add_val(int ll, int rr, int val, int l = 1, int r = n, int now = 1){
    push(now, l, r);
    if(l > rr || r < ll || validMA[now] == -INF) return ;
    if(l >= ll && r <= rr){
        MA[now] = max(MA[now], val);
        MI[now] = min(MI[now], val);
        push(now, l, r);
        return;
    }
    int m = (l+r)>>1;
    add_val(ll, rr, val, l, m, now<<1);
    add_val(ll, rr, val, m+1, r, now<<1|1);
    ANS[now] = max(ANS[now<<1], ANS[now<<1|1]);
}

int get(int ll, int rr, int l = 1, int r = n, int now = 1){
    push(now, l, r);
    if(l > rr || r < ll) return -INF;
    if(l >= ll && r <= rr) return ANS[now];
    int m = (l+r)>>1;
    return max(get(ll, rr, l, m, now<<1), get(ll, rr, m+1, r, now<<1|1));
}

int main(){
    int i,j,k,l,a,b,c,d,q;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d%d%d",&H[i],&A[i],&B[i]);
        if(i+A[i]<=n) come[i+A[i]].pb(i);
        if(i+B[i]<=n) go[i+B[i]].pb(i);
    }
    scanf("%d",&q);
    for(i=1;i<=q;i++){
        scanf("%d%d",&a,&b);
        qq[b].pb({a,i});
    }
    for(i=1;i<=4*n;i++) validMA[i] = MA[i] = -INF, validMI[i] = MI[i] = INF, ANS[i] = -1;
    for(i=1;i<=n;i++){
        for(int it : come[i]) add_valid(it, H[it]);
        add_val(i-B[i], i-A[i], H[i]);
        for(PII it : qq[i]){
            ans[it.y] = get(it.x, i);
        }
        for(int it : go[i]) add_valid(it, -1);
    }
    for(i=1;i<=q;i++) printf("%d\n",ans[i]);
    return 0;
}
/*
5
10 2 4
1 1 1
2 1 3
1 1 1
100 1 1
5
1 2
2 3
1 3
1 4
1 5

20
260055884 2 15
737689751 5 5
575359903 1 15
341907415 14 14
162026576 9 19
55126745 10 19
95712405 11 14
416027186 8 13
370819848 11 14
629309664 4 13
822713895 5 15
390716905 13 17
577166133 8 19
195931195 10 17
377030463 14 17
968486685 11 19
963040581 4 10
566835557 1 12
586336111 6 16
385865831 8 9
1
1 20
*/

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:77:11: warning: unused variable 'j' [-Wunused-variable]
     int i,j,k,l,a,b,c,d,q;
           ^
antennas.cpp:77:13: warning: unused variable 'k' [-Wunused-variable]
     int i,j,k,l,a,b,c,d,q;
             ^
antennas.cpp:77:15: warning: unused variable 'l' [-Wunused-variable]
     int i,j,k,l,a,b,c,d,q;
               ^
antennas.cpp:77:21: warning: unused variable 'c' [-Wunused-variable]
     int i,j,k,l,a,b,c,d,q;
                     ^
antennas.cpp:77:23: warning: unused variable 'd' [-Wunused-variable]
     int i,j,k,l,a,b,c,d,q;
                       ^
antennas.cpp:78:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
antennas.cpp:80:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&H[i],&A[i],&B[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:84:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&q);
     ~~~~~^~~~~~~~~
antennas.cpp:86:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 14 ms 14584 KB Output is correct
4 Correct 14 ms 14456 KB Output is correct
5 Correct 14 ms 14456 KB Output is correct
6 Correct 14 ms 14456 KB Output is correct
7 Correct 14 ms 14456 KB Output is correct
8 Correct 14 ms 14456 KB Output is correct
9 Correct 14 ms 14584 KB Output is correct
10 Correct 14 ms 14584 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 15 ms 14456 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 15 ms 14456 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 14 ms 14456 KB Output is correct
17 Correct 14 ms 14456 KB Output is correct
18 Correct 15 ms 14456 KB Output is correct
19 Correct 16 ms 14456 KB Output is correct
20 Correct 15 ms 14456 KB Output is correct
21 Correct 14 ms 14540 KB Output is correct
22 Correct 17 ms 14456 KB Output is correct
23 Correct 17 ms 14456 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 14 ms 14584 KB Output is correct
4 Correct 14 ms 14456 KB Output is correct
5 Correct 14 ms 14456 KB Output is correct
6 Correct 14 ms 14456 KB Output is correct
7 Correct 14 ms 14456 KB Output is correct
8 Correct 14 ms 14456 KB Output is correct
9 Correct 14 ms 14584 KB Output is correct
10 Correct 14 ms 14584 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 15 ms 14456 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 15 ms 14456 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 14 ms 14456 KB Output is correct
17 Correct 14 ms 14456 KB Output is correct
18 Correct 15 ms 14456 KB Output is correct
19 Correct 16 ms 14456 KB Output is correct
20 Correct 15 ms 14456 KB Output is correct
21 Correct 14 ms 14540 KB Output is correct
22 Correct 17 ms 14456 KB Output is correct
23 Correct 17 ms 14456 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct
25 Correct 123 ms 18088 KB Output is correct
26 Correct 29 ms 15232 KB Output is correct
27 Correct 175 ms 19576 KB Output is correct
28 Correct 185 ms 19576 KB Output is correct
29 Correct 124 ms 18168 KB Output is correct
30 Correct 126 ms 17900 KB Output is correct
31 Correct 138 ms 18940 KB Output is correct
32 Correct 189 ms 19580 KB Output is correct
33 Correct 167 ms 19232 KB Output is correct
34 Correct 98 ms 17016 KB Output is correct
35 Correct 181 ms 19548 KB Output is correct
36 Correct 188 ms 19576 KB Output is correct
37 Correct 105 ms 17016 KB Output is correct
38 Correct 172 ms 18644 KB Output is correct
39 Correct 38 ms 15180 KB Output is correct
40 Correct 173 ms 18680 KB Output is correct
41 Correct 132 ms 17528 KB Output is correct
42 Correct 175 ms 18664 KB Output is correct
43 Correct 73 ms 15992 KB Output is correct
44 Correct 172 ms 18680 KB Output is correct
45 Correct 42 ms 15352 KB Output is correct
46 Correct 172 ms 18652 KB Output is correct
47 Correct 57 ms 15608 KB Output is correct
48 Correct 169 ms 18652 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 320 ms 37496 KB Output is correct
2 Correct 359 ms 40440 KB Output is correct
3 Correct 237 ms 32648 KB Output is correct
4 Correct 353 ms 40440 KB Output is correct
5 Correct 154 ms 26488 KB Output is correct
6 Correct 366 ms 40592 KB Output is correct
7 Correct 300 ms 36984 KB Output is correct
8 Correct 386 ms 40416 KB Output is correct
9 Correct 55 ms 18552 KB Output is correct
10 Correct 357 ms 40440 KB Output is correct
11 Correct 219 ms 30844 KB Output is correct
12 Correct 371 ms 40520 KB Output is correct
13 Correct 236 ms 38092 KB Output is correct
14 Correct 230 ms 38144 KB Output is correct
15 Correct 225 ms 38264 KB Output is correct
16 Correct 209 ms 38520 KB Output is correct
17 Correct 240 ms 38076 KB Output is correct
18 Correct 221 ms 38648 KB Output is correct
19 Correct 235 ms 37968 KB Output is correct
20 Correct 230 ms 38208 KB Output is correct
21 Correct 233 ms 37852 KB Output is correct
22 Correct 234 ms 38260 KB Output is correct
23 Correct 235 ms 38000 KB Output is correct
24 Correct 206 ms 38132 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 14 ms 14584 KB Output is correct
4 Correct 14 ms 14456 KB Output is correct
5 Correct 14 ms 14456 KB Output is correct
6 Correct 14 ms 14456 KB Output is correct
7 Correct 14 ms 14456 KB Output is correct
8 Correct 14 ms 14456 KB Output is correct
9 Correct 14 ms 14584 KB Output is correct
10 Correct 14 ms 14584 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 15 ms 14456 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 15 ms 14456 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 14 ms 14456 KB Output is correct
17 Correct 14 ms 14456 KB Output is correct
18 Correct 15 ms 14456 KB Output is correct
19 Correct 16 ms 14456 KB Output is correct
20 Correct 15 ms 14456 KB Output is correct
21 Correct 14 ms 14540 KB Output is correct
22 Correct 17 ms 14456 KB Output is correct
23 Correct 17 ms 14456 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct
25 Correct 123 ms 18088 KB Output is correct
26 Correct 29 ms 15232 KB Output is correct
27 Correct 175 ms 19576 KB Output is correct
28 Correct 185 ms 19576 KB Output is correct
29 Correct 124 ms 18168 KB Output is correct
30 Correct 126 ms 17900 KB Output is correct
31 Correct 138 ms 18940 KB Output is correct
32 Correct 189 ms 19580 KB Output is correct
33 Correct 167 ms 19232 KB Output is correct
34 Correct 98 ms 17016 KB Output is correct
35 Correct 181 ms 19548 KB Output is correct
36 Correct 188 ms 19576 KB Output is correct
37 Correct 105 ms 17016 KB Output is correct
38 Correct 172 ms 18644 KB Output is correct
39 Correct 38 ms 15180 KB Output is correct
40 Correct 173 ms 18680 KB Output is correct
41 Correct 132 ms 17528 KB Output is correct
42 Correct 175 ms 18664 KB Output is correct
43 Correct 73 ms 15992 KB Output is correct
44 Correct 172 ms 18680 KB Output is correct
45 Correct 42 ms 15352 KB Output is correct
46 Correct 172 ms 18652 KB Output is correct
47 Correct 57 ms 15608 KB Output is correct
48 Correct 169 ms 18652 KB Output is correct
49 Correct 320 ms 37496 KB Output is correct
50 Correct 359 ms 40440 KB Output is correct
51 Correct 237 ms 32648 KB Output is correct
52 Correct 353 ms 40440 KB Output is correct
53 Correct 154 ms 26488 KB Output is correct
54 Correct 366 ms 40592 KB Output is correct
55 Correct 300 ms 36984 KB Output is correct
56 Correct 386 ms 40416 KB Output is correct
57 Correct 55 ms 18552 KB Output is correct
58 Correct 357 ms 40440 KB Output is correct
59 Correct 219 ms 30844 KB Output is correct
60 Correct 371 ms 40520 KB Output is correct
61 Correct 236 ms 38092 KB Output is correct
62 Correct 230 ms 38144 KB Output is correct
63 Correct 225 ms 38264 KB Output is correct
64 Correct 209 ms 38520 KB Output is correct
65 Correct 240 ms 38076 KB Output is correct
66 Correct 221 ms 38648 KB Output is correct
67 Correct 235 ms 37968 KB Output is correct
68 Correct 230 ms 38208 KB Output is correct
69 Correct 233 ms 37852 KB Output is correct
70 Correct 234 ms 38260 KB Output is correct
71 Correct 235 ms 38000 KB Output is correct
72 Correct 206 ms 38132 KB Output is correct
73 Correct 578 ms 44792 KB Output is correct
74 Correct 378 ms 41436 KB Output is correct
75 Correct 564 ms 41384 KB Output is correct
76 Correct 692 ms 49656 KB Output is correct
77 Correct 384 ms 32608 KB Output is correct
78 Correct 606 ms 46792 KB Output is correct
79 Correct 641 ms 45952 KB Output is correct
80 Correct 699 ms 49660 KB Output is correct
81 Correct 290 ms 26104 KB Output is correct
82 Correct 527 ms 45276 KB Output is correct
83 Correct 525 ms 39416 KB Output is correct
84 Correct 713 ms 49656 KB Output is correct
85 Correct 436 ms 42828 KB Output is correct
86 Correct 596 ms 46016 KB Output is correct
87 Correct 282 ms 39544 KB Output is correct
88 Correct 548 ms 46520 KB Output is correct
89 Correct 493 ms 44188 KB Output is correct
90 Correct 560 ms 46436 KB Output is correct
91 Correct 356 ms 40792 KB Output is correct
92 Correct 560 ms 46016 KB Output is correct
93 Correct 298 ms 39748 KB Output is correct
94 Correct 568 ms 46192 KB Output is correct
95 Correct 328 ms 40308 KB Output is correct
96 Correct 536 ms 46144 KB Output is correct