oj.uz

Submission #158546

# Submission time Handle Problem Language Result Execution time Memory
158546 2019-10-17T18:01:42 Z combi1k1 Two Antennas (JOI19_antennas) C++14
100 / 100
 957 ms 69404 KB 
#include<bits/stdc++.h>

using namespace std;

#define X       first
#define Y       second
#define lch     i << 1
#define rch     i << 1 | 1

const int   N   = 4e5 + 1;
const int   inf = 1e9 + 7;

typedef pair<int,int>   ii;

ii  t1[N << 1];
ii  t2[N << 1];
int t3[N << 1];
ii  lz[N << 1];

ii  operator + (const ii &a,const ii &b)    {
    return  ii(max(a.X,b.X),max(a.Y,b.Y));
}
int pus(int i,int l,int r)  {
    t2[i] = t2[i] + lz[i];
    if (l < r)
        lz[lch] = lz[lch] + lz[i],
        lz[rch] = lz[rch] + lz[i];
    t3[i] = max(t3[i],t1[i].X + lz[i].Y);
    t3[i] = max(t3[i],t1[i].Y + lz[i].X);
    t3[i] = max(t3[i],-1);
    lz[i] = ii(-inf,-inf);
}
int upd(int i,int l,int r,int L,int R,int a,int b)  {
    pus(i,l,r);
    if (l > R)  return  0;
    if (L > r)  return  0;
    if (L <= l && r <= R)   {
        if (a == 0) lz[i] = ii(-b,b);
        if (b == 0) t1[i] = ii(a < 0 ? a : -a,a);
        pus(i,l,r);
        return  1;
    }
    int m = (l + r) / 2;
    upd(lch,l,m,L,R,a,b);   ++m;
    upd(rch,m,r,L,R,a,b);

    t1[i] = t1[lch] + t1[rch];
    t2[i] = t2[lch] + t2[rch];
    t3[i] = max(t3[lch],t3[rch]);
}
int get(int i,int l,int r,int L,int R)  {
    pus(i,l,r);
    if (l > R)  return  -1;
    if (L > r)  return  -1;
    if (L <= l && r <= R)
        return  t3[i];
    int m = (l + r) / 2;

    return  max(get(lch,l,m,L,R),get(rch,m + 1,r,L,R));
}

vector<int> add[N];
vector<int> rem[N];
vector<ii>  Q[N];

int l[N], r[N];
int h[N];
int ans[N];

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;  cin >> n;

    for(int i = 1 ; i <= n ; ++i)   {
        cin >> h[i];
        int a;  cin >> a;
        int b;  cin >> b;   ++b;

        add[i + a].push_back(i);
        rem[i + b].push_back(i);

        l[i] = max(i - b,0) + 1;
        r[i] = max(i - a,0);
    }

    int m;  cin >> m;

    for(int i = 1 ; i <= m ; ++i)   {
        int L;  cin >> L;
        int R;  cin >> R;
        Q[R].push_back({L,i});
    }

    fill(t1 + 1,t1 + 4 * n,ii(-inf,-inf));
    fill(t2 + 1,t2 + 4 * n,ii(-inf,-inf));
    fill(t3 + 1,t3 + 4 * n,-1);
    fill(lz + 1,lz + 4 * n,ii(-inf,-inf));

    for(int i = 1 ; i <= n ; ++i)   {
        for(int x : add[i]) upd(1,1,n,x,x,h[x],0);
        for(int x : rem[i]) upd(1,1,n,x,x,-inf,0);

        upd(1,1,n,l[i],r[i],0,h[i]);

        for(ii  q : Q[i])
            ans[q.Y] = get(1,1,n,q.X,i);
    }

    for(int i = 1 ; i <= m ; ++i)
        cout << ans[i] << "\n";
}

Compilation message

