oj.uz

Submission #279988

# Submission time Handle Problem Language Result Execution time Memory
279988 2020-08-22T12:31:12 Z MKopchev Two Antennas (JOI19_antennas) C++14
100 / 100
 1522 ms 43516 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=2e5+42,inf=1e9+42;

int n,q;

int inp[nmax];

int a[nmax],b[nmax];

vector< pair<int/*left*/,int/*id*/> > seen[nmax];

int outp[nmax];

vector<int> in[nmax],out[nmax];

int value[nmax],mx[nmax];

struct info
{
    int max_value,max_mx,max_update;
};

info actual(info ret)
{
    ret.max_mx=max(ret.max_mx,ret.max_value+ret.max_update);
    ret.max_update=-inf;
    return ret;
}
info tree[4*nmax];

void push(int node)
{
    tree[node*2].max_update=max(tree[node*2].max_update,tree[node].max_update);
    tree[node*2+1].max_update=max(tree[node*2+1].max_update,tree[node].max_update);
}

info my_merge(info le,info ri)
{
    le=actual(le);
    ri=actual(ri);

    info ret;
    ret.max_value=max(le.max_value,ri.max_value);
    ret.max_mx=max(le.max_mx,ri.max_mx);
    ret.max_update=-inf;

    return ret;
}
void update_set(int node,int l,int r,int pos,int val)
{
    if(l==r)
    {
        tree[node].max_mx=max(tree[node].max_mx,tree[node].max_value+tree[node].max_update);

        tree[node].max_value=val;

        tree[node].max_update=-inf;

        tree[node].max_mx=max(tree[node].max_mx,tree[node].max_value+tree[node].max_update);

        return;
    }

    push(node);

    int av=(l+r)/2;

    if(pos<=av)update_set(node*2,l,av,pos,val);
    else update_set(node*2+1,av+1,r,pos,val);

    tree[node]=my_merge(tree[node*2],tree[node*2+1]);
}

void update_range(int node,int l,int r,int lq,int rq,int val)
{
    if(l==lq&&r==rq)
    {
        tree[node].max_update=max(tree[node].max_update,val);

        tree[node].max_mx=max(tree[node].max_mx,tree[node].max_value+tree[node].max_update);

        return;
    }

    push(node);

    int av=(l+r)/2;

    if(lq<=av)update_range(node*2,l,av,lq,min(av,rq),val);
    if(av<rq)update_range(node*2+1,av+1,r,max(av+1,lq),rq,val);

    tree[node]=my_merge(tree[node*2],tree[node*2+1]);
}

info query(int node,int l,int r,int lq,int rq)
{
    if(l==lq&&r==rq)return actual(tree[node]);

    push(node);

    int av=(l+r)/2;

    info ret;ret.max_mx=-inf;ret.max_value=-inf;ret.max_update=-inf;

    if(lq<=av)ret=my_merge(ret,query(node*2,l,av,lq,min(av,rq)));
    if(av<rq)ret=my_merge(ret,query(node*2+1,av+1,r,max(av+1,lq),rq));

    tree[node]=my_merge(tree[node*2],tree[node*2+1]);

    return ret;
}

void solve()
{
    for(int i=1;i<=4*n;i++)
    {
        tree[i].max_value=-inf;
        tree[i].max_mx=-inf;
        tree[i].max_update=-inf;
    }

    for(int i=1;i<=n;i++)
    {
        for(auto k:in[i])
        {
            update_set(1,1,n,k,-inp[k]);
        }
        int le=max(i-b[i],1),ri=i-a[i];

        if(le<=ri)update_range(1,1,n,le,ri,inp[i]);

        for(auto k:seen[i])
        {
            outp[k.second]=max(outp[k.second],query(1,1,n,k.first,i).max_mx);
        }

        for(auto k:out[i])
        {
            update_set(1,1,n,k,-inf);
        }

    }
}

