oj.uz

Submission #444504

# Submission time Handle Problem Language Result Execution time Memory
444504 2021-07-14T07:52:14 Z Dymo Two Antennas (JOI19_antennas) C++14
100 / 100
 744 ms 31924 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll  int
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
mt19937_64 rnd;

const ll maxn=2e5+10;
const ll mod =1e9+7 ;
const ll base=1e9+100;
/// you will be the best but now you just are trash
/// goal=1/7;

struct tk
{
    ll mx_all,mnc,mxc;
    ll la_mn;
    ll la_mx;
};
// val posnw;
// mx = mxnw;
tk st[4*maxn];
tk mer(tk a, tk b)
{
    tk c;
    if (a.mx_all==-base)
        return b;
    if (b.mx_all==-base)
        return a;
    c.mx_all=max(a.mx_all,b.mx_all);
    c.mnc=min(a.mnc,b.mnc);
    c.mxc=max(a.mxc,b.mxc);
    c.la_mn=base;
    c.la_mx=-base;
    return c;
}
void build(ll id,ll left,ll right)
{
    if (left==right)
    {
        st[id].mnc=base;
        st[id].mxc=-base;
        st[id].mx_all=-1;
        st[id].la_mn=base;
        st[id].la_mx=-base;
        return ;
    }
    ll mid=(left+right)/2;
    build(id*2,left,mid);
    build(id*2+1,mid+1,right);
    st[id]=mer(st[id*2],st[id*2+1]);
}
void dosth(ll id,ll left,ll right)
{
    if (left==right)
        return ;
    st[id*2].mx_all=max(st[id*2].mx_all,max(st[id].la_mx-st[id*2].mnc,st[id*2].mxc-st[id].la_mn));
    st[id*2+1].mx_all=max(st[id*2+1].mx_all,max(st[id].la_mx-st[id*2+1].mnc,st[id*2+1].mxc-st[id].la_mn));

    st[id*2].la_mn=min(st[id*2].la_mn,st[id].la_mn);
    st[id*2+1].la_mn=min(st[id*2+1].la_mn,st[id].la_mn);
    st[id*2].la_mx=max(st[id*2].la_mx,st[id].la_mx);
    st[id*2+1].la_mx=max(st[id*2+1].la_mx,st[id].la_mx);
    st[id].la_mn=base;
    st[id].la_mx=-base;
}
void update(ll id,ll left,ll right,ll x,ll diff)
{
    if (x>right||x<left)
        return ;
    if (left==right)
    {
        if (diff==base)
        {
            st[id].mnc=base;
            st[id].mxc=-base;
            return ;
        }
        st[id].mnc=diff;
        st[id].mxc=diff;
        return ;
    }
    dosth(id,left,right);
    ll mid=(left+right)/2;
    update(id*2,left,mid,x,diff);
    update(id*2+1,mid+1,right,x,diff);
    st[id]=mer(st[id*2],st[id*2+1]);
}
void update_val(ll id,ll left,ll right,ll x,ll y,ll val)
{
    if (x>right||y<left)
        return ;
    if (x<=left&&y>=right)
    {
        st[id].mx_all=max(st[id].mx_all,max(val-st[id].mnc,st[id].mxc-val));
        st[id].la_mn=min(st[id].la_mn,val);
        st[id].la_mx=max(st[id].la_mx,val);
        return ;
    }
    dosth(id,left,right);
    ll mid=(left+right)/2;
    update_val(id*2,left,mid,x,y,val);
    update_val(id*2+1,mid+1,right,x,y,val);
    st[id]=mer(st[id*2],st[id*2+1]);
}
tk get(ll id,ll left,ll right,ll x,ll y)
{
    tk c;
    c.mx_all=-base;
    if (x>right||y<left)
        return c;
    if (x<=left&&y>=right)
        return st[id];
    dosth(id,left,right);
    ll mid=(left+right)/2;
    return mer(get(id*2,left,mid,x,y),get(id*2+1,mid+1,right,x,y));
}
ll h[maxn];
ll a[maxn];
ll b[maxn];
ll ans[maxn];
vector<pll> p[maxn];
vector<pll> adj[maxn];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("t.inp", "r"))
    {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    ll n;
    cin>>n ;
    for (int i=1; i<=n; i++)
    {
        cin>>h[i]>>a[i]>>b[i];
    }
    ll q;
    cin>> q;
    for (int i=1; i<=q; i++)
    {
        ll l, r;
        cin>> l>> r;
        p[r].pb(make_pair(l,i));
    }
    build(1,1,n);
    for (int i=1; i<=n; i++)
    {
       if (i+a[i]<=n) adj[i+a[i]].pb(make_pair(i,h[i]));
       if (i+b[i]+1<=n) adj[i+b[i]+1].pb(make_pair(i,base));
       for (auto p:adj[i])
       {
           update(1,1,n,p.ff,p.ss);
       }
       ll l=max(1,i-b[i]);
       ll r=i-a[i];
       if (r>=l)
       {
           update_val(1,1,n,l,r,h[i]);
       }
       for (auto h:p[i])
       {
           tk a=get(1,1,n,h.ff,i);
           ans[h.ss]=a.mx_all;
       }
    }
    for (int i=1;i<=q;i++)
    {
        cout <<ans[i]<<endl;
    }



}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:135:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:136:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  136 |         freopen("test.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 7 ms 9676 KB Output is correct
5 Correct 6 ms 9768 KB Output is correct
6 Correct 6 ms 9772 KB Output is correct
7 Correct 7 ms 9676 KB Output is correct
8 Correct 7 ms 9676 KB Output is correct
9 Correct 8 ms 9676 KB Output is correct
10 Correct 8 ms 9676 KB Output is correct
11 Correct 6 ms 9744 KB Output is correct
12 Correct 6 ms 9712 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9768 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 8 ms 9676 KB Output is correct
21 Correct 7 ms 9676 KB Output is correct
22 Correct 8 ms 9676 KB Output is correct
23 Correct 6 ms 9676 KB Output is correct
24 Correct 6 ms 9676 KB Output is correct
25 Correct 112 ms 13380 KB Output is correct
26 Correct 24 ms 10260 KB Output is correct
27 Correct 167 ms 14788 KB Output is correct
28 Correct 168 ms 14796 KB Output is correct
29 Correct 114 ms 13360 KB Output is correct
30 Correct 119 ms 13164 KB Output is correct
31 Correct 130 ms 14304 KB Output is correct
32 Correct 168 ms 14776 KB Output is correct
33 Correct 157 ms 14524 KB Output is correct
34 Correct 107 ms 12164 KB Output is correct
35 Correct 161 ms 14776 KB Output is correct
36 Correct 170 ms 14808 KB Output is correct
37 Correct 103 ms 12092 KB Output is correct
38 Correct 167 ms 13780 KB Output is correct
39 Correct 35 ms 10316 KB Output is correct
40 Correct 161 ms 13844 KB Output is correct
41 Correct 119 ms 12740 KB Output is correct
42 Correct 164 ms 13764 KB Output is correct
43 Correct 72 ms 11084 KB Output is correct
44 Correct 226 ms 13860 KB Output is correct
45 Correct 33 ms 10436 KB Output is correct
46 Correct 160 ms 13872 KB Output is correct
47 Correct 48 ms 10820 KB Output is correct
48 Correct 162 ms 13892 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 24916 KB Output is correct
2 Correct 353 ms 25396 KB Output is correct
3 Correct 215 ms 23840 KB Output is correct
4 Correct 389 ms 25476 KB Output is correct
5 Correct 146 ms 17300 KB Output is correct
6 Correct 341 ms 25444 KB Output is correct
7 Correct 355 ms 24640 KB Output is correct
8 Correct 323 ms 25392 KB Output is correct
9 Correct 46 ms 11860 KB Output is correct
10 Correct 343 ms 25480 KB Output is correct
11 Correct 205 ms 18252 KB Output is correct
12 Correct 373 ms 25452 KB Output is correct
13 Correct 283 ms 24136 KB Output is correct
14 Correct 244 ms 24076 KB Output is correct
15 Correct 264 ms 24180 KB Output is correct
16 Correct 218 ms 24756 KB Output is correct
17 Correct 266 ms 24372 KB Output is correct
18 Correct 275 ms 24692 KB Output is correct
19 Correct 253 ms 24136 KB Output is correct
20 Correct 237 ms 24236 KB Output is correct
21 Correct 269 ms 23792 KB Output is correct
22 Correct 259 ms 23952 KB Output is correct
23 Correct 248 ms 24116 KB Output is correct
24 Correct 216 ms 24264 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 7 ms 9676 KB Output is correct
5 Correct 6 ms 9768 KB Output is correct
6 Correct 6 ms 9772 KB Output is correct
7 Correct 7 ms 9676 KB Output is correct
8 Correct 7 ms 9676 KB Output is correct
9 Correct 8 ms 9676 KB Output is correct
10 Correct 8 ms 9676 KB Output is correct
11 Correct 6 ms 9744 KB Output is correct
12 Correct 6 ms 9712 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9768 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 8 ms 9676 KB Output is correct
21 Correct 7 ms 9676 KB Output is correct
22 Correct 8 ms 9676 KB Output is correct
23 Correct 6 ms 9676 KB Output is correct
24 Correct 6 ms 9676 KB Output is correct
25 Correct 112 ms 13380 KB Output is correct
26 Correct 24 ms 10260 KB Output is correct
27 Correct 167 ms 14788 KB Output is correct
28 Correct 168 ms 14796 KB Output is correct
29 Correct 114 ms 13360 KB Output is correct
30 Correct 119 ms 13164 KB Output is correct
31 Correct 130 ms 14304 KB Output is correct
32 Correct 168 ms 14776 KB Output is correct
33 Correct 157 ms 14524 KB Output is correct
34 Correct 107 ms 12164 KB Output is correct
35 Correct 161 ms 14776 KB Output is correct
36 Correct 170 ms 14808 KB Output is correct
37 Correct 103 ms 12092 KB Output is correct
38 Correct 167 ms 13780 KB Output is correct
39 Correct 35 ms 10316 KB Output is correct
40 Correct 161 ms 13844 KB Output is correct
41 Correct 119 ms 12740 KB Output is correct
42 Correct 164 ms 13764 KB Output is correct
43 Correct 72 ms 11084 KB Output is correct
44 Correct 226 ms 13860 KB Output is correct
45 Correct 33 ms 10436 KB Output is correct
46 Correct 160 ms 13872 KB Output is correct
47 Correct 48 ms 10820 KB Output is correct
48 Correct 162 ms 13892 KB Output is correct
49 Correct 286 ms 24916 KB Output is correct
50 Correct 353 ms 25396 KB Output is correct
51 Correct 215 ms 23840 KB Output is correct
52 Correct 389 ms 25476 KB Output is correct
53 Correct 146 ms 17300 KB Output is correct
54 Correct 341 ms 25444 KB Output is correct
55 Correct 355 ms 24640 KB Output is correct
56 Correct 323 ms 25392 KB Output is correct
57 Correct 46 ms 11860 KB Output is correct
58 Correct 343 ms 25480 KB Output is correct
59 Correct 205 ms 18252 KB Output is correct
60 Correct 373 ms 25452 KB Output is correct
61 Correct 283 ms 24136 KB Output is correct
62 Correct 244 ms 24076 KB Output is correct
63 Correct 264 ms 24180 KB Output is correct
64 Correct 218 ms 24756 KB Output is correct
65 Correct 266 ms 24372 KB Output is correct
66 Correct 275 ms 24692 KB Output is correct
67 Correct 253 ms 24136 KB Output is correct
68 Correct 237 ms 24236 KB Output is correct
69 Correct 269 ms 23792 KB Output is correct
70 Correct 259 ms 23952 KB Output is correct
71 Correct 248 ms 24116 KB Output is correct
72 Correct 216 ms 24264 KB Output is correct
73 Correct 559 ms 29872 KB Output is correct
74 Correct 378 ms 26048 KB Output is correct
75 Correct 562 ms 29948 KB Output is correct
76 Correct 744 ms 31924 KB Output is correct
77 Correct 364 ms 21828 KB Output is correct
78 Correct 591 ms 29992 KB Output is correct
79 Correct 618 ms 31252 KB Output is correct
80 Correct 721 ms 31912 KB Output is correct
81 Correct 273 ms 16964 KB Output is correct
82 Correct 520 ms 28920 KB Output is correct
83 Correct 577 ms 24304 KB Output is correct
84 Correct 719 ms 31900 KB Output is correct
85 Correct 505 ms 27592 KB Output is correct
86 Correct 568 ms 29440 KB Output is correct
87 Correct 300 ms 25296 KB Output is correct
88 Correct 580 ms 30104 KB Output is correct
89 Correct 563 ms 28492 KB Output is correct
90 Correct 579 ms 30120 KB Output is correct
91 Correct 376 ms 26152 KB Output is correct
92 Correct 563 ms 29504 KB Output is correct
93 Correct 302 ms 24908 KB Output is correct
94 Correct 559 ms 29352 KB Output is correct
95 Correct 368 ms 25776 KB Output is correct
96 Correct 563 ms 29544 KB Output is correct