oj.uz

Submission #977860

# Submission time Handle Problem Language Result Execution time Memory
977860 2024-05-08T11:58:09 Z sleepntsheep Cake 3 (JOI19_cake3) C
100 / 100
 467 ms 6740 KB 
#include<stdio.h>
#include<time.h>
#include<stdlib.h>

#define N 200000
int n, M, v[N],c[N],o[N],v2[N],vm[N],fw[N];
long long fw2[N],z=-1e18;

void add_(int p,int k1,long long k2) { for(;p<N;p|=p+1)fw[p]+=k1,fw2[p]+=k2; }
long long search()
{
    long long val2=0;int val=0,pos=0;
    for(int j=1<<19;j>>=1;)
        if(pos+j<=N&&val+fw[pos+j-1]<=M)pos+=j,val+=fw[pos-1],val2+=fw2[pos-1];
    return val2;
}

int cl=0,cr=-1;
void add(int i) { add_(vm[i],1,v[i]); }
void del(int i) { add_(vm[i],-1,-v[i]); }
void move(int l,int r)
{
    while(cr<r)add(++cr);
    while(cl>l)add(--cl);
    while(cr>r)del(cr--);
    while(cl<l)del(cl++);
}

void map(int i)
{
    int lb=-1,ub=n,x=v[i];
    while(ub-lb>1)
    {
        int mid=lb+(ub-lb)/2;
        if(v2[mid]<x)lb=mid;
        else ub=mid;
    }
    vm[i]=n-ub-1;
}

void sort(int *a,int l,int r)
{
    while(l<r)
    {
        int i=l,j=l,k=r,t,p=a[l+rand()%(r-l)];
        while(j<k)
        {
            int cmp;
            if(a==v2)cmp=a[j]-p;
            else cmp=c[a[j]]-c[p];
            if(cmp<0)
                t=a[i],a[i]=a[j],a[j]=t,++i,++j;
            else if(cmp==0)
                ++j;
            else
                t=a[--k],a[k]=a[j],a[j]=t;
        }
        sort(a,l,i);
        l=k;
    }
}

void dnc(int l,int r,int optl,int optr)
{
    if(l>r) return;
    int m=l+(r-l)/2,opt=-1;
    long long res=-1e18,res2;
    for(int i=optl;i<=optr&&i+M-1<=m;++i)
    {
        move(i,m);
        res2=search()-2*(c[m]-c[i]);
        if(res2>res)res=res2,opt=i;
    }
    if(res>z)z=res;
    dnc(l,m-1,optl,opt);
    dnc(m+1,r,opt,optr);
}

int main()
{
    srand(time(0));
    scanf("%d%d",&n,&M);
    for(int i=0;i<n;++i)scanf("%d%d",v+i,c+i),o[i]=i;
    sort(o,0,n);
    for(int i=0;i<n;++i)v2[i]=v[o[i]],vm[i]=c[o[i]];
    for(int i=0;i<n;++i)c[i]=vm[i],v[i]=v2[i],o[i]=0;
    sort(v2,0,n);
    for(int i=0;i<n;++i)
    {
        map(i);
        /* duplicate element break fenwick search */
        vm[i]-=o[vm[i]]++;
    }
    dnc(M-1,n-1,0,n-1);
    printf("%lld",z);
}

Compilation message

cake3.c: In function 'main':
cake3.c:82:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |     scanf("%d%d",&n,&M);
      |     ^~~~~~~~~~~~~~~~~~~
cake3.c:83:25: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |     for(int i=0;i<n;++i)scanf("%d%d",v+i,c+i),o[i]=i;
      |                         ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 2 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4496 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4596 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 2 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4496 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4596 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 3 ms 4444 KB Output is correct
