oj.uz

Submission #249221

# Submission time Handle Problem Language Result Execution time Memory
249221 2020-07-14T13:43:16 Z egekabas Two Antennas (JOI19_antennas) C++14
100 / 100
 777 ms 53368 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
const int inf = 1e9+5;
struct node{
    int ans, val;
    node(){
        ans = -1;
        val = inf; 
    }
};
node merge(node &a, node &b){
    node ret;
    ret.ans = max(a.ans, b.ans);
    ret.val = min(a.val, b.val);
    return ret;
}
int n, q;
struct seg{
    node t[800009];
    int lazy[800009];
    void start(){
        for(int i = 0; i <= 4*n; ++i)
            lazy[i] = -inf;
    }
    void push(int v){
        lazy[2*v] = max(lazy[2*v], lazy[v]);
        lazy[2*v+1] = max(lazy[2*v+1], lazy[v]);
        lazy[v] = -inf;
        t[2*v].ans = max(t[2*v].ans, lazy[2*v]-t[2*v].val);
        t[2*v+1].ans = max(t[2*v+1].ans, lazy[2*v+1]-t[2*v+1].val);
    }
    void changeval(int v, int tl, int tr, int idx, int val){
        if(tl == idx && tr == idx){
            t[v].val = val;
            lazy[v] = -inf;
            return;
        }
        push(v);
        if(idx <= (tl+tr)/2)
            changeval(2*v, tl, (tl+tr)/2, idx, val);
        else
            changeval(2*v+1, (tl+tr)/2+1, tr, idx, val);
        t[v] = merge(t[2*v], t[2*v+1]);
    }
    void updrange(int v, int tl, int tr, int l, int r, int val){
        if(tr < l || r < tl)
            return;
        if(l <= tl && tr <= r){
            lazy[v] = max(lazy[v], val);
            t[v].ans = max(t[v].ans, lazy[v]-t[v].val);
        }
        else{
            push(v);
            updrange(2*v, tl, (tl+tr)/2, l, r, val);
            updrange(2*v+1, (tl+tr)/2+1, tr, l, r, val);
            t[v] = merge(t[2*v], t[2*v+1]);
        }
    }
    int get(int v, int tl, int tr, int l, int r){
        if(tr < l || r < tl)
            return -1;
        if(l <= tl && tr <= r){
            return t[v].ans;
        }
        else{
            push(v);
            return max(get(2*v, tl, (tl+tr)/2, l, r), get(2*v+1, (tl+tr)/2+1, tr, l, r));
        }
    }
};
struct ant{
    int h, a, b;
};
ant a[200009];
vector<pii> query[200009];
seg s1, s2;
vector<int> add[200009];
vector<int> erase[200009];
int ans[200009];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    cin >> n;
    for(int i = 0; i < n; ++i)
        cin >> a[i].h >> a[i].a >> a[i].b;
    cin >> q;
    for(int i = 0; i < q; ++i){
        int l, r;
        cin >> l >> r;
        --l; --r;
        query[l].pb({r, i});
    }
    s1.start();
    s2.start();
    for(int i = n-1; i >= 0; --i){
        for(auto u : add[i]){
            s1.changeval(1, 0, n-1, u, a[u].h);
            s2.changeval(1, 0, n-1, u, -a[u].h);
        }
        s1.updrange(1, 0, n-1, i+a[i].a, i+a[i].b, a[i].h);
        s2.updrange(1, 0, n-1, i+a[i].a, i+a[i].b, -a[i].h);
    
        for(auto u : query[i])
            ans[u.ss] = max(s1.get(1, 0, n-1, i, u.ff), s2.get(1, 0, n-1, i, u.ff));
        if(i-a[i].a >= 0)
            add[i-a[i].a].pb(i);
        if(i-a[i].b >= 0)
            erase[i-a[i].b].pb(i);
        for(auto u : erase[i]){
            s1.changeval(1, 0, n-1, u, inf);
            s2.changeval(1, 0, n-1, u, inf);
        }
    }
    for(int i = 0; i < q; ++i)
        cout << ans[i] << '\n';
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27008 KB Output is correct
2 Correct 18 ms 27008 KB Output is correct
3 Correct 16 ms 27008 KB Output is correct
4 Correct 16 ms 27008 KB Output is correct
5 Correct 16 ms 27136 KB Output is correct
6 Correct 16 ms 27008 KB Output is correct
7 Correct 16 ms 27008 KB Output is correct
8 Correct 16 ms 26968 KB Output is correct
9 Correct 16 ms 27008 KB Output is correct
10 Correct 16 ms 27008 KB Output is correct
11 Correct 16 ms 27008 KB Output is correct
12 Correct 17 ms 27136 KB Output is correct
13 Correct 16 ms 27008 KB Output is correct
14 Correct 16 ms 27008 KB Output is correct
15 Correct 16 ms 27008 KB Output is correct
16 Correct 17 ms 27008 KB Output is correct
17 Correct 16 ms 27008 KB Output is correct
18 Correct 17 ms 27008 KB Output is correct
19 Correct 17 ms 27052 KB Output is correct
20 Correct 18 ms 27008 KB Output is correct
21 Correct 22 ms 27008 KB Output is correct
22 Correct 16 ms 27008 KB Output is correct
23 Correct 16 ms 27008 KB Output is correct
24 Correct 16 ms 27008 KB Output is correct
25 Correct 115 ms 31884 KB Output is correct
26 Correct 31 ms 27640 KB Output is correct
27 Correct 163 ms 33824 KB Output is correct
28 Correct 160 ms 33784 KB Output is correct
29 Correct 110 ms 32120 KB Output is correct
30 Correct 120 ms 31904 KB Output is correct
31 Correct 121 ms 33016 KB Output is correct
32 Correct 194 ms 33696 KB Output is correct
33 Correct 155 ms 33788 KB Output is correct
34 Correct 87 ms 30328 KB Output is correct
35 Correct 159 ms 34296 KB Output is correct
36 Correct 159 ms 33656 KB Output is correct
37 Correct 96 ms 30456 KB Output is correct
38 Correct 154 ms 32632 KB Output is correct
39 Correct 37 ms 27896 KB Output is correct
40 Correct 163 ms 32888 KB Output is correct
41 Correct 124 ms 31612 KB Output is correct
42 Correct 152 ms 32632 KB Output is correct
43 Correct 63 ms 29176 KB Output is correct
44 Correct 163 ms 32660 KB Output is correct
45 Correct 42 ms 28152 KB Output is correct
46 Correct 163 ms 32760 KB Output is correct
47 Correct 53 ms 28664 KB Output is correct
48 Correct 155 ms 32632 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 360 ms 41976 KB Output is correct
2 Correct 423 ms 43772 KB Output is correct
3 Correct 275 ms 38656 KB Output is correct
4 Correct 423 ms 43640 KB Output is correct
5 Correct 185 ms 34552 KB Output is correct
6 Correct 436 ms 43728 KB Output is correct
7 Correct 364 ms 41368 KB Output is correct
8 Correct 445 ms 43768 KB Output is correct
9 Correct 62 ms 29568 KB Output is correct
10 Correct 423 ms 43640 KB Output is correct
11 Correct 238 ms 37412 KB Output is correct
12 Correct 408 ms 43640 KB Output is correct
13 Correct 271 ms 42744 KB Output is correct
14 Correct 261 ms 42104 KB Output is correct
15 Correct 241 ms 41292 KB Output is correct
16 Correct 257 ms 41204 KB Output is correct
17 Correct 279 ms 42744 KB Output is correct
18 Correct 278 ms 41672 KB Output is correct
19 Correct 263 ms 42000 KB Output is correct
20 Correct 263 ms 41976 KB Output is correct
21 Correct 239 ms 42616 KB Output is correct
22 Correct 253 ms 41976 KB Output is correct
23 Correct 262 ms 42168 KB Output is correct
24 Correct 256 ms 41172 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27008 KB Output is correct
2 Correct 18 ms 27008 KB Output is correct
3 Correct 16 ms 27008 KB Output is correct
4 Correct 16 ms 27008 KB Output is correct
5 Correct 16 ms 27136 KB Output is correct
6 Correct 16 ms 27008 KB Output is correct
7 Correct 16 ms 27008 KB Output is correct
8 Correct 16 ms 26968 KB Output is correct
9 Correct 16 ms 27008 KB Output is correct
10 Correct 16 ms 27008 KB Output is correct
11 Correct 16 ms 27008 KB Output is correct
12 Correct 17 ms 27136 KB Output is correct
13 Correct 16 ms 27008 KB Output is correct
14 Correct 16 ms 27008 KB Output is correct
15 Correct 16 ms 27008 KB Output is correct
16 Correct 17 ms 27008 KB Output is correct
17 Correct 16 ms 27008 KB Output is correct
18 Correct 17 ms 27008 KB Output is correct
19 Correct 17 ms 27052 KB Output is correct
20 Correct 18 ms 27008 KB Output is correct
21 Correct 22 ms 27008 KB Output is correct
22 Correct 16 ms 27008 KB Output is correct
23 Correct 16 ms 27008 KB Output is correct
24 Correct 16 ms 27008 KB Output is correct
25 Correct 115 ms 31884 KB Output is correct
26 Correct 31 ms 27640 KB Output is correct
27 Correct 163 ms 33824 KB Output is correct
28 Correct 160 ms 33784 KB Output is correct
29 Correct 110 ms 32120 KB Output is correct
30 Correct 120 ms 31904 KB Output is correct
31 Correct 121 ms 33016 KB Output is correct
32 Correct 194 ms 33696 KB Output is correct
33 Correct 155 ms 33788 KB Output is correct
34 Correct 87 ms 30328 KB Output is correct
35 Correct 159 ms 34296 KB Output is correct
36 Correct 159 ms 33656 KB Output is correct
37 Correct 96 ms 30456 KB Output is correct
38 Correct 154 ms 32632 KB Output is correct
39 Correct 37 ms 27896 KB Output is correct
40 Correct 163 ms 32888 KB Output is correct
41 Correct 124 ms 31612 KB Output is correct
42 Correct 152 ms 32632 KB Output is correct
43 Correct 63 ms 29176 KB Output is correct
44 Correct 163 ms 32660 KB Output is correct
45 Correct 42 ms 28152 KB Output is correct
46 Correct 163 ms 32760 KB Output is correct
47 Correct 53 ms 28664 KB Output is correct
48 Correct 155 ms 32632 KB Output is correct
49 Correct 360 ms 41976 KB Output is correct
50 Correct 423 ms 43772 KB Output is correct
51 Correct 275 ms 38656 KB Output is correct
52 Correct 423 ms 43640 KB Output is correct
53 Correct 185 ms 34552 KB Output is correct
54 Correct 436 ms 43728 KB Output is correct
55 Correct 364 ms 41368 KB Output is correct
56 Correct 445 ms 43768 KB Output is correct
57 Correct 62 ms 29568 KB Output is correct
58 Correct 423 ms 43640 KB Output is correct
59 Correct 238 ms 37412 KB Output is correct
60 Correct 408 ms 43640 KB Output is correct
61 Correct 271 ms 42744 KB Output is correct
62 Correct 261 ms 42104 KB Output is correct
63 Correct 241 ms 41292 KB Output is correct
64 Correct 257 ms 41204 KB Output is correct
65 Correct 279 ms 42744 KB Output is correct
66 Correct 278 ms 41672 KB Output is correct
67 Correct 263 ms 42000 KB Output is correct
68 Correct 263 ms 41976 KB Output is correct
69 Correct 239 ms 42616 KB Output is correct
70 Correct 253 ms 41976 KB Output is correct
71 Correct 262 ms 42168 KB Output is correct
72 Correct 256 ms 41172 KB Output is correct
73 Correct 627 ms 49400 KB Output is correct
74 Correct 451 ms 44536 KB Output is correct
75 Correct 571 ms 47736 KB Output is correct
76 Correct 777 ms 53368 KB Output is correct
77 Correct 396 ms 41008 KB Output is correct
78 Correct 653 ms 50424 KB Output is correct
79 Correct 654 ms 50788 KB Output is correct
80 Correct 729 ms 53240 KB Output is correct
81 Correct 267 ms 36984 KB Output is correct
82 Correct 570 ms 48888 KB Output is correct
83 Correct 523 ms 46200 KB Output is correct
84 Correct 719 ms 53292 KB Output is correct
85 Correct 467 ms 47708 KB Output is correct
86 Correct 572 ms 50580 KB Output is correct
87 Correct 311 ms 42700 KB Output is correct
88 Correct 602 ms 49652 KB Output is correct
89 Correct 533 ms 49272 KB Output is correct
90 Correct 597 ms 50120 KB Output is correct
91 Correct 374 ms 45052 KB Output is correct
92 Correct 605 ms 50552 KB Output is correct
93 Correct 301 ms 44152 KB Output is correct
94 Correct 556 ms 50424 KB Output is correct
95 Correct 345 ms 44568 KB Output is correct
96 Correct 574 ms 49748 KB Output is correct