int main()
{
    memset(outp,-1,sizeof(outp));

    scanf("%i",&n);

    for(int i=1;i<=n;i++)
    {
        scanf("%i%i%i",&inp[i],&a[i],&b[i]);
        if(i+a[i]<=n)in[i+a[i]].push_back(i);
        if(i+b[i]<=n)out[i+b[i]].push_back(i);
    }
    scanf("%i",&q);

    for(int i=1;i<=q;i++)
    {
        int l,r;

        scanf("%i%i",&l,&r);

        seen[r].push_back({l,i});
    }

    solve();

    for(int i=1;i<=n;i++)inp[i]=-inp[i];

    solve();

    for(int i=1;i<=q;i++)
        printf("%i\n",outp[i]);
    return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:150:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  150 |     scanf("%i",&n);
      |     ~~~~~^~~~~~~~~
antennas.cpp:154:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  154 |         scanf("%i%i%i",&inp[i],&a[i],&b[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:158:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  158 |     scanf("%i",&q);
      |     ~~~~~^~~~~~~~~
antennas.cpp:164:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  164 |         scanf("%i%i",&l,&r);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15232 KB Output is correct
2 Correct 11 ms 15360 KB Output is correct
3 Correct 11 ms 15232 KB Output is correct
4 Correct 11 ms 15232 KB Output is correct
5 Correct 11 ms 15232 KB Output is correct
6 Correct 11 ms 15232 KB Output is correct
7 Correct 11 ms 15232 KB Output is correct
8 Correct 11 ms 15264 KB Output is correct
9 Correct 11 ms 15232 KB Output is correct
10 Correct 11 ms 15232 KB Output is correct
11 Correct 11 ms 15232 KB Output is correct
12 Correct 11 ms 15232 KB Output is correct
13 Correct 11 ms 15232 KB Output is correct
14 Correct 11 ms 15232 KB Output is correct
15 Correct 11 ms 15232 KB Output is correct
16 Correct 11 ms 15264 KB Output is correct
17 Correct 11 ms 15232 KB Output is correct
18 Correct 11 ms 15232 KB Output is correct
19 Correct 11 ms 15360 KB Output is correct
20 Correct 13 ms 15232 KB Output is correct
21 Correct 11 ms 15232 KB Output is correct
22 Correct 11 ms 15232 KB Output is correct
23 Correct 12 ms 15232 KB Output is correct
24 Correct 12 ms 15232 KB Output is correct
25 Correct 354 ms 19448 KB Output is correct
26 Correct 51 ms 15800 KB Output is correct
27 Correct 522 ms 20728 KB Output is correct
28 Correct 542 ms 20740 KB Output is correct
29 Correct 352 ms 19448 KB Output is correct
30 Correct 355 ms 19400 KB Output is correct
31 Correct 386 ms 20124 KB Output is correct
32 Correct 534 ms 20728 KB Output is correct
33 Correct 482 ms 20496 KB Output is correct
34 Correct 257 ms 18296 KB Output is correct
35 Correct 508 ms 20684 KB Output is correct
36 Correct 542 ms 20808 KB Output is correct
37 Correct 305 ms 18296 KB Output is correct
38 Correct 531 ms 19832 KB Output is correct
39 Correct 86 ms 16124 KB Output is correct
40 Correct 529 ms 20036 KB Output is correct
41 Correct 391 ms 18912 KB Output is correct
42 Correct 539 ms 19832 KB Output is correct
43 Correct 183 ms 17144 KB Output is correct
44 Correct 530 ms 19832 KB Output is correct
45 Correct 97 ms 16248 KB Output is correct
46 Correct 525 ms 19832 KB Output is correct
47 Correct 155 ms 16684 KB Output is correct
48 Correct 558 ms 19864 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 33016 KB Output is correct
2 Correct 525 ms 35192 KB Output is correct
3 Correct 335 ms 29200 KB Output is correct
4 Correct 591 ms 35152 KB Output is correct
5 Correct 225 ms 24312 KB Output is correct
6 Correct 609 ms 35072 KB Output is correct
7 Correct 449 ms 32376 KB Output is correct
8 Correct 517 ms 35064 KB Output is correct
9 Correct 67 ms 18296 KB Output is correct
10 Correct 516 ms 35068 KB Output is correct
11 Correct 320 ms 27512 KB Output is correct
12 Correct 546 ms 35064 KB Output is correct
13 Correct 453 ms 32588 KB Output is correct
14 Correct 427 ms 32644 KB Output is correct
15 Correct 408 ms 32888 KB Output is correct
16 Correct 355 ms 33240 KB Output is correct
17 Correct 462 ms 32672 KB Output is correct
18 Correct 409 ms 33144 KB Output is correct
19 Correct 413 ms 32468 KB Output is correct
20 Correct 408 ms 32576 KB Output is correct
21 Correct 426 ms 32392 KB Output is correct
22 Correct 430 ms 32668 KB Output is correct
23 Correct 438 ms 32628 KB Output is correct
24 Correct 344 ms 32632 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15232 KB Output is correct
2 Correct 11 ms 15360 KB Output is correct
3 Correct 11 ms 15232 KB Output is correct
4 Correct 11 ms 15232 KB Output is correct
5 Correct 11 ms 15232 KB Output is correct
6 Correct 11 ms 15232 KB Output is correct
7 Correct 11 ms 15232 KB Output is correct
8 Correct 11 ms 15264 KB Output is correct
9 Correct 11 ms 15232 KB Output is correct
10 Correct 11 ms 15232 KB Output is correct
11 Correct 11 ms 15232 KB Output is correct
12 Correct 11 ms 15232 KB Output is correct
13 Correct 11 ms 15232 KB Output is correct
14 Correct 11 ms 15232 KB Output is correct
15 Correct 11 ms 15232 KB Output is correct
16 Correct 11 ms 15264 KB Output is correct
17 Correct 11 ms 15232 KB Output is correct
18 Correct 11 ms 15232 KB Output is correct
19 Correct 11 ms 15360 KB Output is correct
20 Correct 13 ms 15232 KB Output is correct
21 Correct 11 ms 15232 KB Output is correct
22 Correct 11 ms 15232 KB Output is correct
23 Correct 12 ms 15232 KB Output is correct
24 Correct 12 ms 15232 KB Output is correct
25 Correct 354 ms 19448 KB Output is correct
26 Correct 51 ms 15800 KB Output is correct
27 Correct 522 ms 20728 KB Output is correct
28 Correct 542 ms 20740 KB Output is correct
29 Correct 352 ms 19448 KB Output is correct
30 Correct 355 ms 19400 KB Output is correct
31 Correct 386 ms 20124 KB Output is correct
32 Correct 534 ms 20728 KB Output is correct
33 Correct 482 ms 20496 KB Output is correct
34 Correct 257 ms 18296 KB Output is correct
35 Correct 508 ms 20684 KB Output is correct
36 Correct 542 ms 20808 KB Output is correct
37 Correct 305 ms 18296 KB Output is correct
38 Correct 531 ms 19832 KB Output is correct
39 Correct 86 ms 16124 KB Output is correct
40 Correct 529 ms 20036 KB Output is correct
41 Correct 391 ms 18912 KB Output is correct
42 Correct 539 ms 19832 KB Output is correct
43 Correct 183 ms 17144 KB Output is correct
44 Correct 530 ms 19832 KB Output is correct
45 Correct 97 ms 16248 KB Output is correct
46 Correct 525 ms 19832 KB Output is correct
47 Correct 155 ms 16684 KB Output is correct
48 Correct 558 ms 19864 KB Output is correct
49 Correct 465 ms 33016 KB Output is correct
50 Correct 525 ms 35192 KB Output is correct
51 Correct 335 ms 29200 KB Output is correct
52 Correct 591 ms 35152 KB Output is correct
53 Correct 225 ms 24312 KB Output is correct
54 Correct 609 ms 35072 KB Output is correct
55 Correct 449 ms 32376 KB Output is correct
56 Correct 517 ms 35064 KB Output is correct
57 Correct 67 ms 18296 KB Output is correct
58 Correct 516 ms 35068 KB Output is correct
59 Correct 320 ms 27512 KB Output is correct
60 Correct 546 ms 35064 KB Output is correct
61 Correct 453 ms 32588 KB Output is correct
62 Correct 427 ms 32644 KB Output is correct
63 Correct 408 ms 32888 KB Output is correct
64 Correct 355 ms 33240 KB Output is correct
65 Correct 462 ms 32672 KB Output is correct
66 Correct 409 ms 33144 KB Output is correct
67 Correct 413 ms 32468 KB Output is correct
68 Correct 408 ms 32576 KB Output is correct
69 Correct 426 ms 32392 KB Output is correct
70 Correct 430 ms 32668 KB Output is correct
71 Correct 438 ms 32628 KB Output is correct
72 Correct 344 ms 32632 KB Output is correct
73 Correct 1253 ms 39416 KB Output is correct
74 Correct 575 ms 35832 KB Output is correct
75 Correct 1277 ms 36976 KB Output is correct
76 Correct 1522 ms 43384 KB Output is correct
77 Correct 862 ms 29816 KB Output is correct
78 Correct 1167 ms 40868 KB Output is correct
79 Correct 1456 ms 40544 KB Output is correct
80 Correct 1518 ms 43516 KB Output is correct
81 Correct 808 ms 25012 KB Output is correct
82 Correct 981 ms 39416 KB Output is correct
83 Correct 1224 ms 35312 KB Output is correct
84 Correct 1499 ms 43384 KB Output is correct
85 Correct 995 ms 36940 KB Output is correct
86 Correct 1419 ms 39924 KB Output is correct
87 Correct 544 ms 33948 KB Output is correct
88 Correct 1328 ms 40312 KB Output is correct
89 Correct 1169 ms 38176 KB Output is correct
90 Correct 1404 ms 40332 KB Output is correct
91 Correct 821 ms 35284 KB Output is correct
92 Correct 1435 ms 39672 KB Output is correct
93 Correct 590 ms 34016 KB Output is correct
94 Correct 1403 ms 40048 KB Output is correct
95 Correct 669 ms 34676 KB Output is correct
96 Correct 1318 ms 40060 KB Output is correct