oj.uz

Submission #653175

# Submission time Handle Problem Language Result Execution time Memory
653175 2022-10-26T01:28:55 Z perchuts Two Antennas (JOI19_antennas) C++17
100 / 100
 995 ms 42412 KB 
//https://codeforces.com/blog/entry/66022?#comment-500622 

//line sweep com 4 tipos de eventos: 
//1-query 
//2-inserir antena 
//3-remover antena 
//4-atualizar a resposta 

//pra processar eventos, usar seg + lazy

//o porquê de precisar processar os eventos nas 2 ordens: note que quermos selecionar dois indices i<j pra cada query, e na seg,
//ou h[i]>h[j] ou h[j]>h[i]. Daí, queremos maximizar ou h[i] ou h[j]. Com os eventos crescendo no tempo maximizamos h[i] e maximizamos
//h[j] diminuindo no tempo. Dá pra fazer tudo de uma vez, mas o código ficaria mais confuso.
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define pb push_back
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ii = pair<int,int>;
using iii = tuple<int,int,int>;

const int inf = 1e9+1;
const int mod = 1e9+7;
const int maxn = 2e5+100;

template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }

pair<int, ii> ant[maxn];

int n, ans[maxn], lazy[4*maxn], c[4*maxn], d[4*maxn];

ii qu[maxn];

void push(int i,int l,int r){
    if(lazy[i]==inf)return;

    ckmax(d[i], c[i] - lazy[i]);

    if(l!=r)ckmin(lazy[2*i], lazy[i]), ckmin(lazy[2*i+1], lazy[i]);

    lazy[i] = inf;
}

void update(int i,int l,int r,int x,int y,int k){
    if(x>y)return;
    
    push(i,l,r);

    if(l>y||r<x)return;
    
    if(x<=l&&r<=y){
        ckmin(lazy[i], k);
        push(i,l,r); 
        return;
    }

    int md = (l+r)/2;

    update(2*i, l, md, x, y, k), update(2*i+1, md+1, r, x, y, k);

    d[i] = max(d[2*i], d[2*i+1]), c[i] = max(c[2*i], c[2*i+1]);
}

int query(int i,int l,int r,int x,int y){
    push(i,l,r);

    if(l>y||r<x)return -1;

    if(x<=l&&r<=y)return d[i];

    int md = (l+r)/2;

    return max(query(2*i, l, md, x, y), query(2*i+1, md+1, r, x, y));
}

void upd(int i,int l,int r,int x,int k){
    push(i,l,r);

    if(l>x||r<x)return;

    if(l==r){
        c[i] = k;
        return;
    }   

    int md = (l+r)/2;

    upd(2*i, l, md, x, k), upd(2*i+1, md+1, r, x, k);

    d[i] = max(d[2*i], d[2*i+1]), c[i] = max(c[2*i], c[2*i+1]);
}

void init(){
    for(int i=0;i<=4*n;++i)d[i] = c[i] = -1, lazy[i] = inf;
}

