oj.uz

Submission #207665

# Submission time Handle Problem Language Result Execution time Memory
207665 2020-03-08T10:59:23 Z Mercenary Two Antennas (JOI19_antennas) C++14
100 / 100
 818 ms 47736 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<ll,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 2e5 + 5;
const int inf = 1e9 + 1;

struct segTree{
    int mx[maxn * 4],lz[maxn * 4],ans[maxn * 4];
    void reset(){
        fill_n(mx,maxn*4,0);
        fill_n(lz,maxn*4,inf);
        fill_n(ans,maxn*4,-1);
    }
    void push(int x , bool key){
        ans[x] = max(ans[x],mx[x]-lz[x]);
        if(key)lz[x*2] = min(lz[x*2],lz[x]),lz[x*2+1] = min(lz[x * 2 + 1],lz[x]);
        lz[x] = inf;
    }
    void updateP(int x , int l , int r , int pos , int val){
        push(x,l != r);
        if(l == r){
            mx[x] = val;
            return;
        }
        int mid = l + r >> 1;
        if(pos <= mid)updateP(x*2,l,mid,pos,val);
        else updateP(x*2+1,mid+1,r,pos,val);
        ans[x] = max({ans[x],ans[x * 2],ans[x * 2 + 1]});
        mx[x] = max(mx[x * 2] , mx[x * 2 + 1]);
    }
    void updateR(int x , int l , int r , int L , int R , int val){
        push(x,l!=r);
        if(l > R || L > r)return;
        if(L <= l && r <= R){
            lz[x] = min(lz[x],val);push(x,l!=r);return;
        }
        int mid = l + r >> 1;
        updateR(x*2,l,mid,L,R,val);
        updateR(x*2+1,mid+1,r,L,R,val);
        ans[x] = max({ans[x],ans[x * 2],ans[x * 2 + 1]});
        mx[x] = max(mx[x * 2],mx[x * 2 + 1]);
    }
    int query(int x , int l , int r , int L , int R){
        push(x,l!=r);
        if(l > R || L > r)return -1;
        if(L <= l && r <= R)return ans[x];
        int mid = l + r >> 1;
        return max(query(x*2,l,mid,L,R),query(x*2+1,mid+1,r,L,R));
    }
}s;
int n , q;
int a[maxn],b[maxn],h[maxn];
ii queries[maxn];
int ans[maxn];
vector<ii> Q[maxn];
vector<int> avai[maxn];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    cin >> n;
    for(int i = 1 ; i <= n ; ++i){
        cin >> h[i] >> a[i] >> b[i];
    }
    cin >> q;
    for(int i = 1 ; i <= q ; ++i){
        cin >> queries[i].first >> queries[i].second;
        ans[i] = -1;
    }
    {
        //h[i] - h[j]
        for(int i = 1 ; i <= q ; ++i){
            Q[queries[i].second].pb(mp(queries[i].first,i));
        }
        s.reset();
        for(int i = 1 ; i <= n ; ++i){
            if(i + a[i] <= n){
                avai[i + a[i]].pb(i);
            }
            if(i + b[i] + 1 <= n){
                avai[i + b[i] + 1].pb(-i);
            }
            for(auto c : avai[i]){
                if(c > 0)s.updateP(1,1,n,c,h[c]);
                else s.updateP(1,1,n,-c,0);
            }
            avai[i].clear();
            s.updateR(1,1,n,i-b[i],i-a[i],h[i]);
            for(auto c : Q[i]){
                ans[c.second] = max(ans[c.second],s.query(1,1,n,c.first,i));
            }
            Q[i].clear();
        }
    }
    {
        //-h[i] + h[j]
        for(int i = 1 ; i <= q ; ++i){
            Q[queries[i].first].pb(mp(queries[i].second,i));
        }
        s.reset();
        for(int i = n ; i >= 1 ; --i){
            if(i - a[i] >= 1){
                avai[i - a[i]].pb(i);
            }
            if(i - b[i] - 1 >= 1){
                avai[i - b[i] - 1].pb(-i);
            }
            for(auto c : avai[i]){
                if(c > 0)s.updateP(1,1,n,c,h[c]);
                else s.updateP(1,1,n,-c,0);
            }
            avai[i].clear();
            s.updateR(1,1,n,i+a[i],i + b[i],h[i]);
            for(auto c : Q[i]){
                ans[c.second] = max(ans[c.second],s.query(1,1,n,i,c.first));
            }
            Q[i].clear();
        }
    }
    for(int i = 1 ; i <= q ; ++i)cout << ans[i] << '\n';
}

Compilation message

antennas.cpp: In member function 'void segTree::updateP(int, int, int, int, int)':
antennas.cpp:38:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int mid = l + r >> 1;
                   ~~^~~