39 Correct 3 ms 4536 KB Output is correct
40 Correct 3 ms 4444 KB Output is correct
41 Correct 3 ms 4444 KB Output is correct
42 Correct 2 ms 4456 KB Output is correct
43 Correct 2 ms 4444 KB Output is correct
44 Correct 4 ms 4440 KB Output is correct
45 Correct 4 ms 4444 KB Output is correct
46 Correct 4 ms 4444 KB Output is correct
47 Correct 4 ms 4440 KB Output is correct
48 Correct 3 ms 4444 KB Output is correct
49 Correct 3 ms 4444 KB Output is correct
50 Correct 3 ms 4444 KB Output is correct
51 Correct 3 ms 4444 KB Output is correct
52 Correct 2 ms 4444 KB Output is correct
53 Correct 3 ms 4440 KB Output is correct
54 Correct 2 ms 4444 KB Output is correct
55 Correct 3 ms 4444 KB Output is correct
56 Correct 2 ms 4444 KB Output is correct
57 Correct 2 ms 4444 KB Output is correct
58 Correct 2 ms 4440 KB Output is correct
59 Correct 2 ms 4444 KB Output is correct
60 Correct 2 ms 4600 KB Output is correct
61 Correct 2 ms 4440 KB Output is correct
62 Correct 3 ms 4440 KB Output is correct
63 Correct 2 ms 4444 KB Output is correct
64 Correct 2 ms 4588 KB Output is correct
65 Correct 3 ms 4444 KB Output is correct
66 Correct 3 ms 4444 KB Output is correct
67 Correct 4 ms 4444 KB Output is correct
68 Correct 3 ms 4444 KB Output is correct
69 Correct 2 ms 4444 KB Output is correct
70 Correct 2 ms 4444 KB Output is correct
71 Correct 2 ms 4524 KB Output is correct
72 Correct 2 ms 4444 KB Output is correct
73 Correct 3 ms 4444 KB Output is correct
74 Correct 2 ms 4444 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 2 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4496 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4596 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 3 ms 4444 KB Output is correct
39 Correct 3 ms 4536 KB Output is correct
40 Correct 3 ms 4444 KB Output is correct
41 Correct 3 ms 4444 KB Output is correct
42 Correct 2 ms 4456 KB Output is correct
43 Correct 2 ms 4444 KB Output is correct
44 Correct 4 ms 4440 KB Output is correct
45 Correct 4 ms 4444 KB Output is correct
46 Correct 4 ms 4444 KB Output is correct
47 Correct 4 ms 4440 KB Output is correct
48 Correct 3 ms 4444 KB Output is correct
49 Correct 3 ms 4444 KB Output is correct
50 Correct 3 ms 4444 KB Output is correct
51 Correct 3 ms 4444 KB Output is correct
52 Correct 2 ms 4444 KB Output is correct
53 Correct 3 ms 4440 KB Output is correct
54 Correct 2 ms 4444 KB Output is correct
55 Correct 3 ms 4444 KB Output is correct
56 Correct 2 ms 4444 KB Output is correct
57 Correct 2 ms 4444 KB Output is correct
58 Correct 2 ms 4440 KB Output is correct
59 Correct 2 ms 4444 KB Output is correct
60 Correct 2 ms 4600 KB Output is correct
61 Correct 2 ms 4440 KB Output is correct
62 Correct 3 ms 4440 KB Output is correct
63 Correct 2 ms 4444 KB Output is correct
64 Correct 2 ms 4588 KB Output is correct
65 Correct 3 ms 4444 KB Output is correct
66 Correct 3 ms 4444 KB Output is correct
67 Correct 4 ms 4444 KB Output is correct
68 Correct 3 ms 4444 KB Output is correct
69 Correct 2 ms 4444 KB Output is correct
70 Correct 2 ms 4444 KB Output is correct
71 Correct 2 ms 4524 KB Output is correct
72 Correct 2 ms 4444 KB Output is correct
73 Correct 3 ms 4444 KB Output is correct
74 Correct 2 ms 4444 KB Output is correct
75 Correct 369 ms 6484 KB Output is correct
76 Correct 428 ms 6520 KB Output is correct
77 Correct 346 ms 6560 KB Output is correct
78 Correct 379 ms 6336 KB Output is correct
79 Correct 126 ms 6480 KB Output is correct
80 Correct 157 ms 6320 KB Output is correct
81 Correct 368 ms 6484 KB Output is correct
82 Correct 467 ms 6592 KB Output is correct
83 Correct 407 ms 6484 KB Output is correct
84 Correct 455 ms 6528 KB Output is correct
85 Correct 363 ms 6584 KB Output is correct
86 Correct 233 ms 6540 KB Output is correct
87 Correct 221 ms 6480 KB Output is correct
88 Correct 336 ms 6332 KB Output is correct
89 Correct 330 ms 6484 KB Output is correct
90 Correct 210 ms 6656 KB Output is correct
91 Correct 151 ms 6424 KB Output is correct
92 Correct 161 ms 6484 KB Output is correct
93 Correct 190 ms 6584 KB Output is correct
94 Correct 143 ms 6484 KB Output is correct
95 Correct 204 ms 6544 KB Output is correct
96 Correct 165 ms 6516 KB Output is correct
97 Correct 174 ms 6488 KB Output is correct
98 Correct 161 ms 6484 KB Output is correct
99 Correct 148 ms 6524 KB Output is correct
100 Correct 144 ms 6436 KB Output is correct
101 Correct 134 ms 6484 KB Output is correct
102 Correct 297 ms 6536 KB Output is correct
103 Correct 279 ms 6740 KB Output is correct
104 Correct 334 ms 6592 KB Output is correct
105 Correct 252 ms 6380 KB Output is correct
106 Correct 278 ms 6504 KB Output is correct
107 Correct 239 ms 6372 KB Output is correct
108 Correct 329 ms 6580 KB Output is correct
109 Correct 283 ms 6532 KB Output is correct
110 Correct 176 ms 6368 KB Output is correct
111 Correct 209 ms 6480 KB Output is correct
112 Correct 332 ms 6508 KB Output is correct
113 Correct 111 ms 6536 KB Output is correct