int main(){_
    cin>>n;

    vector<pair<int,ii>>eventos1, eventos2;

    for(int i=0;i<n;++i){
        cin>>ant[i].first>>ant[i].second.first>>ant[i].second.second;
        
        eventos1.pb({i+ant[i].second.first, {-2, i}});
        eventos1.pb({i, {-1, i}});
        eventos1.pb({i+ant[i].second.second, {maxn, i}});

        eventos2.pb({i-ant[i].second.first, {maxn+1, i}});
        eventos2.pb({i, {maxn, i}});
        eventos2.pb({i-ant[i].second.second, {-1, i}});
    }

    int q;cin>>q;

    fill(ans,ans+q,-1);

    for(int i=0;i<q;++i){
        cin>>qu[i].first>>qu[i].second;
        --qu[i].first, --qu[i].second;
        eventos1.pb({qu[i].second,{i, qu[i].first}});
        eventos2.pb({qu[i].first,{i, qu[i].second}});
    }

    sort(all(eventos1)), sort(rbegin(eventos2), rend(eventos2));

    init();

    for(auto [x,p]:eventos1){
        auto [t, y] = p;
        if(t==-1){//atualizar o d (resposta)
            update(1,0,n-1, max(0, y-ant[y].second.second), y-ant[y].second.first, ant[y].first);
        }
        else if(t==-2){//inserir o y na seg
            upd(1,0,n-1, y, ant[y].first);                                          
        }
        else if(t==maxn){//remover o y da seg
            upd(1,0,n-1, y, -inf);
        }
        else{//responder a query de indice t
            ckmax(ans[t], query(1,0,n-1, y, x));
        }
    }

    init();

    for(auto [x,p]:eventos2){
        auto [t, y] = p;
        if(t==maxn){//atualizar o d (resposta)
            update(1,0,n-1, y+ant[y].second.first, min(n-1,y+ant[y].second.second), ant[y].first);
        }
        else if(t==maxn+1){//inserir o y na seg
            upd(1,0,n-1, y, ant[y].first);
        }
        else if(t==-1){//remover o y da seg
            upd(1,0,n-1, y, -inf);
        }
        else{//responder a query de indice t
            ckmax(ans[t], query(1,0,n-1, x, y));
        }
    }

    for(int i=0;i<q;++i)cout<<ans[i]<<endl;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 126 ms 8188 KB Output is correct
26 Correct 21 ms 1476 KB Output is correct
27 Correct 196 ms 11260 KB Output is correct
28 Correct 184 ms 11336 KB Output is correct
29 Correct 127 ms 8204 KB Output is correct
30 Correct 127 ms 7860 KB Output is correct
31 Correct 153 ms 10516 KB Output is correct
32 Correct 189 ms 11448 KB Output is correct
33 Correct 169 ms 10708 KB Output is correct
34 Correct 93 ms 5816 KB Output is correct
35 Correct 183 ms 11192 KB Output is correct
36 Correct 197 ms 11336 KB Output is correct
37 Correct 107 ms 6260 KB Output is correct
38 Correct 183 ms 10416 KB Output is correct
39 Correct 29 ms 2168 KB Output is correct
40 Correct 180 ms 10420 KB Output is correct
41 Correct 134 ms 7988 KB Output is correct
42 Correct 177 ms 10536 KB Output is correct
43 Correct 62 ms 4164 KB Output is correct
44 Correct 176 ms 10316 KB Output is correct
45 Correct 33 ms 2268 KB Output is correct
46 Correct 177 ms 10432 KB Output is correct
47 Correct 50 ms 3180 KB Output is correct
48 Correct 187 ms 10400 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 587 ms 23692 KB Output is correct
2 Correct 648 ms 26256 KB Output is correct
3 Correct 429 ms 18656 KB Output is correct
4 Correct 640 ms 26252 KB Output is correct
5 Correct 265 ms 12428 KB Output is correct
6 Correct 699 ms 26256 KB Output is correct
7 Correct 556 ms 22800 KB Output is correct
8 Correct 656 ms 26224 KB Output is correct
9 Correct 81 ms 4540 KB Output is correct
10 Correct 636 ms 26224 KB Output is correct
11 Correct 367 ms 16648 KB Output is correct
12 Correct 614 ms 26252 KB Output is correct
13 Correct 433 ms 26244 KB Output is correct
14 Correct 416 ms 26288 KB Output is correct
15 Correct 414 ms 26344 KB Output is correct
16 Correct 386 ms 26228 KB Output is correct
17 Correct 456 ms 26264 KB Output is correct
18 Correct 405 ms 26308 KB Output is correct
19 Correct 413 ms 26376 KB Output is correct
20 Correct 408 ms 26348 KB Output is correct
21 Correct 402 ms 26248 KB Output is correct
22 Correct 411 ms 26184 KB Output is correct
23 Correct 417 ms 26260 KB Output is correct
24 Correct 399 ms 26252 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 126 ms 8188 KB Output is correct
26 Correct 21 ms 1476 KB Output is correct
27 Correct 196 ms 11260 KB Output is correct
28 Correct 184 ms 11336 KB Output is correct
29 Correct 127 ms 8204 KB Output is correct
30 Correct 127 ms 7860 KB Output is correct
31 Correct 153 ms 10516 KB Output is correct
32 Correct 189 ms 11448 KB Output is correct
33 Correct 169 ms 10708 KB Output is correct
34 Correct 93 ms 5816 KB Output is correct
35 Correct 183 ms 11192 KB Output is correct
36 Correct 197 ms 11336 KB Output is correct
37 Correct 107 ms 6260 KB Output is correct
38 Correct 183 ms 10416 KB Output is correct
39 Correct 29 ms 2168 KB Output is correct
40 Correct 180 ms 10420 KB Output is correct
41 Correct 134 ms 7988 KB Output is correct
42 Correct 177 ms 10536 KB Output is correct
43 Correct 62 ms 4164 KB Output is correct
44 Correct 176 ms 10316 KB Output is correct
45 Correct 33 ms 2268 KB Output is correct
46 Correct 177 ms 10432 KB Output is correct
47 Correct 50 ms 3180 KB Output is correct
48 Correct 187 ms 10400 KB Output is correct
49 Correct 587 ms 23692 KB Output is correct
50 Correct 648 ms 26256 KB Output is correct
51 Correct 429 ms 18656 KB Output is correct
52 Correct 640 ms 26252 KB Output is correct
53 Correct 265 ms 12428 KB Output is correct
54 Correct 699 ms 26256 KB Output is correct
55 Correct 556 ms 22800 KB Output is correct
56 Correct 656 ms 26224 KB Output is correct
57 Correct 81 ms 4540 KB Output is correct
58 Correct 636 ms 26224 KB Output is correct
59 Correct 367 ms 16648 KB Output is correct
60 Correct 614 ms 26252 KB Output is correct
61 Correct 433 ms 26244 KB Output is correct
62 Correct 416 ms 26288 KB Output is correct
63 Correct 414 ms 26344 KB Output is correct
64 Correct 386 ms 26228 KB Output is correct
65 Correct 456 ms 26264 KB Output is correct
66 Correct 405 ms 26308 KB Output is correct
67 Correct 413 ms 26376 KB Output is correct
68 Correct 408 ms 26348 KB Output is correct
69 Correct 402 ms 26248 KB Output is correct
70 Correct 411 ms 26184 KB Output is correct
71 Correct 417 ms 26260 KB Output is correct
72 Correct 399 ms 26252 KB Output is correct
73 Correct 848 ms 36464 KB Output is correct
74 Correct 684 ms 31700 KB Output is correct
75 Correct 765 ms 33260 KB Output is correct
76 Correct 995 ms 42400 KB Output is correct
77 Correct 509 ms 22740 KB Output is correct
78 Correct 919 ms 38568 KB Output is correct
79 Correct 897 ms 38368 KB Output is correct
80 Correct 981 ms 42396 KB Output is correct
81 Correct 336 ms 16004 KB Output is correct
82 Correct 788 ms 36340 KB Output is correct
83 Correct 707 ms 30952 KB Output is correct
84 Correct 964 ms 42412 KB Output is correct
85 Correct 606 ms 36644 KB Output is correct
86 Correct 718 ms 41164 KB Output is correct
87 Correct 457 ms 32108 KB Output is correct
88 Correct 679 ms 41184 KB Output is correct
89 Correct 718 ms 38336 KB Output is correct
90 Correct 766 ms 41104 KB Output is correct
91 Correct 549 ms 34024 KB Output is correct
92 Correct 786 ms 41212 KB Output is correct
93 Correct 475 ms 32548 KB Output is correct
94 Correct 748 ms 41148 KB Output is correct
95 Correct 500 ms 33392 KB Output is correct
96 Correct 704 ms 41192 KB Output is correct