oj.uz

Submission #911023

# Submission time Handle Problem Language Result Execution time Memory
911023 2024-01-18T11:22:49 Z StefanSebez Two Antennas (JOI19_antennas) C++14
100 / 100
 517 ms 37688 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
const int N=2*1e5+50;
const int inf=1e9+1000;
int nc,root,lc[2*N],rc[2*N],maks[2*N],mn[2*N],ans[2*N],lazymn[2*N],lazymaks[2*N];
void update(int c,int R)
{
    if(maks[c]>0) ans[c]=max(ans[c],abs(maks[c]-R));
    if(mn[c]<inf) ans[c]=max(ans[c],abs(mn[c]-R));
    lazymn[c]=min(lazymn[c],R);
    lazymaks[c]=max(lazymaks[c],R);
}
void push(int c)
{
    if(lazymn[c]<inf) update(lc[c],lazymn[c]);
    if(lazymaks[c]>0) update(lc[c],lazymaks[c]);
    if(lazymn[c]<inf) update(rc[c],lazymn[c]);
    if(lazymaks[c]>0) update(rc[c],lazymaks[c]);
    lazymn[c]=inf;
    lazymaks[c]=0;
}
void Update(int &c,int ss,int se,int qind,int qval)
{
    if(!c)c=++nc;
    if(ss==se)
    {
        maks[c]=mn[c]=qval;
        if(qval==0) mn[c]=inf;
        return;
    }
    push(c);
    int mid=(ss+se)/2;
    if(qind<=mid) Update(lc[c],ss,mid,qind,qval);
    else Update(rc[c],mid+1,se,qind,qval);
    maks[c]=max(maks[lc[c]],maks[rc[c]]);
    mn[c]=min(mn[lc[c]],mn[rc[c]]);
    //ans[c]=max(ans[lc[c]],ans[rc[c]]);
}
void UpdateLazy(int &c,int ss,int se,int qs,int qe,int R)
{
    if(qs<=ss && se<=qe) {update(c,R);return;}
    else if(qe<ss || se<qs) return;
    push(c);
    int mid=(ss+se)/2;
    UpdateLazy(lc[c],ss,mid,qs,qe,R);
    UpdateLazy(rc[c],mid+1,se,qs,qe,R);
    ans[c]=max(ans[lc[c]],ans[rc[c]]);
}
int Get(int c,int ss,int se,int qs,int qe)
{
    if(qs>qe) return 0;
    if(qs<=ss && se<=qe) return ans[c];
    else if(qe<ss || se<qs) return 0;
    push(c);
    int mid=(ss+se)/2;
    return max(Get(lc[c],ss,mid,qs,qe),Get(rc[c],mid+1,se,qs,qe));
}
int main()
{
    for(int i=0;i<2*N;i++) mn[i]=lazymn[i]=inf;

    int n;scanf("%i",&n);
    int H[n+1],A[n+1],B[n+1];
    vector<int> dodaj[n+1],oduzmi[n+1];
    for(int i=1;i<=n;i++)
    {
        scanf("%i%i%i",&H[i],&A[i],&B[i]);
        if(i+A[i]<=n) dodaj[i+A[i]].pb(i);
        if(i+B[i]+1<=n) oduzmi[i+B[i]+1].pb(i);
    }
    /*for(int i=1;i<=n;i++)
    {
        printf("%i:\n",i);
        for(auto j:dodaj[i]) printf("%i ",j);
        printf("\n");
        for(auto j:oduzmi[i]) printf("%i ",j);
        printf("\n");
    }*/
    int q;scanf("%i",&q);
    vector<pair<pair<int,int>,int> >Qs;
    for(int i=1;i<=q;i++)
    {
        int l,r;scanf("%i%i",&l,&r);
        Qs.pb({{r,l},i});
    }
    sort(Qs.begin(),Qs.end());
    int res[q+1];
    for(int i=1,j=0;i<=n;i++)
    {
        int L=i-B[i],R=i-A[i];
        for(auto k:dodaj[i]) Update(root,1,n,k,H[k]);
        for(auto k:oduzmi[i]) Update(root,1,n,k,0);
        UpdateLazy(root,1,n,L,R,H[i]);
        while(j<q && Qs[j].fi.fi==i)
        {
            //printf("%i ",Qs[j].se);
            res[Qs[j].se]=Get(root,1,n,Qs[j].fi.se,Qs[j].fi.fi-1);
            if(res[Qs[j].se]==0) res[Qs[j].se]=-1;
            j++;
        }
    }
    for(int i=1;i<=q;i++) printf("%i\n",res[i]);
    return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:65:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     int n;scanf("%i",&n);
      |           ~~~~~^~~~~~~~~
antennas.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         scanf("%i%i%i",&H[i],&A[i],&B[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:82:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |     int q;scanf("%i",&q);
      |           ~~~~~^~~~~~~~~
antennas.cpp:86:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         int l,r;scanf("%i%i",&l,&r);
      |                 ~~~~~^~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6488 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6600 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6584 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6488 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6744 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6488 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6600 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6584 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6488 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6744 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 70 ms 11448 KB Output is correct
26 Correct 12 ms 7588 KB Output is correct
27 Correct 114 ms 13324 KB Output is correct
28 Correct 101 ms 13436 KB Output is correct
29 Correct 72 ms 11456 KB Output is correct
30 Correct 72 ms 11204 KB Output is correct
31 Correct 93 ms 12616 KB Output is correct
32 Correct 110 ms 13436 KB Output is correct
33 Correct 92 ms 13248 KB Output is correct
34 Correct 52 ms 9920 KB Output is correct
35 Correct 99 ms 13504 KB Output is correct
36 Correct 100 ms 13760 KB Output is correct
37 Correct 62 ms 9996 KB Output is correct
38 Correct 104 ms 12588 KB Output is correct
39 Correct 16 ms 7516 KB Output is correct
40 Correct 98 ms 12604 KB Output is correct
41 Correct 82 ms 11116 KB Output is correct
42 Correct 98 ms 12476 KB Output is correct
43 Correct 34 ms 8656 KB Output is correct
44 Correct 105 ms 12632 KB Output is correct
45 Correct 19 ms 7892 KB Output is correct
46 Correct 94 ms 12968 KB Output is correct
47 Correct 25 ms 8176 KB Output is correct
48 Correct 95 ms 12440 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 27220 KB Output is correct
2 Correct 263 ms 29264 KB Output is correct
3 Correct 243 ms 22572 KB Output is correct
4 Correct 282 ms 29428 KB Output is correct
5 Correct 109 ms 16976 KB Output is correct
6 Correct 298 ms 29412 KB Output is correct
7 Correct 238 ms 26448 KB Output is correct
8 Correct 318 ms 29456 KB Output is correct
9 Correct 32 ms 10192 KB Output is correct
10 Correct 272 ms 29448 KB Output is correct
11 Correct 161 ms 20820 KB Output is correct
12 Correct 293 ms 29400 KB Output is correct
13 Correct 127 ms 26408 KB Output is correct
14 Correct 132 ms 26612 KB Output is correct
15 Correct 127 ms 26452 KB Output is correct
16 Correct 109 ms 27068 KB Output is correct
17 Correct 129 ms 26668 KB Output is correct
18 Correct 118 ms 27216 KB Output is correct
19 Correct 121 ms 26188 KB Output is correct
20 Correct 115 ms 26392 KB Output is correct
21 Correct 118 ms 26152 KB Output is correct
22 Correct 124 ms 26376 KB Output is correct
23 Correct 122 ms 26064 KB Output is correct
24 Correct 107 ms 26448 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6488 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6600 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6584 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6488 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6744 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 70 ms 11448 KB Output is correct
26 Correct 12 ms 7588 KB Output is correct
27 Correct 114 ms 13324 KB Output is correct
28 Correct 101 ms 13436 KB Output is correct
29 Correct 72 ms 11456 KB Output is correct
30 Correct 72 ms 11204 KB Output is correct
31 Correct 93 ms 12616 KB Output is correct
32 Correct 110 ms 13436 KB Output is correct
33 Correct 92 ms 13248 KB Output is correct
34 Correct 52 ms 9920 KB Output is correct
35 Correct 99 ms 13504 KB Output is correct
36 Correct 100 ms 13760 KB Output is correct
37 Correct 62 ms 9996 KB Output is correct
38 Correct 104 ms 12588 KB Output is correct
39 Correct 16 ms 7516 KB Output is correct
40 Correct 98 ms 12604 KB Output is correct
41 Correct 82 ms 11116 KB Output is correct
42 Correct 98 ms 12476 KB Output is correct
43 Correct 34 ms 8656 KB Output is correct
44 Correct 105 ms 12632 KB Output is correct
45 Correct 19 ms 7892 KB Output is correct
46 Correct 94 ms 12968 KB Output is correct
47 Correct 25 ms 8176 KB Output is correct
48 Correct 95 ms 12440 KB Output is correct
49 Correct 254 ms 27220 KB Output is correct
50 Correct 263 ms 29264 KB Output is correct
51 Correct 243 ms 22572 KB Output is correct
52 Correct 282 ms 29428 KB Output is correct
53 Correct 109 ms 16976 KB Output is correct
54 Correct 298 ms 29412 KB Output is correct
55 Correct 238 ms 26448 KB Output is correct
56 Correct 318 ms 29456 KB Output is correct
57 Correct 32 ms 10192 KB Output is correct
58 Correct 272 ms 29448 KB Output is correct
59 Correct 161 ms 20820 KB Output is correct
60 Correct 293 ms 29400 KB Output is correct
61 Correct 127 ms 26408 KB Output is correct
62 Correct 132 ms 26612 KB Output is correct
63 Correct 127 ms 26452 KB Output is correct
64 Correct 109 ms 27068 KB Output is correct
65 Correct 129 ms 26668 KB Output is correct
66 Correct 118 ms 27216 KB Output is correct
67 Correct 121 ms 26188 KB Output is correct
68 Correct 115 ms 26392 KB Output is correct
69 Correct 118 ms 26152 KB Output is correct
70 Correct 124 ms 26376 KB Output is correct
71 Correct 122 ms 26064 KB Output is correct
72 Correct 107 ms 26448 KB Output is correct
73 Correct 411 ms 32808 KB Output is correct
74 Correct 304 ms 29972 KB Output is correct
75 Correct 381 ms 30300 KB Output is correct
76 Correct 484 ms 37660 KB Output is correct
77 Correct 243 ms 22544 KB Output is correct
78 Correct 424 ms 34712 KB Output is correct
79 Correct 415 ms 34160 KB Output is correct
80 Correct 517 ms 37688 KB Output is correct
81 Correct 173 ms 17564 KB Output is correct
82 Correct 372 ms 33180 KB Output is correct
83 Correct 346 ms 28864 KB Output is correct
84 Correct 498 ms 37172 KB Output is correct
85 Correct 215 ms 30200 KB Output is correct
86 Correct 270 ms 33376 KB Output is correct
87 Correct 145 ms 27468 KB Output is correct
88 Correct 256 ms 34232 KB Output is correct
89 Correct 234 ms 32168 KB Output is correct
90 Correct 261 ms 33768 KB Output is correct
91 Correct 166 ms 28344 KB Output is correct
92 Correct 261 ms 32828 KB Output is correct
93 Correct 142 ms 27288 KB Output is correct
94 Correct 261 ms 33020 KB Output is correct
95 Correct 160 ms 28016 KB Output is correct
96 Correct 256 ms 33064 KB Output is correct