oj.uz

Submission #389661

# Submission time Handle Problem Language Result Execution time Memory
389661 2021-04-14T11:03:37 Z denkendoemeer Two Antennas (JOI19_antennas) C++14
13 / 100
 162 ms 33220 KB 
#include<bits/stdc++.h>
#define ll long long
const int inf=1e9;
using namespace std;
int h[200005],a[200005],b[200005],ans[200005],ql[200005],qr[200005],lazy[550000],n;
vector<int>t[200005],t1[200005],t2[200005];
array<int,2>aint[550000];
void upd(int nod,int x)
{
    aint[nod][1]=max(aint[nod][0]+x,aint[nod][1]);
    lazy[nod]=max(lazy[nod],x);
}
void push(int nod)
{
    upd(2*nod,lazy[nod]);
    upd(2*nod+1,lazy[nod]);
    lazy[nod]=-inf;
}
void update1(int nod,int st,int dr,int poz,int val)
{
    if (st==dr){
        aint[nod][0]=val;
        return ;
    }
    push(nod);
    int mij=(st+dr)/2;
    if (poz<=mij)
        update1(nod*2,st,mij,poz,val);
    else
        update1(nod*2+1,mij+1,dr,poz,val);
    aint[nod][0]=max(aint[nod*2][0],aint[nod*2+1][0]);
    aint[nod][1]=max(aint[nod*2][1],aint[nod*2+1][1]);
}
void update2(int nod,int st,int dr,int l,int r,int val)
{
    if (l<=st && dr<=r){
        upd(nod,val);
        return ;
    }
    int mij=(st+dr)/2;
    push(nod);
    if (l<=mij)
        update2(nod*2,st,mij,l,r,val);
    if (mij+1<=r)
        update2(nod*2+1,mij+1,dr,l,r,val);
    aint[nod][0]=max(aint[nod*2][0],aint[nod*2+1][0]);
    aint[nod][1]=max(aint[nod*2][1],aint[nod*2+1][1]);
}
int query(int nod,int st,int dr,int poz)
{
    if (poz<=st)
        return aint[nod][1];
    int mij=(st+dr)/2;
    push(nod);
    if (poz<=mij)
        return max(query(nod*2,st,mij,poz),query(nod*2+1,mij+1,dr,poz));
    else
        return query(nod*2+1,mij+1,dr,poz);
}
void calc()
{
    int i;
    for(i=0;i<550000;i++)
        aint[i][0]=aint[i][1]=lazy[i]=-inf-2;
    for(i=0;i<n;i++){
        for(auto it:t1[i])
            update1(1,0,n-1,it,-h[it]);
        if (i-a[i]>=0)
            update2(1,0,n-1,max(i-b[i],0),i-a[i],h[i]);
        for(auto it:t[i])
            ans[it]=max(query(1,0,n-1,ql[it]),ans[it]);
        for(auto it:t2[i])
            update1(1,0,n-1,it,-inf);
    }
}
int main()
{
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    int i;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d%d%d",&h[i],&a[i],&b[i]);
        t1[i+a[i]].push_back(i);
        t2[i+b[i]].push_back(i);
    }
    int q;
    scanf("%d",&q);
    memset(ans,-1,sizeof(ans));
    for(i=0;i<q;i++){
        scanf("%d%d",&ql[i],&qr[i]);
        ql[i]--;
        qr[i]--;
        t[qr[i]].push_back(i);
    }
    calc();
    for(i=0;i<n;i++)
        h[i]=-h[i];
    calc();
    for(i=0;i<q;i++)
        printf("%d\n",ans[i]);
