oj.uz

Submission #489999

# Submission time Handle Problem Language Result Execution time Memory
489999 2021-11-25T09:29:37 Z balbit Two Antennas (JOI19_antennas) C++14
100 / 100
 996 ms 59356 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 2e5+5;


ll H[maxn], A[maxn], B[maxn];
int n;
vector<pair<int, int> > ev[maxn]; // who, build/not build (1/0)

ll superinf = -inf-inf-1;
ll a[maxn*4], c[maxn*4], tg[maxn*4], d[maxn*4]; // d = max(c-a)
bool istg[maxn*4];

void push(int o, int l, int r) {
    if (tg[o] != superinf) {
        MX(c[o], tg[o]);
        MX(d[o], tg[o] - a[o]);
        if (l!=r) {
            MX(tg[o*2], tg[o]);
            MX(tg[o*2+1], tg[o]);
        }
        tg[o] = superinf;
    }
}

inline void pull(int o) {
    a[o] = min(a[o*2], a[o*2+1]);
    c[o] = max(c[o*2], c[o*2+1]);
    d[o] = max(d[o], max(d[o*2], d[o*2+1]));
}

void MOset(int p, bool moa, ll v, int o=1, int l=0, int r=maxn-1) {
    push(o,l,r);
    if (l > p || r < p) return;
    if (l == r) {
        if (moa) a[o] = v;
        else c[o] = v;
        MX(d[o], c[o]-a[o]);
        return;
    }
    int mid = (l+r)/2;
    MOset(p, moa, v, o*2,l,mid);
    MOset(p, moa, v, o*2+1,mid+1,r);
    pull(o);
}

void MOrng(int L, int R, ll v, int o=1, int l=0, int r=maxn-1) {
    push(o,l,r);
    if (l > R || r < L) return;
    if (l >= L && r <= R) {
        MX(tg[o], v);
        push(o,l,r);
        return;
    }
    int mid = (l+r)/2;
    MOrng(L,R,v,o*2,l,mid);
    MOrng(L,R,v,o*2+1,mid+1,r);
    pull(o);
}

ll QU(int L, int R, int o=1, int l=0, int r=maxn-1) {
    if (l > R || r < L) return -inf;
    push(o,l,r);
    if (l >= L && r <= R) return d[o];
    int mid = (l+r)/2;
    return max(QU(L,R,o*2,l,mid),
               QU(L,R,o*2+1,mid+1,r)
               );
}

vector<pii> ask[maxn];
ll ans[maxn];

void go(){
    REP(i,maxn*4){
        a[i] = inf;
        c[i] = -inf;
        d[i] = -inf;
        tg[i] = superinf;
    }
    REP(r,n) {
        for (pii p : ev[r]) {
            int who = p.f;
            bool build = p.s;
            if (build){
                MOset(who, 0, -inf);
                MOset(who, 1, H[who]);
            }else{
                MOset(who, 1, inf);
            }
        }
        // do me!
        int lp = max(0ll, r-B[r]), rp = max(-1ll, r-A[r]);
        MOrng(lp, rp, H[r]);

        for (pii p : ask[r]) {
            ans[p.s] = max(ans[p.s], QU(p.f, r));
//            if (QU(p.f, r) == 9) {
//                bug(r);
//            }
        }
    }
}

