oj.uz

Submission #444513

# Submission time Handle Problem Language Result Execution time Memory
444513 2021-07-14T08:02:37 Z Dymo Two Antennas (JOI19_antennas) C++17
100 / 100
 644 ms 37424 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]);
}
ll get(ll id,ll left,ll right,ll x,ll y)
{
    if (x>right||y<left)
        return -1;
    if (x<=left&&y>=right)
        return st[id].mx_all;
    dosth(id,left,right);
    ll mid=(left+right)/2;
    return max(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));
    }
    for (int id=1; id<=4*n; id++)
    {
        st[id].mnc=base;
        st[id].mxc=-base;
        st[id].mx_all=-1;
        st[id].la_mn=base;
        st[id].la_mx=-base;
    }
//   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])
        {
            ans[h.ss]=get(1,1,n,h.ff,i);
        }
    }
    for (int i=1; i<=q; i++)
    {
        cout <<ans[i]<<endl;
    }



}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:134:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  134 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
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.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 7 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9780 KB Output is correct
6 Correct 6 ms 9764 KB Output is correct
7 Correct 6 ms 9760 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 6 ms 9728 KB Output is correct
10 Correct 6 ms 9804 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9692 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 7 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 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 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 6 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9780 KB Output is correct
6 Correct 6 ms 9764 KB Output is correct
7 Correct 6 ms 9760 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 6 ms 9728 KB Output is correct
10 Correct 6 ms 9804 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9692 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 7 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 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 6 ms 9676 KB Output is correct
24 Correct 6 ms 9676 KB Output is correct
25 Correct 94 ms 13384 KB Output is correct
26 Correct 20 ms 10324 KB Output is correct
27 Correct 137 ms 14872 KB Output is correct
28 Correct 141 ms 14916 KB Output is correct
29 Correct 96 ms 13512 KB Output is correct
30 Correct 95 ms 13204 KB Output is correct
31 Correct 107 ms 14172 KB Output is correct
32 Correct 139 ms 14916 KB Output is correct
33 Correct 128 ms 14580 KB Output is correct
34 Correct 73 ms 12228 KB Output is correct
35 Correct 136 ms 14916 KB Output is correct
36 Correct 139 ms 14820 KB Output is correct
37 Correct 84 ms 12188 KB Output is correct
38 Correct 140 ms 13864 KB Output is correct
39 Correct 25 ms 10388 KB Output is correct
40 Correct 137 ms 13892 KB Output is correct
41 Correct 101 ms 12784 KB Output is correct
42 Correct 137 ms 13948 KB Output is correct
43 Correct 50 ms 11252 KB Output is correct
44 Correct 137 ms 13888 KB Output is correct
45 Correct 31 ms 10548 KB Output is correct
46 Correct 143 ms 13888 KB Output is correct
47 Correct 41 ms 10884 KB Output is correct
48 Correct 139 ms 13892 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 28748 KB Output is correct
2 Correct 305 ms 30832 KB Output is correct
3 Correct 199 ms 24692 KB Output is correct
4 Correct 311 ms 30812 KB Output is correct
5 Correct 123 ms 19488 KB Output is correct
6 Correct 358 ms 30804 KB Output is correct
7 Correct 265 ms 28068 KB Output is correct
8 Correct 307 ms 30788 KB Output is correct
9 Correct 42 ms 13064 KB Output is correct
10 Correct 341 ms 30876 KB Output is correct
11 Correct 209 ms 22872 KB Output is correct
12 Correct 320 ms 31028 KB Output is correct
13 Correct 258 ms 29540 KB Output is correct
14 Correct 241 ms 29448 KB Output is correct
15 Correct 237 ms 29608 KB Output is correct
16 Correct 213 ms 30096 KB Output is correct
17 Correct 265 ms 29760 KB Output is correct
18 Correct 246 ms 30020 KB Output is correct
19 Correct 255 ms 29492 KB Output is correct
20 Correct 237 ms 29620 KB Output is correct
21 Correct 230 ms 29280 KB Output is correct
22 Correct 238 ms 29400 KB Output is correct
23 Correct 251 ms 29432 KB Output is correct
24 Correct 219 ms 29644 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 7 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9780 KB Output is correct
6 Correct 6 ms 9764 KB Output is correct
7 Correct 6 ms 9760 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 6 ms 9728 KB Output is correct
10 Correct 6 ms 9804 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9692 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 7 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 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 6 ms 9676 KB Output is correct
24 Correct 6 ms 9676 KB Output is correct
25 Correct 94 ms 13384 KB Output is correct
26 Correct 20 ms 10324 KB Output is correct
27 Correct 137 ms 14872 KB Output is correct
28 Correct 141 ms 14916 KB Output is correct
29 Correct 96 ms 13512 KB Output is correct
30 Correct 95 ms 13204 KB Output is correct
31 Correct 107 ms 14172 KB Output is correct
32 Correct 139 ms 14916 KB Output is correct
33 Correct 128 ms 14580 KB Output is correct
34 Correct 73 ms 12228 KB Output is correct
35 Correct 136 ms 14916 KB Output is correct
36 Correct 139 ms 14820 KB Output is correct
37 Correct 84 ms 12188 KB Output is correct
38 Correct 140 ms 13864 KB Output is correct
39 Correct 25 ms 10388 KB Output is correct
40 Correct 137 ms 13892 KB Output is correct
41 Correct 101 ms 12784 KB Output is correct
42 Correct 137 ms 13948 KB Output is correct
43 Correct 50 ms 11252 KB Output is correct
44 Correct 137 ms 13888 KB Output is correct
45 Correct 31 ms 10548 KB Output is correct
46 Correct 143 ms 13888 KB Output is correct
47 Correct 41 ms 10884 KB Output is correct
48 Correct 139 ms 13892 KB Output is correct
49 Correct 276 ms 28748 KB Output is correct
50 Correct 305 ms 30832 KB Output is correct
51 Correct 199 ms 24692 KB Output is correct
52 Correct 311 ms 30812 KB Output is correct
53 Correct 123 ms 19488 KB Output is correct
54 Correct 358 ms 30804 KB Output is correct
55 Correct 265 ms 28068 KB Output is correct
56 Correct 307 ms 30788 KB Output is correct
57 Correct 42 ms 13064 KB Output is correct
58 Correct 341 ms 30876 KB Output is correct
59 Correct 209 ms 22872 KB Output is correct
60 Correct 320 ms 31028 KB Output is correct
61 Correct 258 ms 29540 KB Output is correct
62 Correct 241 ms 29448 KB Output is correct
63 Correct 237 ms 29608 KB Output is correct
64 Correct 213 ms 30096 KB Output is correct
65 Correct 265 ms 29760 KB Output is correct
66 Correct 246 ms 30020 KB Output is correct
67 Correct 255 ms 29492 KB Output is correct
68 Correct 237 ms 29620 KB Output is correct
69 Correct 230 ms 29280 KB Output is correct
70 Correct 238 ms 29400 KB Output is correct
71 Correct 251 ms 29432 KB Output is correct
72 Correct 219 ms 29644 KB Output is correct
73 Correct 509 ms 33708 KB Output is correct
74 Correct 356 ms 31524 KB Output is correct
75 Correct 519 ms 30804 KB Output is correct
76 Correct 614 ms 37424 KB Output is correct
77 Correct 336 ms 23924 KB Output is correct
78 Correct 504 ms 35324 KB Output is correct
79 Correct 557 ms 34360 KB Output is correct
80 Correct 644 ms 37300 KB Output is correct
81 Correct 225 ms 18064 KB Output is correct
82 Correct 447 ms 34272 KB Output is correct
83 Correct 412 ms 29016 KB Output is correct
84 Correct 587 ms 37312 KB Output is correct
85 Correct 434 ms 32832 KB Output is correct
86 Correct 513 ms 34972 KB Output is correct
87 Correct 280 ms 30596 KB Output is correct
88 Correct 478 ms 35512 KB Output is correct
89 Correct 491 ms 33816 KB Output is correct
90 Correct 518 ms 35432 KB Output is correct
91 Correct 357 ms 31628 KB Output is correct
92 Correct 531 ms 34844 KB Output is correct
93 Correct 276 ms 30268 KB Output is correct
94 Correct 535 ms 34916 KB Output is correct
95 Correct 330 ms 31120 KB Output is correct
96 Correct 491 ms 34956 KB Output is correct