oj.uz

Submission #375799

# Submission time Handle Problem Language Result Execution time Memory
375799 2021-03-10T02:33:13 Z daniel920712 Two Antennas (JOI19_antennas) C++14
24 / 100
 3000 ms 44388 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>

using namespace std;
struct A
{

    int l,r;
    int nxl,nxr;
    pair < int , int > ans;
}Node[1000005];
int all[200005],now=1;
int ans[200005];
int l[200005],r[200005];
vector < pair < int , int > > query[200005];
int x[200005],y[200005];
vector < pair < int , int > > in[200005];
vector < pair < int , int > > out[200005];
pair < int , int > operator+(pair < int , int > a,pair < int , int > b)
{
    return make_pair(max(a.first,b.first),min(a.second,b.second));
}
void build(int l,int r,int here)
{
    Node[here].l=l;
    Node[here].r=r;
    if(l==r)
    {
        Node[here].ans=make_pair(0,2e9);
        return;
    }
    Node[here].nxl=now++;
    Node[here].nxr=now++;
    build(l,(l+r)/2,Node[here].nxl);
    build((l+r)/2+1,r,Node[here].nxr);
    Node[here].ans=Node[Node[here].nxl].ans+Node[Node[here].nxr].ans;
}
void cha(int where,pair < int , int > con,int here)
{
    if(where==Node[here].l&&where==Node[here].r)
    {
        Node[here].ans=con;
        return;
    }
    if(where<=(Node[here].l+Node[here].r)/2) cha(where,con,Node[here].nxl);
    else cha(where,con,Node[here].nxr);
    Node[here].ans=Node[Node[here].nxl].ans+Node[Node[here].nxr].ans;
}
pair < int , int > Find(int l,int r,int here)
{
    if(l==Node[here].l&&r==Node[here].r) return Node[here].ans;
    if(r<=(Node[here].l+Node[here].r)/2) return Find(l,r,Node[here].nxl);
    else if(l>(Node[here].l+Node[here].r)/2) return Find(l,r,Node[here].nxr);
    else return Find(l,(Node[here].l+Node[here].r)/2,Node[here].nxl)+Find((Node[here].l+Node[here].r)/2+1,r,Node[here].nxr);
}
pair < int , int > tt;
int main()
{
    int N,M,ok=0,i,j;
    scanf("%d",&N);
    for(i=1;i<=N;i++)
    {
        scanf("%d %d %d",&all[i],&l[i],&r[i]);
        if(i-l[i]>=1)
        {
            in[max(1,i-r[i])].push_back(make_pair(i,all[i]));
            out[i-l[i]+1].push_back(make_pair(i,all[i]));
        }
    }
    scanf("%d",&M);
    for(i=0;i<M;i++)
    {
        scanf("%d %d",&x[i],&y[i]);
    }
    build(1,N,0);
    for(i=1;i<=N;i++)
    {
        for(auto j:in[i]) cha(j.first,make_pair(j.second,j.second),0);
        for(auto j:out[i]) cha(j.first,make_pair(0,2e9),0);
        for(j=0;j<M;j++)
        {
            if(i>=x[j]&&i+l[i]<=y[j])
            {
                tt=Find(i+l[i],min(y[j],i+r[i]),0);
                if(tt.first) ans[j]=max(ans[j],abs(all[i]-tt.first));
                if(tt.second!=2000000000) ans[j]=max(ans[j],abs(all[i]-tt.second));
            }
        }
    }
    for(i=0;i<M;i++)
    {
        if(ans[i]==0) printf("-1\n");
        else printf("%d\n",ans[i]);
    }

    return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:61:13: warning: unused variable 'ok' [-Wunused-variable]
   61 |     int N,M,ok=0,i,j;
      |             ^~
antennas.cpp:62:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   62 |     scanf("%d",&N);
      |     ~~~~~^~~~~~~~~
antennas.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |         scanf("%d %d %d",&all[i],&l[i],&r[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   72 |     scanf("%d",&M);
      |     ~~~~~^~~~~~~~~
antennas.cpp:75:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   75 |         scanf("%d %d",&x[i],&y[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 37868 KB Output is correct
2 Correct 23 ms 37996 KB Output is correct
3 Correct 23 ms 37868 KB Output is correct
4 Correct 24 ms 37996 KB Output is correct
5 Correct 22 ms 38016 KB Output is correct
6 Correct 24 ms 37996 KB Output is correct
7 Correct 23 ms 37996 KB Output is correct
8 Correct 24 ms 37996 KB Output is correct
9 Correct 23 ms 37868 KB Output is correct
10 Correct 23 ms 37996 KB Output is correct
11 Correct 22 ms 37868 KB Output is correct
12 Correct 24 ms 37996 KB Output is correct
13 Correct 23 ms 37868 KB Output is correct
14 Correct 23 ms 37868 KB Output is correct
15 Correct 23 ms 37868 KB Output is correct
16 Correct 23 ms 37868 KB Output is correct
17 Correct 22 ms 37868 KB Output is correct
18 Correct 23 ms 37868 KB Output is correct
19 Correct 22 ms 38016 KB Output is correct
20 Correct 23 ms 38016 KB Output is correct
21 Correct 24 ms 37868 KB Output is correct
22 Correct 23 ms 37868 KB Output is correct
23 Correct 23 ms 37868 KB Output is correct
24 Correct 23 ms 37868 KB Output is correct
25 Correct 1568 ms 40992 KB Output is correct
26 Correct 391 ms 38380 KB Output is correct
27 Execution timed out 3063 ms 42092 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 43748 KB Output is correct
2 Correct 297 ms 44260 KB Output is correct
3 Correct 197 ms 42344 KB Output is correct
4 Correct 312 ms 44260 KB Output is correct
5 Correct 120 ms 40928 KB Output is correct
6 Correct 285 ms 44260 KB Output is correct
7 Correct 282 ms 43652 KB Output is correct
8 Correct 275 ms 44260 KB Output is correct
9 Correct 50 ms 38892 KB Output is correct
10 Correct 297 ms 44388 KB Output is correct
11 Correct 178 ms 41964 KB Output is correct
12 Correct 301 ms 44260 KB Output is correct
13 Correct 188 ms 44132 KB Output is correct
14 Correct 176 ms 43748 KB Output is correct
15 Correct 200 ms 42432 KB Output is correct
16 Correct 163 ms 42272 KB Output is correct
17 Correct 192 ms 44260 KB Output is correct
18 Correct 169 ms 42852 KB Output is correct
19 Correct 176 ms 43368 KB Output is correct
20 Correct 174 ms 43624 KB Output is correct
21 Correct 173 ms 44004 KB Output is correct
22 Correct 175 ms 43364 KB Output is correct
23 Correct 181 ms 43540 KB Output is correct
24 Correct 157 ms 42316 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 37868 KB Output is correct
2 Correct 23 ms 37996 KB Output is correct
3 Correct 23 ms 37868 KB Output is correct
4 Correct 24 ms 37996 KB Output is correct
5 Correct 22 ms 38016 KB Output is correct
6 Correct 24 ms 37996 KB Output is correct
7 Correct 23 ms 37996 KB Output is correct
8 Correct 24 ms 37996 KB Output is correct
9 Correct 23 ms 37868 KB Output is correct
10 Correct 23 ms 37996 KB Output is correct
11 Correct 22 ms 37868 KB Output is correct
12 Correct 24 ms 37996 KB Output is correct
13 Correct 23 ms 37868 KB Output is correct
14 Correct 23 ms 37868 KB Output is correct
15 Correct 23 ms 37868 KB Output is correct
16 Correct 23 ms 37868 KB Output is correct
17 Correct 22 ms 37868 KB Output is correct
18 Correct 23 ms 37868 KB Output is correct
19 Correct 22 ms 38016 KB Output is correct
20 Correct 23 ms 38016 KB Output is correct
21 Correct 24 ms 37868 KB Output is correct
22 Correct 23 ms 37868 KB Output is correct
23 Correct 23 ms 37868 KB Output is correct
24 Correct 23 ms 37868 KB Output is correct
25 Correct 1568 ms 40992 KB Output is correct
26 Correct 391 ms 38380 KB Output is correct
27 Execution timed out 3063 ms 42092 KB Time limit exceeded
28 Halted 0 ms 0 KB -