oj.uz

Submission #444506

# Submission time Handle Problem Language Result Execution time Memory
444506 2021-07-14T07:54:24 Z Dymo Two Antennas (JOI19_antennas) C++17
100 / 100
 722 ms 32068 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
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: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.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:137:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  137 |         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 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9764 KB Output is correct
13 Correct 7 ms 9744 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 8 ms 9768 KB Output is correct
16 Correct 8 ms 9768 KB Output is correct
17 Correct 7 ms 9676 KB Output is correct
18 Correct 8 ms 9648 KB Output is correct
19 Correct 7 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 8 ms 9888 KB Output is correct
24 Correct 7 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 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9764 KB Output is correct
13 Correct 7 ms 9744 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 8 ms 9768 KB Output is correct
16 Correct 8 ms 9768 KB Output is correct
17 Correct 7 ms 9676 KB Output is correct
18 Correct 8 ms 9648 KB Output is correct
19 Correct 7 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 8 ms 9888 KB Output is correct
24 Correct 7 ms 9676 KB Output is correct
25 Correct 126 ms 13336 KB Output is correct
26 Correct 23 ms 10252 KB Output is correct
27 Correct 173 ms 14904 KB Output is correct
28 Correct 171 ms 14784 KB Output is correct
29 Correct 140 ms 13356 KB Output is correct
30 Correct 122 ms 13124 KB Output is correct
31 Correct 124 ms 14200 KB Output is correct
32 Correct 165 ms 14812 KB Output is correct
33 Correct 173 ms 14520 KB Output is correct
34 Correct 86 ms 12148 KB Output is correct
35 Correct 165 ms 14788 KB Output is correct
36 Correct 165 ms 14852 KB Output is correct
37 Correct 100 ms 12128 KB Output is correct
38 Correct 168 ms 13876 KB Output is correct
39 Correct 29 ms 10320 KB Output is correct
40 Correct 165 ms 13832 KB Output is correct
41 Correct 126 ms 12696 KB Output is correct
42 Correct 163 ms 13764 KB Output is correct
43 Correct 58 ms 11156 KB Output is correct
44 Correct 169 ms 14028 KB Output is correct
45 Correct 34 ms 10496 KB Output is correct
46 Correct 180 ms 13892 KB Output is correct
47 Correct 49 ms 10824 KB Output is correct
48 Correct 166 ms 13892 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 24928 KB Output is correct
2 Correct 315 ms 25412 KB Output is correct
3 Correct 266 ms 23808 KB Output is correct
4 Correct 318 ms 25456 KB Output is correct
5 Correct 130 ms 17388 KB Output is correct
6 Correct 320 ms 25476 KB Output is correct
7 Correct 292 ms 24760 KB Output is correct
8 Correct 322 ms 25444 KB Output is correct
9 Correct 44 ms 11868 KB Output is correct
10 Correct 350 ms 25412 KB Output is correct
11 Correct 177 ms 18284 KB Output is correct
12 Correct 349 ms 25412 KB Output is correct
13 Correct 262 ms 24064 KB Output is correct
14 Correct 241 ms 24056 KB Output is correct
15 Correct 236 ms 24236 KB Output is correct
16 Correct 230 ms 24692 KB Output is correct
17 Correct 270 ms 24368 KB Output is correct
18 Correct 239 ms 24688 KB Output is correct
19 Correct 303 ms 24136 KB Output is correct
20 Correct 241 ms 24200 KB Output is correct
21 Correct 227 ms 23980 KB Output is correct
22 Correct 241 ms 23976 KB Output is correct
23 Correct 253 ms 24092 KB Output is correct
24 Correct 214 ms 24252 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 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9764 KB Output is correct
13 Correct 7 ms 9744 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 8 ms 9768 KB Output is correct
16 Correct 8 ms 9768 KB Output is correct
17 Correct 7 ms 9676 KB Output is correct
18 Correct 8 ms 9648 KB Output is correct
19 Correct 7 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 8 ms 9888 KB Output is correct
24 Correct 7 ms 9676 KB Output is correct
25 Correct 126 ms 13336 KB Output is correct
26 Correct 23 ms 10252 KB Output is correct
27 Correct 173 ms 14904 KB Output is correct
28 Correct 171 ms 14784 KB Output is correct
29 Correct 140 ms 13356 KB Output is correct
30 Correct 122 ms 13124 KB Output is correct
31 Correct 124 ms 14200 KB Output is correct
32 Correct 165 ms 14812 KB Output is correct
33 Correct 173 ms 14520 KB Output is correct
34 Correct 86 ms 12148 KB Output is correct
35 Correct 165 ms 14788 KB Output is correct
36 Correct 165 ms 14852 KB Output is correct
37 Correct 100 ms 12128 KB Output is correct
38 Correct 168 ms 13876 KB Output is correct
39 Correct 29 ms 10320 KB Output is correct
40 Correct 165 ms 13832 KB Output is correct
41 Correct 126 ms 12696 KB Output is correct
42 Correct 163 ms 13764 KB Output is correct
43 Correct 58 ms 11156 KB Output is correct
44 Correct 169 ms 14028 KB Output is correct
45 Correct 34 ms 10496 KB Output is correct
46 Correct 180 ms 13892 KB Output is correct
47 Correct 49 ms 10824 KB Output is correct
48 Correct 166 ms 13892 KB Output is correct
49 Correct 300 ms 24928 KB Output is correct
50 Correct 315 ms 25412 KB Output is correct
51 Correct 266 ms 23808 KB Output is correct
52 Correct 318 ms 25456 KB Output is correct
53 Correct 130 ms 17388 KB Output is correct
54 Correct 320 ms 25476 KB Output is correct
55 Correct 292 ms 24760 KB Output is correct
56 Correct 322 ms 25444 KB Output is correct
57 Correct 44 ms 11868 KB Output is correct
58 Correct 350 ms 25412 KB Output is correct
59 Correct 177 ms 18284 KB Output is correct
60 Correct 349 ms 25412 KB Output is correct
61 Correct 262 ms 24064 KB Output is correct
62 Correct 241 ms 24056 KB Output is correct
63 Correct 236 ms 24236 KB Output is correct
64 Correct 230 ms 24692 KB Output is correct
65 Correct 270 ms 24368 KB Output is correct
66 Correct 239 ms 24688 KB Output is correct
67 Correct 303 ms 24136 KB Output is correct
68 Correct 241 ms 24200 KB Output is correct
69 Correct 227 ms 23980 KB Output is correct
70 Correct 241 ms 23976 KB Output is correct
71 Correct 253 ms 24092 KB Output is correct
72 Correct 214 ms 24252 KB Output is correct
73 Correct 568 ms 30008 KB Output is correct
74 Correct 353 ms 26228 KB Output is correct
75 Correct 530 ms 30020 KB Output is correct
76 Correct 722 ms 32068 KB Output is correct
77 Correct 337 ms 21856 KB Output is correct
78 Correct 592 ms 30144 KB Output is correct
79 Correct 671 ms 31004 KB Output is correct
80 Correct 651 ms 31932 KB Output is correct
81 Correct 263 ms 16860 KB Output is correct
82 Correct 464 ms 28952 KB Output is correct
83 Correct 465 ms 24316 KB Output is correct
84 Correct 645 ms 31908 KB Output is correct
85 Correct 477 ms 27532 KB Output is correct
86 Correct 589 ms 29380 KB Output is correct
87 Correct 285 ms 25096 KB Output is correct
88 Correct 532 ms 30200 KB Output is correct
89 Correct 583 ms 28432 KB Output is correct
90 Correct 567 ms 30052 KB Output is correct
91 Correct 361 ms 26248 KB Output is correct
92 Correct 576 ms 29508 KB Output is correct
93 Correct 288 ms 24892 KB Output is correct
94 Correct 566 ms 29384 KB Output is correct
95 Correct 365 ms 25788 KB Output is correct
96 Correct 606 ms 29496 KB Output is correct