oj.uz

Submission #130505

# Submission time Handle Problem Language Result Execution time Memory
130505 2019-07-15T11:34:05 Z Bodo171 Cake 3 (JOI19_cake3) C++14
100 / 100
 939 ms 12024 KB 
#include <iostream>
#include <fstream>
#include <climits>
#include <algorithm>
#include <cassert>
using namespace std;
const int nmax=200005;
pair<int,int> v[nmax],nrm[nmax];
pair<int,long long> aib[nmax];
long long glob=LLONG_MIN;
int act[nmax];
int n,i,j,k;
inline int lbit(int x)
{
    return (((x^(x-1))&x));
}
void update(int poz,int v1,long long v2)
{
    for(int idx=poz;idx<=n;idx+=lbit(idx))
        aib[idx].first+=v1,aib[idx].second+=v2;
}
long long best_k(int k)
{
    int ret=0,poz=0;
    long long sum=0;
    for(int p=17;p>=0;p--)
        if(poz+(1<<p)<=n&&ret+aib[poz+(1<<p)].first<=k)
        {
            poz+=(1<<p);
            ret+=aib[poz].first;
            sum+=aib[poz].second;
        }
    return sum;
}
int ap[nmax];
void baga(int poz)
{
    ap[poz]++;
    update(act[poz],1,v[poz].second);
}
void scoate(int poz)
{
    ap[poz]--;
    update(act[poz],-1,-v[poz].second);
}
long long get_cost(int l,int r)
{
    if(r-l+1<k) return LLONG_MIN;
    return -2LL*(v[r].first-v[l].first)+1LL*best_k(k);
}
void divide(int st,int dr,int optst,int optdr)
{
    int m=(st+dr)/2,opt=0;
    long long val,mx=LLONG_MIN;
    if(st>dr) return;
    //ne asiguram ca e bagat tot intervalul [optdr+1,st-1] inainte de asta
    for(int i=max(st,optdr+1);i<=m;i++)
        baga(i);
    for(int i=min(optdr,m);i>=optst;i--)
    {
        baga(i);
        val=get_cost(i,m);
        if(val>mx)
            mx=val,opt=i;
        if(val>glob)
            glob=val;
    }
    if(!opt) opt=optst;
    //acum e bagat tot [optst;m]
    for(int i=optst;i<=min(optdr,m);i++)
       scoate(i);
    //acum e bagat [optdr+1;m]
    divide(m+1,dr,opt,optdr);
    for(int i=opt+1;i<=min(optdr,m);i++)
        baga(i);
    //acum e bagat [opt+1;m]
    for(int i=max(st,opt+1);i<=m;i++)
        scoate(i);
    //acum e bagat[opt+1;st-1]
    divide(st,m-1,optst,opt);
    for(i=opt+1;i<=min(optdr,st-1);i++)
        scoate(i);
    //acum e bagat [optdr+1,st-1] din nou
}
int main()
{
    //freopen("data.in","r",stdin);
    ios_base::sync_with_stdio(false);
    cin>>n>>k;
    for(i=1;i<=n;i++)
    {
        cin>>v[i].second>>v[i].first;
    }
    sort(v+1,v+n+1);
    for(i=1;i<=n;i++)
    {
        nrm[i].first=v[i].second;
        nrm[i].second=i;
    }
    sort(nrm+1,nrm+n+1);
    reverse(nrm+1,nrm+n+1);
    for(i=1;i<=n;i++)
        act[nrm[i].second]=i;
    for(i=n-k+2;i<k;i++)
        baga(i);
    divide(k,n,1,n-k+1);
    cout<<glob;
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 380 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 5 ms 504 KB Output is correct
39 Correct 5 ms 504 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 4 ms 504 KB Output is correct
43 Correct 4 ms 480 KB Output is correct
44 Correct 5 ms 504 KB Output is correct
45 Correct 5 ms 480 KB Output is correct
46 Correct 6 ms 504 KB Output is correct
47 Correct 6 ms 560 KB Output is correct
48 Correct 5 ms 504 KB Output is correct
49 Correct 5 ms 504 KB Output is correct
50 Correct 5 ms 504 KB Output is correct
51 Correct 5 ms 504 KB Output is correct
52 Correct 5 ms 504 KB Output is correct
53 Correct 5 ms 504 KB Output is correct
54 Correct 4 ms 504 KB Output is correct
55 Correct 4 ms 504 KB Output is correct
56 Correct 4 ms 504 KB Output is correct
57 Correct 4 ms 504 KB Output is correct
58 Correct 4 ms 504 KB Output is correct
59 Correct 4 ms 504 KB Output is correct
60 Correct 5 ms 504 KB Output is correct
61 Correct 4 ms 504 KB Output is correct
62 Correct 4 ms 504 KB Output is correct
63 Correct 4 ms 504 KB Output is correct
64 Correct 4 ms 504 KB Output is correct
65 Correct 5 ms 504 KB Output is correct
66 Correct 5 ms 504 KB Output is correct
67 Correct 5 ms 504 KB Output is correct
68 Correct 5 ms 504 KB Output is correct
69 Correct 5 ms 504 KB Output is correct
70 Correct 5 ms 504 KB Output is correct
71 Correct 5 ms 504 KB Output is correct
72 Correct 4 ms 504 KB Output is correct
73 Correct 4 ms 504 KB Output is correct
74 Correct 3 ms 508 KB Output is correct
75 Correct 850 ms 11400 KB Output is correct
76 Correct 939 ms 11000 KB Output is correct
77 Correct 696 ms 11356 KB Output is correct
78 Correct 745 ms 11464 KB Output is correct
79 Correct 108 ms 11512 KB Output is correct
80 Correct 155 ms 11128 KB Output is correct
81 Correct 663 ms 10744 KB Output is correct
82 Correct 838 ms 10912 KB Output is correct
83 Correct 781 ms 11132 KB Output is correct
84 Correct 818 ms 11128 KB Output is correct
85 Correct 672 ms 10748 KB Output is correct
86 Correct 408 ms 10360 KB Output is correct
87 Correct 439 ms 10236 KB Output is correct
88 Correct 587 ms 10104 KB Output is correct
89 Correct 567 ms 10716 KB Output is correct
90 Correct 445 ms 11128 KB Output is correct
91 Correct 290 ms 10360 KB Output is correct
92 Correct 301 ms 10360 KB Output is correct
93 Correct 384 ms 10668 KB Output is correct
94 Correct 252 ms 11084 KB Output is correct
95 Correct 426 ms 11236 KB Output is correct
96 Correct 336 ms 10232 KB Output is correct
97 Correct 364 ms 11128 KB Output is correct
98 Correct 366 ms 11100 KB Output is correct
99 Correct 340 ms 11000 KB Output is correct
100 Correct 269 ms 10336 KB Output is correct
101 Correct 281 ms 10392 KB Output is correct
102 Correct 619 ms 10488 KB Output is correct
103 Correct 558 ms 10360 KB Output is correct
104 Correct 638 ms 10744 KB Output is correct
105 Correct 481 ms 10872 KB Output is correct
106 Correct 502 ms 11000 KB Output is correct
107 Correct 438 ms 10872 KB Output is correct
108 Correct 722 ms 11388 KB Output is correct
109 Correct 560 ms 11896 KB Output is correct
110 Correct 382 ms 9976 KB Output is correct
111 Correct 541 ms 10104 KB Output is correct
112 Correct 339 ms 9464 KB Output is correct
113 Correct 113 ms 12024 KB Output is correct