oj.uz

답안 #206020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
206020 2020-03-02T00:57:28 Z achibasadzishvili Two Antennas (JOI19_antennas) C++17
100 / 100
 833 ms 59256 KB 
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define N 200005
#define mp make_pair
using namespace std;
ll save[6*N],inf=1000000000000000,pown=1;
ll n,q,a[N],b[N],h[N],kl[N],kr[N],ans[N];
pair<ll,ll>t[6*N];
vector<ll>st[N],en[N];
vector<pair<ll,ll> >ge[N];
void updpoint(ll x,ll L,ll R,ll ind,ll val){
    if(L == R){
        if(val == -inf){
            t[x].s = -inf;
            save[x] = inf;
            return;
        }
        t[x].f = max(t[x].f , t[x].s - val);
        t[x].s = val;
        save[x] = val;
        return;
    }
    if(save[x] != inf){
        save[2 * x] = min(save[x] , save[2 * x]);
        t[2 * x].f = max(t[2 * x].f , t[2 * x].s - save[x]);
        save[2 * x + 1] = min(save[x] , save[2 * x + 1]);
        t[2 * x + 1].f = max(t[2 * x + 1].f , t[2 * x + 1].s - save[x]);
        save[x] = inf;
    }
    ll mid = (L + R) / 2;
    if(mid >= ind)updpoint(2 * x , L , mid , ind , val);
    else updpoint(2 * x + 1 , mid + 1 , R , ind , val);
    t[x].f = max(t[2 * x].f , t[2 * x + 1].f);
    t[x].s = max(t[2 * x].s , t[2 * x + 1].s);
}
void upd(ll x,ll L,ll R,ll l,ll r,ll val){
    if(L > r || R < l)return;
    if(L >= l && R <= r){
        save[x] = min(save[x] , val);
        t[x].f = max(t[x].f , t[x].s - save[x]);
        return;
    }
    if(save[x] != inf){
        save[2 * x] = min(save[x] , save[2 * x]);
        t[2 * x].f = max(t[2 * x].f , t[2 * x].s - save[x]);
        save[2 * x + 1] = min(save[x] , save[2 * x + 1]);
        t[2 * x + 1].f = max(t[2 * x + 1].f , t[2 * x + 1].s - save[x]);
        save[x] = inf;
    }
    ll mid = (L + R) / 2;
    upd(2 * x , L , mid , l , r , val);
    upd(2 * x + 1 , mid + 1 , R , l , r , val);
    t[x].f = max(t[2 * x].f , t[2 * x + 1].f);
    t[x].s = max(t[2 * x].s , t[2 * x + 1].s);
}
ll get(ll x,ll L,ll R,ll l,ll r){
    if(L > r || R < l)return -inf;
    if(L >= l && R <= r)return t[x].f;
    if(save[x] != inf){
        save[2 * x] = min(save[x] , save[2 * x]);
        t[2 * x].f = max(t[2 * x].f , t[2 * x].s - save[x]);
        save[2 * x + 1] = min(save[x] , save[2 * x + 1]);
        t[2 * x + 1].f = max(t[2 * x + 1].f , t[2 * x + 1].s - save[x]);
        save[x] = inf;
    }
    ll mid = (L + R) / 2;
    ll k1 = get(2 * x , L , mid , l , r);
    ll k2 = get(2 * x + 1 , mid + 1 , R , l , r);
    return max(k1 , k2);
}
void solve(){
    for(int i=1; i<=n; i++){
        st[i].clear();
        en[i].clear();
        ge[i].clear();
    }
    for(int i=1; i<=2 * pown; i++){
        save[i] = inf;
        t[i].f = -inf;
        t[i].s = -inf;
    }
    for(int i=1; i<=q; i++){
        ge[kr[i]].pb(mp(kl[i] , i));
    }
    for(int i=1; i<=n; i++){
        if(i + a[i] <= n)
            st[i + a[i]].pb(i);
        if(i + b[i] <= n)
            en[i + b[i]].pb(i);
    }
    
    for(int i=1; i<=n; i++){
        for(int j=0; j<st[i].size(); j++)
            updpoint(1 , 1 , pown , st[i][j] , h[st[i][j]]);
        ll l = 1 , r = 0;
        if(i - b[i] >= 1)l = i - b[i];
        if(i - a[i] >= 1)r = i - a[i];
        //cout << l << " " << r << " " << h[i] << '\n';
        if(r >= l)
            upd(1 , 1 , pown , l , r , h[i]);
        for(int j=0; j<ge[i].size(); j++){
            ll cur = get(1 , 1 , pown , ge[i][j].f , i);
            //cout << i << " " << ge[i][j].f << " " << i << " " << cur << '\n';
            ans[ge[i][j].s] = max(ans[ge[i][j].s] , cur);
        }
        for(int j=0; j<en[i].size(); j++)
            updpoint(1 , 1 , pown , en[i][j] , -inf);
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin >> n;
    while(pown <= n)
        pown *= 2;
    for(int i=1; i<=n; i++){
        cin >> h[i] >> a[i] >> b[i];
    }
    
    cin >> q;
    
    for(int i=1; i<=q; i++){
        cin >> kl[i] >> kr[i];
        ans[i] = -1;
    }
    
    solve();
    for(int i=1; i<=n / 2; i++){
        swap(h[i] , h[n - i + 1]);
        swap(a[i] , a[n - i + 1]);
        swap(b[i] , b[n - i + 1]);
    }
    
    for(int i=1; i<=q; i++){
        ll f = kl[i];
        kl[i] = n - kr[i] + 1;
        kr[i] = n - f + 1;
    }
    
    solve();
    
    for(int i=1; i<=q; i++)
        cout << ans[i] << '\n';
    
    
    
    return 0;
}

Compilation message

antennas.cpp: In function 'void solve()':
antennas.cpp:96:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<st[i].size(); j++)
                      ~^~~~~~~~~~~~~
