oj.uz

답안 #444499

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444499 2021-07-14T07:49:12 Z Dymo Two Antennas (JOI19_antennas) C++17
100 / 100
 807 ms 59536 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll  long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
mt19937_64 rnd;

const ll maxn=3e5+10;
const ll mod =1e9+7 ;
const ll base=3e18;
/// 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(1ll,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

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 9 ms 14412 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14416 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 8 ms 14412 KB Output is correct
12 Correct 9 ms 14492 KB Output is correct
13 Correct 10 ms 14416 KB Output is correct
14 Correct 9 ms 14412 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 9 ms 14460 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 9 ms 14424 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 10 ms 14428 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 9 ms 14380 KB Output is correct
23 Correct 10 ms 14444 KB Output is correct
24 Correct 11 ms 14420 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 9 ms 14412 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14416 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 8 ms 14412 KB Output is correct
12 Correct 9 ms 14492 KB Output is correct
13 Correct 10 ms 14416 KB Output is correct
14 Correct 9 ms 14412 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 9 ms 14460 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 9 ms 14424 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 10 ms 14428 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 9 ms 14380 KB Output is correct
23 Correct 10 ms 14444 KB Output is correct
24 Correct 11 ms 14420 KB Output is correct
25 Correct 112 ms 21476 KB Output is correct
26 Correct 23 ms 15436 KB Output is correct
27 Correct 169 ms 24544 KB Output is correct
28 Correct 179 ms 24600 KB Output is correct
29 Correct 112 ms 21524 KB Output is correct
30 Correct 120 ms 21220 KB Output is correct
31 Correct 129 ms 23308 KB Output is correct
32 Correct 171 ms 24584 KB Output is correct
33 Correct 151 ms 23964 KB Output is correct
34 Correct 92 ms 19412 KB Output is correct
35 Correct 187 ms 24404 KB Output is correct
36 Correct 182 ms 24612 KB Output is correct
37 Correct 101 ms 19908 KB Output is correct
38 Correct 168 ms 23644 KB Output is correct
39 Correct 42 ms 15816 KB Output is correct
40 Correct 188 ms 23636 KB Output is correct
41 Correct 162 ms 21244 KB Output is correct
42 Correct 175 ms 23752 KB Output is correct
43 Correct 62 ms 17604 KB Output is correct
44 Correct 168 ms 23704 KB Output is correct
45 Correct 47 ms 16192 KB Output is correct
46 Correct 189 ms 23716 KB Output is correct
47 Correct 52 ms 16932 KB Output is correct
48 Correct 176 ms 23720 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 46812 KB Output is correct
2 Correct 376 ms 48224 KB Output is correct
3 Correct 266 ms 44180 KB Output is correct
4 Correct 403 ms 48136 KB Output is correct
5 Correct 150 ms 30680 KB Output is correct
6 Correct 436 ms 48112 KB Output is correct
7 Correct 353 ms 46380 KB Output is correct
8 Correct 423 ms 48104 KB Output is correct
9 Correct 46 ms 19012 KB Output is correct
10 Correct 427 ms 48200 KB Output is correct
11 Correct 215 ms 32820 KB Output is correct
12 Correct 384 ms 48204 KB Output is correct
13 Correct 287 ms 47464 KB Output is correct
14 Correct 254 ms 47432 KB Output is correct
15 Correct 247 ms 47508 KB Output is correct
16 Correct 220 ms 48444 KB Output is correct
17 Correct 273 ms 48288 KB Output is correct
18 Correct 242 ms 48228 KB Output is correct
19 Correct 259 ms 47548 KB Output is correct
20 Correct 248 ms 47696 KB Output is correct
21 Correct 237 ms 46908 KB Output is correct
22 Correct 247 ms 47184 KB Output is correct
23 Correct 259 ms 47432 KB Output is correct
24 Correct 223 ms 48000 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 9 ms 14412 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14416 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 8 ms 14412 KB Output is correct
12 Correct 9 ms 14492 KB Output is correct
13 Correct 10 ms 14416 KB Output is correct
14 Correct 9 ms 14412 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 9 ms 14460 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 9 ms 14424 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 10 ms 14428 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 9 ms 14380 KB Output is correct
23 Correct 10 ms 14444 KB Output is correct
24 Correct 11 ms 14420 KB Output is correct
25 Correct 112 ms 21476 KB Output is correct
26 Correct 23 ms 15436 KB Output is correct
27 Correct 169 ms 24544 KB Output is correct
28 Correct 179 ms 24600 KB Output is correct
29 Correct 112 ms 21524 KB Output is correct
30 Correct 120 ms 21220 KB Output is correct
31 Correct 129 ms 23308 KB Output is correct
32 Correct 171 ms 24584 KB Output is correct
33 Correct 151 ms 23964 KB Output is correct
34 Correct 92 ms 19412 KB Output is correct
35 Correct 187 ms 24404 KB Output is correct
36 Correct 182 ms 24612 KB Output is correct
37 Correct 101 ms 19908 KB Output is correct
38 Correct 168 ms 23644 KB Output is correct
39 Correct 42 ms 15816 KB Output is correct
40 Correct 188 ms 23636 KB Output is correct
41 Correct 162 ms 21244 KB Output is correct
42 Correct 175 ms 23752 KB Output is correct
43 Correct 62 ms 17604 KB Output is correct
44 Correct 168 ms 23704 KB Output is correct
45 Correct 47 ms 16192 KB Output is correct
46 Correct 189 ms 23716 KB Output is correct
47 Correct 52 ms 16932 KB Output is correct
48 Correct 176 ms 23720 KB Output is correct
49 Correct 356 ms 46812 KB Output is correct
50 Correct 376 ms 48224 KB Output is correct
51 Correct 266 ms 44180 KB Output is correct
52 Correct 403 ms 48136 KB Output is correct
53 Correct 150 ms 30680 KB Output is correct
54 Correct 436 ms 48112 KB Output is correct
55 Correct 353 ms 46380 KB Output is correct
56 Correct 423 ms 48104 KB Output is correct
57 Correct 46 ms 19012 KB Output is correct
58 Correct 427 ms 48200 KB Output is correct
59 Correct 215 ms 32820 KB Output is correct
60 Correct 384 ms 48204 KB Output is correct
61 Correct 287 ms 47464 KB Output is correct
62 Correct 254 ms 47432 KB Output is correct
63 Correct 247 ms 47508 KB Output is correct
64 Correct 220 ms 48444 KB Output is correct
65 Correct 273 ms 48288 KB Output is correct
66 Correct 242 ms 48228 KB Output is correct
67 Correct 259 ms 47548 KB Output is correct
68 Correct 248 ms 47696 KB Output is correct
69 Correct 237 ms 46908 KB Output is correct
70 Correct 247 ms 47184 KB Output is correct
71 Correct 259 ms 47432 KB Output is correct
72 Correct 223 ms 48000 KB Output is correct
73 Correct 650 ms 55356 KB Output is correct
74 Correct 440 ms 49048 KB Output is correct
75 Correct 595 ms 55236 KB Output is correct
76 Correct 807 ms 59536 KB Output is correct
77 Correct 438 ms 38616 KB Output is correct
78 Correct 660 ms 55764 KB Output is correct
79 Correct 691 ms 57580 KB Output is correct
80 Correct 782 ms 59448 KB Output is correct
81 Correct 347 ms 29200 KB Output is correct
82 Correct 555 ms 53720 KB Output is correct
83 Correct 544 ms 43928 KB Output is correct
84 Correct 705 ms 59480 KB Output is correct
85 Correct 487 ms 53396 KB Output is correct
86 Correct 639 ms 57428 KB Output is correct
87 Correct 306 ms 49084 KB Output is correct
88 Correct 600 ms 58408 KB Output is correct
89 Correct 551 ms 55860 KB Output is correct
90 Correct 610 ms 58336 KB Output is correct
91 Correct 379 ms 51184 KB Output is correct
92 Correct 599 ms 57840 KB Output is correct
93 Correct 366 ms 48604 KB Output is correct
94 Correct 601 ms 57292 KB Output is correct
95 Correct 360 ms 50108 KB Output is correct
96 Correct 647 ms 57876 KB Output is correct