antennas.cpp: In function 'int pus(int, int, int)':
antennas.cpp:32:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
antennas.cpp: In function 'int upd(int, int, int, int, int, int, int)':
antennas.cpp:50:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 28536 KB Output is correct
2 Correct 30 ms 28664 KB Output is correct
3 Correct 34 ms 28664 KB Output is correct
4 Correct 35 ms 28664 KB Output is correct
5 Correct 30 ms 28664 KB Output is correct
6 Correct 34 ms 28664 KB Output is correct
7 Correct 34 ms 28636 KB Output is correct
8 Correct 36 ms 28664 KB Output is correct
9 Correct 35 ms 28636 KB Output is correct
10 Correct 32 ms 28800 KB Output is correct
11 Correct 34 ms 28536 KB Output is correct
12 Correct 36 ms 28664 KB Output is correct
13 Correct 36 ms 28664 KB Output is correct
14 Correct 34 ms 28664 KB Output is correct
15 Correct 26 ms 28636 KB Output is correct
16 Correct 35 ms 28664 KB Output is correct
17 Correct 34 ms 28576 KB Output is correct
18 Correct 34 ms 28664 KB Output is correct
19 Correct 34 ms 28692 KB Output is correct
20 Correct 30 ms 28664 KB Output is correct
21 Correct 29 ms 28664 KB Output is correct
22 Correct 29 ms 28664 KB Output is correct
23 Correct 35 ms 28664 KB Output is correct
24 Correct 29 ms 28668 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 28536 KB Output is correct
2 Correct 30 ms 28664 KB Output is correct
3 Correct 34 ms 28664 KB Output is correct
4 Correct 35 ms 28664 KB Output is correct
5 Correct 30 ms 28664 KB Output is correct
6 Correct 34 ms 28664 KB Output is correct
7 Correct 34 ms 28636 KB Output is correct
8 Correct 36 ms 28664 KB Output is correct
9 Correct 35 ms 28636 KB Output is correct
10 Correct 32 ms 28800 KB Output is correct
11 Correct 34 ms 28536 KB Output is correct
12 Correct 36 ms 28664 KB Output is correct
13 Correct 36 ms 28664 KB Output is correct
14 Correct 34 ms 28664 KB Output is correct
15 Correct 26 ms 28636 KB Output is correct
16 Correct 35 ms 28664 KB Output is correct
17 Correct 34 ms 28576 KB Output is correct
18 Correct 34 ms 28664 KB Output is correct
19 Correct 34 ms 28692 KB Output is correct
20 Correct 30 ms 28664 KB Output is correct
21 Correct 29 ms 28664 KB Output is correct
22 Correct 29 ms 28664 KB Output is correct
23 Correct 35 ms 28664 KB Output is correct
24 Correct 29 ms 28668 KB Output is correct
25 Correct 141 ms 33452 KB Output is correct
26 Correct 45 ms 29432 KB Output is correct
27 Correct 196 ms 35448 KB Output is correct
28 Correct 200 ms 35576 KB Output is correct
29 Correct 143 ms 33528 KB Output is correct
30 Correct 146 ms 33528 KB Output is correct
31 Correct 157 ms 34552 KB Output is correct
32 Correct 202 ms 35448 KB Output is correct
33 Correct 198 ms 35192 KB Output is correct
34 Correct 115 ms 32168 KB Output is correct
35 Correct 202 ms 35340 KB Output is correct
36 Correct 203 ms 35448 KB Output is correct
37 Correct 127 ms 32220 KB Output is correct
38 Correct 212 ms 34424 KB Output is correct
39 Correct 63 ms 29692 KB Output is correct
40 Correct 199 ms 34520 KB Output is correct
41 Correct 153 ms 33144 KB Output is correct
42 Correct 201 ms 34492 KB Output is correct
43 Correct 85 ms 30840 KB Output is correct
44 Correct 199 ms 34424 KB Output is correct
45 Correct 60 ms 29816 KB Output is correct
46 Correct 207 ms 34540 KB Output is correct
47 Correct 94 ms 30328 KB Output is correct
48 Correct 199 ms 34552 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 517 ms 60152 KB Output is correct
2 Correct 563 ms 63332 KB Output is correct
3 Correct 384 ms 53624 KB Output is correct
4 Correct 568 ms 63196 KB Output is correct
5 Correct 243 ms 45688 KB Output is correct
6 Correct 586 ms 63256 KB Output is correct
7 Correct 507 ms 59128 KB Output is correct
8 Correct 553 ms 63224 KB Output is correct
9 Correct 91 ms 34552 KB Output is correct
10 Correct 577 ms 63196 KB Output is correct
11 Correct 339 ms 51068 KB Output is correct
12 Correct 567 ms 63224 KB Output is correct
13 Correct 399 ms 59764 KB Output is correct
14 Correct 371 ms 59296 KB Output is correct
15 Correct 405 ms 59896 KB Output is correct
16 Correct 337 ms 60664 KB Output is correct
17 Correct 410 ms 59508 KB Output is correct
18 Correct 371 ms 59464 KB Output is correct
19 Correct 385 ms 59304 KB Output is correct
20 Correct 369 ms 59512 KB Output is correct
21 Correct 357 ms 59352 KB Output is correct
22 Correct 372 ms 59636 KB Output is correct
23 Correct 382 ms 59424 KB Output is correct
24 Correct 336 ms 60020 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 28536 KB Output is correct
2 Correct 30 ms 28664 KB Output is correct
3 Correct 34 ms 28664 KB Output is correct
4 Correct 35 ms 28664 KB Output is correct
5 Correct 30 ms 28664 KB Output is correct
6 Correct 34 ms 28664 KB Output is correct
7 Correct 34 ms 28636 KB Output is correct
8 Correct 36 ms 28664 KB Output is correct
9 Correct 35 ms 28636 KB Output is correct
10 Correct 32 ms 28800 KB Output is correct
11 Correct 34 ms 28536 KB Output is correct
12 Correct 36 ms 28664 KB Output is correct
13 Correct 36 ms 28664 KB Output is correct
14 Correct 34 ms 28664 KB Output is correct
15 Correct 26 ms 28636 KB Output is correct
16 Correct 35 ms 28664 KB Output is correct
17 Correct 34 ms 28576 KB Output is correct
18 Correct 34 ms 28664 KB Output is correct
19 Correct 34 ms 28692 KB Output is correct
20 Correct 30 ms 28664 KB Output is correct
21 Correct 29 ms 28664 KB Output is correct
22 Correct 29 ms 28664 KB Output is correct
23 Correct 35 ms 28664 KB Output is correct
24 Correct 29 ms 28668 KB Output is correct
25 Correct 141 ms 33452 KB Output is correct
26 Correct 45 ms 29432 KB Output is correct
27 Correct 196 ms 35448 KB Output is correct
28 Correct 200 ms 35576 KB Output is correct
29 Correct 143 ms 33528 KB Output is correct
30 Correct 146 ms 33528 KB Output is correct
31 Correct 157 ms 34552 KB Output is correct
32 Correct 202 ms 35448 KB Output is correct
33 Correct 198 ms 35192 KB Output is correct
34 Correct 115 ms 32168 KB Output is correct
35 Correct 202 ms 35340 KB Output is correct
36 Correct 203 ms 35448 KB Output is correct
37 Correct 127 ms 32220 KB Output is correct
38 Correct 212 ms 34424 KB Output is correct
39 Correct 63 ms 29692 KB Output is correct
40 Correct 199 ms 34520 KB Output is correct
41 Correct 153 ms 33144 KB Output is correct
42 Correct 201 ms 34492 KB Output is correct
43 Correct 85 ms 30840 KB Output is correct
44 Correct 199 ms 34424 KB Output is correct
45 Correct 60 ms 29816 KB Output is correct
46 Correct 207 ms 34540 KB Output is correct
47 Correct 94 ms 30328 KB Output is correct
48 Correct 199 ms 34552 KB Output is correct
49 Correct 517 ms 60152 KB Output is correct
50 Correct 563 ms 63332 KB Output is correct
51 Correct 384 ms 53624 KB Output is correct
52 Correct 568 ms 63196 KB Output is correct
53 Correct 243 ms 45688 KB Output is correct
54 Correct 586 ms 63256 KB Output is correct
55 Correct 507 ms 59128 KB Output is correct
56 Correct 553 ms 63224 KB Output is correct
57 Correct 91 ms 34552 KB Output is correct
58 Correct 577 ms 63196 KB Output is correct
59 Correct 339 ms 51068 KB Output is correct
60 Correct 567 ms 63224 KB Output is correct
61 Correct 399 ms 59764 KB Output is correct
62 Correct 371 ms 59296 KB Output is correct
63 Correct 405 ms 59896 KB Output is correct
64 Correct 337 ms 60664 KB Output is correct
65 Correct 410 ms 59508 KB Output is correct
66 Correct 371 ms 59464 KB Output is correct
67 Correct 385 ms 59304 KB Output is correct
68 Correct 369 ms 59512 KB Output is correct
69 Correct 357 ms 59352 KB Output is correct
70 Correct 372 ms 59636 KB Output is correct
71 Correct 382 ms 59424 KB Output is correct
72 Correct 336 ms 60020 KB Output is correct
73 Correct 785 ms 64408 KB Output is correct
74 Correct 588 ms 63992 KB Output is correct
75 Correct 718 ms 59108 KB Output is correct
76 Correct 957 ms 69272 KB Output is correct
77 Correct 474 ms 50060 KB Output is correct
78 Correct 833 ms 67432 KB Output is correct
79 Correct 860 ms 64768 KB Output is correct
80 Correct 925 ms 69404 KB Output is correct
81 Correct 337 ms 40824 KB Output is correct
82 Correct 745 ms 66296 KB Output is correct
83 Correct 674 ms 56476 KB Output is correct
84 Correct 921 ms 69240 KB Output is correct
85 Correct 616 ms 62788 KB Output is correct
86 Correct 791 ms 64116 KB Output is correct
87 Correct 441 ms 60764 KB Output is correct
88 Correct 771 ms 65468 KB Output is correct
89 Correct 684 ms 63220 KB Output is correct
90 Correct 739 ms 64504 KB Output is correct
91 Correct 512 ms 61140 KB Output is correct
92 Correct 736 ms 64432 KB Output is correct
93 Correct 427 ms 60680 KB Output is correct
94 Correct 797 ms 64652 KB Output is correct
95 Correct 516 ms 60724 KB Output is correct
96 Correct 773 ms 65036 KB Output is correct