return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:81:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   81 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
antennas.cpp:83:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   83 |         scanf("%d%d%d",&h[i],&a[i],&b[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:88:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   88 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
antennas.cpp:91:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   91 |         scanf("%d%d",&ql[i],&qr[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21580 KB Output is correct
2 Correct 15 ms 21580 KB Output is correct
3 Correct 15 ms 21580 KB Output is correct
4 Correct 15 ms 21584 KB Output is correct
5 Correct 15 ms 21580 KB Output is correct
6 Correct 15 ms 21580 KB Output is correct
7 Correct 15 ms 21576 KB Output is correct
8 Correct 16 ms 21692 KB Output is correct
9 Correct 15 ms 21580 KB Output is correct
10 Correct 15 ms 21584 KB Output is correct
11 Correct 16 ms 21572 KB Output is correct
12 Correct 15 ms 21644 KB Output is correct
13 Correct 15 ms 21644 KB Output is correct
14 Correct 15 ms 21656 KB Output is correct
15 Correct 15 ms 21580 KB Output is correct
16 Correct 15 ms 21580 KB Output is correct
17 Correct 15 ms 21580 KB Output is correct
18 Correct 15 ms 21580 KB Output is correct
19 Correct 15 ms 21584 KB Output is correct
20 Correct 15 ms 21572 KB Output is correct
21 Correct 15 ms 21580 KB Output is correct
22 Correct 15 ms 21580 KB Output is correct
23 Correct 15 ms 21672 KB Output is correct
24 Correct 15 ms 21576 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21580 KB Output is correct
2 Correct 15 ms 21580 KB Output is correct
3 Correct 15 ms 21580 KB Output is correct
4 Correct 15 ms 21584 KB Output is correct
5 Correct 15 ms 21580 KB Output is correct
6 Correct 15 ms 21580 KB Output is correct
7 Correct 15 ms 21576 KB Output is correct
8 Correct 16 ms 21692 KB Output is correct
9 Correct 15 ms 21580 KB Output is correct
10 Correct 15 ms 21584 KB Output is correct
11 Correct 16 ms 21572 KB Output is correct
12 Correct 15 ms 21644 KB Output is correct
13 Correct 15 ms 21644 KB Output is correct
14 Correct 15 ms 21656 KB Output is correct
15 Correct 15 ms 21580 KB Output is correct
16 Correct 15 ms 21580 KB Output is correct
17 Correct 15 ms 21580 KB Output is correct
18 Correct 15 ms 21580 KB Output is correct
19 Correct 15 ms 21584 KB Output is correct
20 Correct 15 ms 21572 KB Output is correct
21 Correct 15 ms 21580 KB Output is correct
22 Correct 15 ms 21580 KB Output is correct
23 Correct 15 ms 21672 KB Output is correct
24 Correct 15 ms 21576 KB Output is correct
25 Correct 115 ms 26084 KB Output is correct
26 Correct 26 ms 22220 KB Output is correct
27 Correct 148 ms 28032 KB Output is correct
28 Correct 162 ms 28184 KB Output is correct
29 Correct 104 ms 26180 KB Output is correct
30 Correct 103 ms 25904 KB Output is correct
31 Correct 121 ms 27408 KB Output is correct
32 Correct 147 ms 28096 KB Output is correct
33 Correct 139 ms 27588 KB Output is correct
34 Correct 82 ms 24836 KB Output is correct
35 Correct 143 ms 27972 KB Output is correct
36 Correct 144 ms 28104 KB Output is correct
37 Correct 89 ms 24796 KB Output is correct
38 Correct 143 ms 27076 KB Output is correct
39 Correct 34 ms 22416 KB Output is correct
40 Correct 143 ms 27072 KB Output is correct
41 Correct 115 ms 25696 KB Output is correct
42 Correct 141 ms 27064 KB Output is correct
43 Correct 59 ms 23544 KB Output is correct
44 Correct 145 ms 27152 KB Output is correct
45 Correct 38 ms 22720 KB Output is correct
46 Correct 144 ms 27076 KB Output is correct
47 Correct 50 ms 23108 KB Output is correct
48 Correct 144 ms 27068 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 43 ms 33220 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21580 KB Output is correct
2 Correct 15 ms 21580 KB Output is correct
3 Correct 15 ms 21580 KB Output is correct
4 Correct 15 ms 21584 KB Output is correct
5 Correct 15 ms 21580 KB Output is correct
6 Correct 15 ms 21580 KB Output is correct
7 Correct 15 ms 21576 KB Output is correct
8 Correct 16 ms 21692 KB Output is correct
9 Correct 15 ms 21580 KB Output is correct
10 Correct 15 ms 21584 KB Output is correct
11 Correct 16 ms 21572 KB Output is correct
12 Correct 15 ms 21644 KB Output is correct
13 Correct 15 ms 21644 KB Output is correct
14 Correct 15 ms 21656 KB Output is correct
15 Correct 15 ms 21580 KB Output is correct
16 Correct 15 ms 21580 KB Output is correct
17 Correct 15 ms 21580 KB Output is correct
18 Correct 15 ms 21580 KB Output is correct
19 Correct 15 ms 21584 KB Output is correct
20 Correct 15 ms 21572 KB Output is correct
21 Correct 15 ms 21580 KB Output is correct
22 Correct 15 ms 21580 KB Output is correct
23 Correct 15 ms 21672 KB Output is correct
24 Correct 15 ms 21576 KB Output is correct
25 Correct 115 ms 26084 KB Output is correct
26 Correct 26 ms 22220 KB Output is correct
27 Correct 148 ms 28032 KB Output is correct
28 Correct 162 ms 28184 KB Output is correct
29 Correct 104 ms 26180 KB Output is correct
30 Correct 103 ms 25904 KB Output is correct
31 Correct 121 ms 27408 KB Output is correct
32 Correct 147 ms 28096 KB Output is correct
33 Correct 139 ms 27588 KB Output is correct
34 Correct 82 ms 24836 KB Output is correct
35 Correct 143 ms 27972 KB Output is correct
36 Correct 144 ms 28104 KB Output is correct
37 Correct 89 ms 24796 KB Output is correct
38 Correct 143 ms 27076 KB Output is correct
39 Correct 34 ms 22416 KB Output is correct
40 Correct 143 ms 27072 KB Output is correct
41 Correct 115 ms 25696 KB Output is correct
42 Correct 141 ms 27064 KB Output is correct
43 Correct 59 ms 23544 KB Output is correct
44 Correct 145 ms 27152 KB Output is correct
45 Correct 38 ms 22720 KB Output is correct
46 Correct 144 ms 27076 KB Output is correct
47 Correct 50 ms 23108 KB Output is correct
48 Correct 144 ms 27068 KB Output is correct
49 Runtime error 43 ms 33220 KB Execution killed with signal 6
50 Halted 0 ms 0 KB -