antennas.cpp:104:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<ge[i].size(); j++){
                      ~^~~~~~~~~~~~~
antennas.cpp:109:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<en[i].size(); j++)
                      ~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14584 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 14584 KB Output is correct
7 Correct 14 ms 14584 KB Output is correct
8 Correct 14 ms 14584 KB Output is correct
9 Correct 14 ms 14456 KB Output is correct
10 Correct 15 ms 14584 KB Output is correct
11 Correct 14 ms 14584 KB Output is correct
12 Correct 15 ms 14584 KB Output is correct
13 Correct 15 ms 14584 KB Output is correct
14 Correct 15 ms 14588 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 14 ms 14584 KB Output is correct
17 Correct 14 ms 14584 KB Output is correct
18 Correct 15 ms 14584 KB Output is correct
19 Correct 14 ms 14456 KB Output is correct
20 Correct 14 ms 14584 KB Output is correct
21 Correct 14 ms 14456 KB Output is correct
22 Correct 14 ms 14584 KB Output is correct
23 Correct 14 ms 14456 KB Output is correct
24 Correct 16 ms 14584 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14584 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 14584 KB Output is correct
7 Correct 14 ms 14584 KB Output is correct
8 Correct 14 ms 14584 KB Output is correct
9 Correct 14 ms 14456 KB Output is correct
10 Correct 15 ms 14584 KB Output is correct
11 Correct 14 ms 14584 KB Output is correct
12 Correct 15 ms 14584 KB Output is correct
13 Correct 15 ms 14584 KB Output is correct
14 Correct 15 ms 14588 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 14 ms 14584 KB Output is correct
17 Correct 14 ms 14584 KB Output is correct
18 Correct 15 ms 14584 KB Output is correct
19 Correct 14 ms 14456 KB Output is correct
20 Correct 14 ms 14584 KB Output is correct
21 Correct 14 ms 14456 KB Output is correct
22 Correct 14 ms 14584 KB Output is correct
23 Correct 14 ms 14456 KB Output is correct
24 Correct 16 ms 14584 KB Output is correct
25 Correct 115 ms 25256 KB Output is correct
26 Correct 28 ms 15864 KB Output is correct
27 Correct 163 ms 29432 KB Output is correct
28 Correct 162 ms 29176 KB Output is correct
29 Correct 115 ms 25464 KB Output is correct
30 Correct 118 ms 24824 KB Output is correct
31 Correct 131 ms 28024 KB Output is correct
32 Correct 170 ms 29304 KB Output is correct
33 Correct 154 ms 28920 KB Output is correct
34 Correct 90 ms 21752 KB Output is correct
35 Correct 164 ms 29944 KB Output is correct
36 Correct 166 ms 29048 KB Output is correct
37 Correct 100 ms 22648 KB Output is correct
38 Correct 155 ms 28152 KB Output is correct
39 Correct 36 ms 16632 KB Output is correct
40 Correct 161 ms 28152 KB Output is correct
41 Correct 117 ms 25080 KB Output is correct
42 Correct 158 ms 28024 KB Output is correct
43 Correct 63 ms 19320 KB Output is correct
44 Correct 162 ms 28092 KB Output is correct
45 Correct 40 ms 17144 KB Output is correct
46 Correct 152 ms 28024 KB Output is correct
47 Correct 52 ms 18168 KB Output is correct
48 Correct 159 ms 28024 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 369 ms 40312 KB Output is correct
2 Correct 412 ms 41720 KB Output is correct
3 Correct 270 ms 37240 KB Output is correct
4 Correct 414 ms 41796 KB Output is correct
5 Correct 158 ms 27388 KB Output is correct
6 Correct 403 ms 41852 KB Output is correct
7 Correct 355 ms 39904 KB Output is correct
8 Correct 441 ms 41720 KB Output is correct
9 Correct 60 ms 18424 KB Output is correct
10 Correct 418 ms 41848 KB Output is correct
11 Correct 243 ms 29944 KB Output is correct
12 Correct 421 ms 41720 KB Output is correct
13 Correct 239 ms 41068 KB Output is correct
14 Correct 240 ms 40892 KB Output is correct
15 Correct 229 ms 39956 KB Output is correct
16 Correct 228 ms 40116 KB Output is correct
17 Correct 254 ms 41584 KB Output is correct
18 Correct 225 ms 40392 KB Output is correct
19 Correct 232 ms 40556 KB Output is correct
20 Correct 236 ms 40744 KB Output is correct
21 Correct 232 ms 41060 KB Output is correct
22 Correct 244 ms 40808 KB Output is correct
23 Correct 234 ms 40816 KB Output is correct
24 Correct 216 ms 39568 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14584 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 14584 KB Output is correct
7 Correct 14 ms 14584 KB Output is correct
8 Correct 14 ms 14584 KB Output is correct
9 Correct 14 ms 14456 KB Output is correct
10 Correct 15 ms 14584 KB Output is correct
11 Correct 14 ms 14584 KB Output is correct
12 Correct 15 ms 14584 KB Output is correct
13 Correct 15 ms 14584 KB Output is correct
14 Correct 15 ms 14588 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 14 ms 14584 KB Output is correct
17 Correct 14 ms 14584 KB Output is correct
18 Correct 15 ms 14584 KB Output is correct
19 Correct 14 ms 14456 KB Output is correct
20 Correct 14 ms 14584 KB Output is correct
21 Correct 14 ms 14456 KB Output is correct
22 Correct 14 ms 14584 KB Output is correct
23 Correct 14 ms 14456 KB Output is correct
24 Correct 16 ms 14584 KB Output is correct
25 Correct 115 ms 25256 KB Output is correct
26 Correct 28 ms 15864 KB Output is correct
27 Correct 163 ms 29432 KB Output is correct
28 Correct 162 ms 29176 KB Output is correct
29 Correct 115 ms 25464 KB Output is correct
30 Correct 118 ms 24824 KB Output is correct
31 Correct 131 ms 28024 KB Output is correct
32 Correct 170 ms 29304 KB Output is correct
33 Correct 154 ms 28920 KB Output is correct
34 Correct 90 ms 21752 KB Output is correct
35 Correct 164 ms 29944 KB Output is correct
36 Correct 166 ms 29048 KB Output is correct
37 Correct 100 ms 22648 KB Output is correct
38 Correct 155 ms 28152 KB Output is correct
39 Correct 36 ms 16632 KB Output is correct
40 Correct 161 ms 28152 KB Output is correct
41 Correct 117 ms 25080 KB Output is correct
42 Correct 158 ms 28024 KB Output is correct
43 Correct 63 ms 19320 KB Output is correct
44 Correct 162 ms 28092 KB Output is correct
45 Correct 40 ms 17144 KB Output is correct
46 Correct 152 ms 28024 KB Output is correct
47 Correct 52 ms 18168 KB Output is correct
48 Correct 159 ms 28024 KB Output is correct
49 Correct 369 ms 40312 KB Output is correct
50 Correct 412 ms 41720 KB Output is correct
51 Correct 270 ms 37240 KB Output is correct
52 Correct 414 ms 41796 KB Output is correct
53 Correct 158 ms 27388 KB Output is correct
54 Correct 403 ms 41852 KB Output is correct
55 Correct 355 ms 39904 KB Output is correct
56 Correct 441 ms 41720 KB Output is correct
57 Correct 60 ms 18424 KB Output is correct
58 Correct 418 ms 41848 KB Output is correct
59 Correct 243 ms 29944 KB Output is correct
60 Correct 421 ms 41720 KB Output is correct
61 Correct 239 ms 41068 KB Output is correct
62 Correct 240 ms 40892 KB Output is correct
63 Correct 229 ms 39956 KB Output is correct
64 Correct 228 ms 40116 KB Output is correct
65 Correct 254 ms 41584 KB Output is correct
66 Correct 225 ms 40392 KB Output is correct
67 Correct 232 ms 40556 KB Output is correct
68 Correct 236 ms 40744 KB Output is correct
69 Correct 232 ms 41060 KB Output is correct
70 Correct 244 ms 40808 KB Output is correct
71 Correct 234 ms 40816 KB Output is correct
72 Correct 216 ms 39568 KB Output is correct
73 Correct 646 ms 53496 KB Output is correct
74 Correct 468 ms 43384 KB Output is correct
75 Correct 626 ms 54136 KB Output is correct
76 Correct 833 ms 59256 KB Output is correct
77 Correct 394 ms 39800 KB Output is correct
78 Correct 671 ms 53856 KB Output is correct
79 Correct 707 ms 57080 KB Output is correct
80 Correct 832 ms 59256 KB Output is correct
81 Correct 289 ms 33528 KB Output is correct
82 Correct 607 ms 50808 KB Output is correct
83 Correct 572 ms 46728 KB Output is correct
84 Correct 781 ms 59256 KB Output is correct
85 Correct 448 ms 50924 KB Output is correct
86 Correct 610 ms 57352 KB Output is correct
87 Correct 286 ms 42644 KB Output is correct
88 Correct 579 ms 56632 KB Output is correct
89 Correct 523 ms 53892 KB Output is correct
90 Correct 659 ms 56864 KB Output is correct
91 Correct 394 ms 46700 KB Output is correct
92 Correct 665 ms 57100 KB Output is correct
93 Correct 331 ms 44332 KB Output is correct
94 Correct 668 ms 57216 KB Output is correct
95 Correct 365 ms 45504 KB Output is correct
96 Correct 666 ms 55904 KB Output is correct