signed main(){
    IOS();
    memset(ans, -1, sizeof ans);
    cin>>n;
    REP(i,n) {
        cin>>H[i]>>A[i]>>B[i];
    }
    int q; cin>>q;
    REP(i,q) {
        int l,r; cin>>l>>r; --l; --r;
        ask[r].pb({l,i});
    }
    REP(i,n) {
        if (i+A[i] < n) ev[i+A[i]].pb({i,1});
        if (i+B[i]+1 < n) ev[i+B[i]+1].pb({i,0});
    }

    go();
    REP(i,n) H[i] = -H[i];
    go();
    REP(i,q) {
        cout<<ans[i]<<endl;
    }

}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 36244 KB Output is correct
2 Correct 20 ms 36296 KB Output is correct
3 Correct 21 ms 36308 KB Output is correct
4 Correct 20 ms 36300 KB Output is correct
5 Correct 21 ms 36372 KB Output is correct
6 Correct 20 ms 36308 KB Output is correct
7 Correct 19 ms 36300 KB Output is correct
8 Correct 21 ms 36372 KB Output is correct
9 Correct 20 ms 36368 KB Output is correct
10 Correct 26 ms 36268 KB Output is correct
11 Correct 20 ms 36240 KB Output is correct
12 Correct 20 ms 36340 KB Output is correct
13 Correct 20 ms 36360 KB Output is correct
14 Correct 20 ms 36300 KB Output is correct
15 Correct 19 ms 36368 KB Output is correct
16 Correct 19 ms 36376 KB Output is correct
17 Correct 20 ms 36284 KB Output is correct
18 Correct 23 ms 36300 KB Output is correct
19 Correct 19 ms 36300 KB Output is correct
20 Correct 20 ms 36276 KB Output is correct
21 Correct 20 ms 36300 KB Output is correct
22 Correct 20 ms 36284 KB Output is correct
23 Correct 21 ms 36248 KB Output is correct
24 Correct 20 ms 36376 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 36244 KB Output is correct
2 Correct 20 ms 36296 KB Output is correct
3 Correct 21 ms 36308 KB Output is correct
4 Correct 20 ms 36300 KB Output is correct
5 Correct 21 ms 36372 KB Output is correct
6 Correct 20 ms 36308 KB Output is correct
7 Correct 19 ms 36300 KB Output is correct
8 Correct 21 ms 36372 KB Output is correct
9 Correct 20 ms 36368 KB Output is correct
10 Correct 26 ms 36268 KB Output is correct
11 Correct 20 ms 36240 KB Output is correct
12 Correct 20 ms 36340 KB Output is correct
13 Correct 20 ms 36360 KB Output is correct
14 Correct 20 ms 36300 KB Output is correct
15 Correct 19 ms 36368 KB Output is correct
16 Correct 19 ms 36376 KB Output is correct
17 Correct 20 ms 36284 KB Output is correct
18 Correct 23 ms 36300 KB Output is correct
19 Correct 19 ms 36300 KB Output is correct
20 Correct 20 ms 36276 KB Output is correct
21 Correct 20 ms 36300 KB Output is correct
22 Correct 20 ms 36284 KB Output is correct
23 Correct 21 ms 36248 KB Output is correct
24 Correct 20 ms 36376 KB Output is correct
25 Correct 121 ms 42232 KB Output is correct
26 Correct 33 ms 37060 KB Output is correct
27 Correct 178 ms 44712 KB Output is correct
28 Correct 195 ms 44868 KB Output is correct
29 Correct 119 ms 42196 KB Output is correct
30 Correct 128 ms 42060 KB Output is correct
31 Correct 150 ms 43528 KB Output is correct
32 Correct 167 ms 44772 KB Output is correct
33 Correct 161 ms 44180 KB Output is correct
34 Correct 95 ms 40504 KB Output is correct
35 Correct 171 ms 44640 KB Output is correct
36 Correct 203 ms 44824 KB Output is correct
37 Correct 105 ms 40712 KB Output is correct
38 Correct 167 ms 43836 KB Output is correct
39 Correct 50 ms 37372 KB Output is correct
40 Correct 165 ms 43808 KB Output is correct
41 Correct 129 ms 41832 KB Output is correct
42 Correct 196 ms 43900 KB Output is correct
43 Correct 69 ms 38788 KB Output is correct
44 Correct 164 ms 43844 KB Output is correct
45 Correct 47 ms 37572 KB Output is correct
46 Correct 176 ms 43820 KB Output is correct
47 Correct 60 ms 38268 KB Output is correct
48 Correct 172 ms 43840 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 48232 KB Output is correct
2 Correct 516 ms 49532 KB Output is correct
3 Correct 341 ms 45516 KB Output is correct
4 Correct 585 ms 49536 KB Output is correct
5 Correct 222 ms 42328 KB Output is correct
6 Correct 530 ms 48204 KB Output is correct
7 Correct 445 ms 47012 KB Output is correct
8 Correct 576 ms 48152 KB Output is correct
9 Correct 101 ms 38340 KB Output is correct
10 Correct 531 ms 48164 KB Output is correct
11 Correct 298 ms 44560 KB Output is correct
12 Correct 616 ms 48160 KB Output is correct
13 Correct 359 ms 47376 KB Output is correct
14 Correct 307 ms 47400 KB Output is correct
15 Correct 318 ms 47600 KB Output is correct
16 Correct 325 ms 48384 KB Output is correct
17 Correct 343 ms 48392 KB Output is correct
18 Correct 333 ms 48284 KB Output is correct
19 Correct 379 ms 47504 KB Output is correct
20 Correct 345 ms 47780 KB Output is correct
21 Correct 306 ms 46512 KB Output is correct
22 Correct 414 ms 47172 KB Output is correct
23 Correct 309 ms 47440 KB Output is correct
24 Correct 300 ms 47944 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 36244 KB Output is correct
2 Correct 20 ms 36296 KB Output is correct
3 Correct 21 ms 36308 KB Output is correct
4 Correct 20 ms 36300 KB Output is correct
5 Correct 21 ms 36372 KB Output is correct
6 Correct 20 ms 36308 KB Output is correct
7 Correct 19 ms 36300 KB Output is correct
8 Correct 21 ms 36372 KB Output is correct
9 Correct 20 ms 36368 KB Output is correct
10 Correct 26 ms 36268 KB Output is correct
11 Correct 20 ms 36240 KB Output is correct
12 Correct 20 ms 36340 KB Output is correct
13 Correct 20 ms 36360 KB Output is correct
14 Correct 20 ms 36300 KB Output is correct
15 Correct 19 ms 36368 KB Output is correct
16 Correct 19 ms 36376 KB Output is correct
17 Correct 20 ms 36284 KB Output is correct
18 Correct 23 ms 36300 KB Output is correct
19 Correct 19 ms 36300 KB Output is correct
20 Correct 20 ms 36276 KB Output is correct
21 Correct 20 ms 36300 KB Output is correct
22 Correct 20 ms 36284 KB Output is correct
23 Correct 21 ms 36248 KB Output is correct
24 Correct 20 ms 36376 KB Output is correct
25 Correct 121 ms 42232 KB Output is correct
26 Correct 33 ms 37060 KB Output is correct
27 Correct 178 ms 44712 KB Output is correct
28 Correct 195 ms 44868 KB Output is correct
29 Correct 119 ms 42196 KB Output is correct
30 Correct 128 ms 42060 KB Output is correct
31 Correct 150 ms 43528 KB Output is correct
32 Correct 167 ms 44772 KB Output is correct
33 Correct 161 ms 44180 KB Output is correct
34 Correct 95 ms 40504 KB Output is correct
35 Correct 171 ms 44640 KB Output is correct
36 Correct 203 ms 44824 KB Output is correct
37 Correct 105 ms 40712 KB Output is correct
38 Correct 167 ms 43836 KB Output is correct
39 Correct 50 ms 37372 KB Output is correct
40 Correct 165 ms 43808 KB Output is correct
41 Correct 129 ms 41832 KB Output is correct
42 Correct 196 ms 43900 KB Output is correct
43 Correct 69 ms 38788 KB Output is correct
44 Correct 164 ms 43844 KB Output is correct
45 Correct 47 ms 37572 KB Output is correct
46 Correct 176 ms 43820 KB Output is correct
47 Correct 60 ms 38268 KB Output is correct
48 Correct 172 ms 43840 KB Output is correct
49 Correct 480 ms 48232 KB Output is correct
50 Correct 516 ms 49532 KB Output is correct
51 Correct 341 ms 45516 KB Output is correct
52 Correct 585 ms 49536 KB Output is correct
53 Correct 222 ms 42328 KB Output is correct
54 Correct 530 ms 48204 KB Output is correct
55 Correct 445 ms 47012 KB Output is correct
56 Correct 576 ms 48152 KB Output is correct
57 Correct 101 ms 38340 KB Output is correct
58 Correct 531 ms 48164 KB Output is correct
59 Correct 298 ms 44560 KB Output is correct
60 Correct 616 ms 48160 KB Output is correct
61 Correct 359 ms 47376 KB Output is correct
62 Correct 307 ms 47400 KB Output is correct
63 Correct 318 ms 47600 KB Output is correct
64 Correct 325 ms 48384 KB Output is correct
65 Correct 343 ms 48392 KB Output is correct
66 Correct 333 ms 48284 KB Output is correct
67 Correct 379 ms 47504 KB Output is correct
68 Correct 345 ms 47780 KB Output is correct
69 Correct 306 ms 46512 KB Output is correct
70 Correct 414 ms 47172 KB Output is correct
71 Correct 309 ms 47440 KB Output is correct
72 Correct 300 ms 47944 KB Output is correct
73 Correct 815 ms 52600 KB Output is correct
74 Correct 593 ms 50336 KB Output is correct
75 Correct 678 ms 55012 KB Output is correct
76 Correct 996 ms 59352 KB Output is correct
77 Correct 431 ms 49112 KB Output is correct
78 Correct 809 ms 56088 KB Output is correct
79 Correct 870 ms 57432 KB Output is correct
80 Correct 836 ms 59356 KB Output is correct
81 Correct 289 ms 46940 KB Output is correct
82 Correct 680 ms 54376 KB Output is correct
83 Correct 602 ms 53956 KB Output is correct
84 Correct 922 ms 59228 KB Output is correct
85 Correct 496 ms 53956 KB Output is correct
86 Correct 625 ms 57204 KB Output is correct
87 Correct 363 ms 50220 KB Output is correct
88 Correct 660 ms 58164 KB Output is correct
89 Correct 568 ms 55988 KB Output is correct
90 Correct 639 ms 58176 KB Output is correct
91 Correct 415 ms 51780 KB Output is correct
92 Correct 604 ms 57612 KB Output is correct
93 Correct 359 ms 49496 KB Output is correct
94 Correct 627 ms 57076 KB Output is correct
95 Correct 399 ms 51000 KB Output is correct
96 Correct 606 ms 57768 KB Output is correct