Submission #954585

# Submission time Handle Problem Language Result Execution time Memory
954585 2024-03-28T07:41:03 Z sleepntsheep Advertisement 2 (JOI23_ho_t2) C
100 / 100
182 ms 24984 KB
unsigned rng=12345;
int rand_(){return (rng*=3)>>1;}
int(*compar)(int,int);
void sort_(int*aa,int l,int r)
{
    while(l<r)
    {
        int i=l,j=l,k=r,t,p=aa[l+rand_()%(r-l)];
        while(j<k)
            switch(compar(aa[j],p))
            {
                case 0:++j;break;
                case -1:t=aa[i],aa[i]=aa[j],aa[j]=t,++i,++j;break;
                case 1:t=aa[--k],aa[k]=aa[j],aa[j]=t;break;
            }
        sort_(aa,l,i);
        l=k;
    }
}

#include<stdio.h>
#define N 500001
int n,a[N],b[N],o[N],x[N],y[N],z[N];

int compar_a(int i,int j) { return a[i]<a[j]?-1:a[i]>a[j]?1:0; }

int s[N],so,t[N],to;

int main()
{
    scanf("%d",&n);
    for(int i=0;i<n;++i)scanf("%d%d",a+i,b+i),o[i]=i;
    compar=compar_a;
    sort_(o,0,n);

    for(int i=0;i<n;++i)x[i]=a[o[i]],y[i]=a[o[i]]+b[o[i]],z[i]=b[o[i]]-a[o[i]];

    for(int i=0;i<n;++i)
    {
        while(so&&z[s[so-1]]<=z[i])--so;
        s[so++]=i;
    }


    for(int j=so-1;j>=0;--j)
    {
        while(to&&y[t[to-1]]<=y[s[j]])--to;
        t[to++]=s[j];
    }
    printf("%d",to);

}

Compilation message

Main.c: In function 'main':
Main.c:31:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     scanf("%d",&n);
      |     ^~~~~~~~~~~~~~
Main.c:32:25: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     for(int i=0;i<n;++i)scanf("%d%d",a+i,b+i),o[i]=i;
      |                         ^~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 47 ms 15864 KB Output is correct
3 Correct 59 ms 16664 KB Output is correct
4 Correct 128 ms 21704 KB Output is correct
5 Correct 58 ms 18968 KB Output is correct
6 Correct 180 ms 24984 KB Output is correct
7 Correct 166 ms 24088 KB Output is correct
8 Correct 135 ms 22584 KB Output is correct
9 Correct 86 ms 22864 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12728 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12644 KB Output is correct
9 Correct 2 ms 12640 KB Output is correct
10 Correct 2 ms 12640 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12640 KB Output is correct
13 Correct 2 ms 12640 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12640 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12640 KB Output is correct
18 Correct 2 ms 12720 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12728 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12644 KB Output is correct
9 Correct 2 ms 12640 KB Output is correct
10 Correct 2 ms 12640 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12640 KB Output is correct
13 Correct 2 ms 12640 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12640 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12640 KB Output is correct
18 Correct 2 ms 12720 KB Output is correct
19 Correct 2 ms 12640 KB Output is correct
20 Correct 2 ms 12640 KB Output is correct
21 Correct 2 ms 12632 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 2 ms 12648 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 47 ms 15864 KB Output is correct
3 Correct 59 ms 16664 KB Output is correct
4 Correct 128 ms 21704 KB Output is correct
5 Correct 58 ms 18968 KB Output is correct
6 Correct 180 ms 24984 KB Output is correct
7 Correct 166 ms 24088 KB Output is correct
8 Correct 135 ms 22584 KB Output is correct
9 Correct 86 ms 22864 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12728 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12644 KB Output is correct
18 Correct 2 ms 12640 KB Output is correct
19 Correct 2 ms 12640 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12640 KB Output is correct
22 Correct 2 ms 12640 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12640 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 2 ms 12640 KB Output is correct
27 Correct 2 ms 12720 KB Output is correct
28 Correct 2 ms 12640 KB Output is correct
29 Correct 2 ms 12640 KB Output is correct
30 Correct 2 ms 12632 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12632 KB Output is correct
34 Correct 2 ms 12636 KB Output is correct
35 Correct 2 ms 12648 KB Output is correct
36 Correct 116 ms 19024 KB Output is correct
37 Correct 150 ms 20820 KB Output is correct
38 Correct 177 ms 22420 KB Output is correct
39 Correct 158 ms 19484 KB Output is correct
40 Correct 177 ms 22356 KB Output is correct
41 Correct 180 ms 22356 KB Output is correct
42 Correct 156 ms 22616 KB Output is correct
43 Correct 174 ms 23208 KB Output is correct
44 Correct 176 ms 23636 KB Output is correct
45 Correct 182 ms 21648 KB Output is correct