antennas.cpp: In member function 'void segTree::updateR(int, int, int, int, int, int)':
antennas.cpp:50:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int mid = l + r >> 1;
                   ~~^~~
antennas.cpp: In member function 'int segTree::query(int, int, int, int, int)':
antennas.cpp:60:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int mid = l + r >> 1;
                   ~~^~~
antennas.cpp: In function 'int main()':
antennas.cpp:76:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:77:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 19196 KB Output is correct
2 Correct 19 ms 19192 KB Output is correct
3 Correct 19 ms 19192 KB Output is correct
4 Correct 19 ms 19192 KB Output is correct
5 Correct 21 ms 19192 KB Output is correct
6 Correct 19 ms 19192 KB Output is correct
7 Correct 19 ms 19192 KB Output is correct
8 Correct 19 ms 19192 KB Output is correct
9 Correct 19 ms 19192 KB Output is correct
10 Correct 19 ms 19192 KB Output is correct
11 Correct 18 ms 19192 KB Output is correct
12 Correct 19 ms 19192 KB Output is correct
13 Correct 19 ms 19192 KB Output is correct
14 Correct 19 ms 19192 KB Output is correct
15 Correct 19 ms 19192 KB Output is correct
16 Correct 18 ms 19192 KB Output is correct
17 Correct 18 ms 19192 KB Output is correct
18 Correct 20 ms 19192 KB Output is correct
19 Correct 18 ms 19192 KB Output is correct
20 Correct 19 ms 19192 KB Output is correct
21 Correct 18 ms 19192 KB Output is correct
22 Correct 19 ms 19192 KB Output is correct
23 Correct 19 ms 19192 KB Output is correct
24 Correct 18 ms 19192 KB Output is correct
25 Correct 125 ms 29304 KB Output is correct
26 Correct 33 ms 20344 KB Output is correct
27 Correct 177 ms 33272 KB Output is correct
28 Correct 179 ms 32888 KB Output is correct
29 Correct 124 ms 29560 KB Output is correct
30 Correct 130 ms 28792 KB Output is correct
31 Correct 140 ms 31864 KB Output is correct
32 Correct 179 ms 32968 KB Output is correct
33 Correct 171 ms 32632 KB Output is correct
34 Correct 96 ms 25852 KB Output is correct
35 Correct 176 ms 33624 KB Output is correct
36 Correct 182 ms 32888 KB Output is correct
37 Correct 117 ms 26872 KB Output is correct
38 Correct 178 ms 31864 KB Output is correct
39 Correct 44 ms 21112 KB Output is correct
40 Correct 179 ms 31864 KB Output is correct
41 Correct 140 ms 29048 KB Output is correct
42 Correct 178 ms 31864 KB Output is correct
43 Correct 77 ms 23672 KB Output is correct
44 Correct 180 ms 31864 KB Output is correct
45 Correct 47 ms 21496 KB Output is correct
46 Correct 183 ms 31840 KB Output is correct
47 Correct 65 ms 22520 KB Output is correct
48 Correct 175 ms 31864 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 366 ms 25728 KB Output is correct
2 Correct 410 ms 26360 KB Output is correct
3 Correct 256 ms 24184 KB Output is correct
4 Correct 403 ms 26360 KB Output is correct
5 Correct 159 ms 22520 KB Output is correct
6 Correct 417 ms 26464 KB Output is correct
7 Correct 349 ms 25464 KB Output is correct
8 Correct 409 ms 26360 KB Output is correct
9 Correct 60 ms 20344 KB Output is correct
10 Correct 400 ms 26488 KB Output is correct
11 Correct 226 ms 26488 KB Output is correct
12 Correct 408 ms 30840 KB Output is correct
13 Correct 261 ms 29256 KB Output is correct
14 Correct 245 ms 28788 KB Output is correct
15 Correct 260 ms 28164 KB Output is correct
16 Correct 218 ms 28288 KB Output is correct
17 Correct 281 ms 29784 KB Output is correct
18 Correct 246 ms 28920 KB Output is correct
19 Correct 264 ms 28656 KB Output is correct
20 Correct 258 ms 28596 KB Output is correct
21 Correct 232 ms 29040 KB Output is correct
22 Correct 273 ms 28784 KB Output is correct
23 Correct 268 ms 28788 KB Output is correct
24 Correct 219 ms 27920 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 19196 KB Output is correct
2 Correct 19 ms 19192 KB Output is correct
3 Correct 19 ms 19192 KB Output is correct
4 Correct 19 ms 19192 KB Output is correct
5 Correct 21 ms 19192 KB Output is correct
6 Correct 19 ms 19192 KB Output is correct
7 Correct 19 ms 19192 KB Output is correct
8 Correct 19 ms 19192 KB Output is correct
9 Correct 19 ms 19192 KB Output is correct
10 Correct 19 ms 19192 KB Output is correct
11 Correct 18 ms 19192 KB Output is correct
12 Correct 19 ms 19192 KB Output is correct
13 Correct 19 ms 19192 KB Output is correct
14 Correct 19 ms 19192 KB Output is correct
15 Correct 19 ms 19192 KB Output is correct
16 Correct 18 ms 19192 KB Output is correct
17 Correct 18 ms 19192 KB Output is correct
18 Correct 20 ms 19192 KB Output is correct
19 Correct 18 ms 19192 KB Output is correct
20 Correct 19 ms 19192 KB Output is correct
21 Correct 18 ms 19192 KB Output is correct
22 Correct 19 ms 19192 KB Output is correct
23 Correct 19 ms 19192 KB Output is correct
24 Correct 18 ms 19192 KB Output is correct
25 Correct 125 ms 29304 KB Output is correct
26 Correct 33 ms 20344 KB Output is correct
27 Correct 177 ms 33272 KB Output is correct
28 Correct 179 ms 32888 KB Output is correct
29 Correct 124 ms 29560 KB Output is correct
30 Correct 130 ms 28792 KB Output is correct
31 Correct 140 ms 31864 KB Output is correct
32 Correct 179 ms 32968 KB Output is correct
33 Correct 171 ms 32632 KB Output is correct
34 Correct 96 ms 25852 KB Output is correct
35 Correct 176 ms 33624 KB Output is correct
36 Correct 182 ms 32888 KB Output is correct
37 Correct 117 ms 26872 KB Output is correct
38 Correct 178 ms 31864 KB Output is correct
39 Correct 44 ms 21112 KB Output is correct
40 Correct 179 ms 31864 KB Output is correct
41 Correct 140 ms 29048 KB Output is correct
42 Correct 178 ms 31864 KB Output is correct
43 Correct 77 ms 23672 KB Output is correct
44 Correct 180 ms 31864 KB Output is correct
45 Correct 47 ms 21496 KB Output is correct
46 Correct 183 ms 31840 KB Output is correct
47 Correct 65 ms 22520 KB Output is correct
48 Correct 175 ms 31864 KB Output is correct
49 Correct 366 ms 25728 KB Output is correct
50 Correct 410 ms 26360 KB Output is correct
51 Correct 256 ms 24184 KB Output is correct
52 Correct 403 ms 26360 KB Output is correct
53 Correct 159 ms 22520 KB Output is correct
54 Correct 417 ms 26464 KB Output is correct
55 Correct 349 ms 25464 KB Output is correct
56 Correct 409 ms 26360 KB Output is correct
57 Correct 60 ms 20344 KB Output is correct
58 Correct 400 ms 26488 KB Output is correct
59 Correct 226 ms 26488 KB Output is correct
60 Correct 408 ms 30840 KB Output is correct
61 Correct 261 ms 29256 KB Output is correct
62 Correct 245 ms 28788 KB Output is correct
63 Correct 260 ms 28164 KB Output is correct
64 Correct 218 ms 28288 KB Output is correct
65 Correct 281 ms 29784 KB Output is correct
66 Correct 246 ms 28920 KB Output is correct
67 Correct 264 ms 28656 KB Output is correct
68 Correct 258 ms 28596 KB Output is correct
69 Correct 232 ms 29040 KB Output is correct
70 Correct 273 ms 28784 KB Output is correct
71 Correct 268 ms 28788 KB Output is correct
72 Correct 219 ms 27920 KB Output is correct
73 Correct 653 ms 42488 KB Output is correct
74 Correct 421 ms 32380 KB Output is correct
75 Correct 621 ms 43512 KB Output is correct
76 Correct 818 ms 47676 KB Output is correct
77 Correct 419 ms 36088 KB Output is correct
78 Correct 645 ms 42488 KB Output is correct
79 Correct 725 ms 45944 KB Output is correct
80 Correct 805 ms 47736 KB Output is correct
81 Correct 319 ms 35312 KB Output is correct
82 Correct 599 ms 39676 KB Output is correct
83 Correct 575 ms 42488 KB Output is correct
84 Correct 796 ms 47736 KB Output is correct
85 Correct 504 ms 38792 KB Output is correct
86 Correct 635 ms 44464 KB Output is correct
87 Correct 313 ms 30580 KB Output is correct
88 Correct 624 ms 43856 KB Output is correct
89 Correct 563 ms 41316 KB Output is correct
90 Correct 658 ms 44536 KB Output is correct
91 Correct 396 ms 34472 KB Output is correct
92 Correct 614 ms 44212 KB Output is correct
93 Correct 307 ms 32240 KB Output is correct
94 Correct 642 ms 44540 KB Output is correct
95 Correct 377 ms 33388 KB Output is correct
96 Correct 617 ms 43508 KB Output is correct