oj.uz

Submission #675638

# Submission time Handle Problem Language Result Execution time Memory
675638 2022-12-27T14:12:03 Z urosk Cake 3 (JOI19_cake3) C++14
100 / 100
 873 ms 158872 KB 
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
//using namespace __gnu_pbds;
/*
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}
*/
#define maxn 200005
#define maxx 8000005
ll n,m;
pll a[maxn];
ll b[maxn];
pll t[maxx];
ll root[maxx],ls[maxx],rs[maxx];
ll dp[maxn];
ll tsz = 1;
pll add(pll x,pll y){return {x.fi+y.fi,x.sc+y.sc};}
void upd(ll v,ll rv,ll tl,ll tr,ll i,pll p){
    if(tl==tr){t[v] = p;return;}
    ll mid = (tl+tr)/2;
    if(i<=mid){
        rs[v] = rs[rv];
        ls[v] = ++tsz;
        upd(ls[v],ls[rv],tl,mid,i,p);
    }else{
        ls[v] = ls[rv];
        rs[v] = ++tsz;
        upd(rs[v],rs[rv],mid+1,tr,i,p);
    }
    t[v] = add(t[ls[v]],t[rs[v]]);
}
ll get(ll v,ll rv,ll tl,ll tr,ll k){
    if(k==0) return 0;
    if(tl==tr) return t[v].fi-t[rv].fi;
    if(t[v].sc-t[rv].sc<=k) return t[v].fi-t[rv].fi;
    ll mid = (tl+tr)/2;
    ll cnt = t[rs[v]].sc-t[rs[rv]].sc;
    ll sum = t[rs[v]].fi-t[rs[rv]].fi;
    if(cnt>k) return get(rs[v],rs[rv],mid+1,tr,k);
    else return get(ls[v],ls[rv],tl,mid,k-cnt) + sum;
}
void init(ll v,ll tl,ll tr){
    if(tl==tr) return;
    ll mid = (tl+tr)/2;
    ls[v] = ++tsz,rs[v] = ++tsz;
    init(ls[v],tl,mid);
    init(rs[v],mid+1,tr);
}
void reshi(ll tl,ll tr,ll optl,ll optr){
    if(tl>tr) return;
    ll mid = (tl+tr)/2;
    ll opt = -1;
    for(ll i = max(mid+m-1,optl);i<=optr;i++){
        if(i-mid+1<m) continue;
        ll cur = get(root[i-1],root[mid],1,n,m-2);
        cur += a[i].sc+a[mid].sc-2*(a[i].fi-a[mid].fi);
        if(cur>=dp[mid]){
            dp[mid] = cur;
            opt = i;
        }
    }
    if(opt!=-1){
        reshi(tl,mid-1,optl,opt);
        reshi(mid+1,tr,opt,optr);
    }else{
        reshi(tl,mid-1,optl,optr);
        reshi(mid+1,tr,optl,optr);
    }
}
bool cmp(pll x,pll y){return x.sc<y.sc;}
map<pll,ll> mp;
set<pll> s;
void tc(){
    cin >> n >> m;
    for(ll i = 1;i<=n;i++) cin >> a[i].sc >> a[i].fi;
    sort(a+1,a+1+n);
    ll it = 0;
    for(ll i = 1;i<=n;i++) s.insert({a[i].sc,i});
    for(pll x : s) mp[x] = ++it;
    init(1,1,n);
    root[0] = 1;
    for(ll i = 1;i<=n;i++){
        root[i] = ++tsz;
        upd(root[i],root[i-1],1,n,mp[{a[i].sc,i}],{a[i].sc,1});
    }
    for(ll i = 1;i<=n;i++) dp[i] = -llinf;
    reshi(1,n,1,n);
    ll ans = -llinf;
    for(ll i = 1;i<=n;i++) ans = max(ans,dp[i]);
    cout<<ans<<endl;
}
int main(){
	daj_mi_malo_vremena
    int t; t = 1;
    while(t--){
        tc();
    }
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 376 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 1392 KB Output is correct
39 Correct 3 ms 1364 KB Output is correct
40 Correct 3 ms 1364 KB Output is correct
41 Correct 2 ms 1364 KB Output is correct
42 Correct 3 ms 1364 KB Output is correct
43 Correct 2 ms 1236 KB Output is correct
44 Correct 3 ms 1364 KB Output is correct
45 Correct 3 ms 1364 KB Output is correct
46 Correct 3 ms 1364 KB Output is correct
47 Correct 3 ms 1364 KB Output is correct
48 Correct 3 ms 1364 KB Output is correct
49 Correct 3 ms 1364 KB Output is correct
50 Correct 3 ms 1364 KB Output is correct
51 Correct 3 ms 1364 KB Output is correct
52 Correct 3 ms 1364 KB Output is correct
53 Correct 3 ms 1364 KB Output is correct
54 Correct 2 ms 1364 KB Output is correct
55 Correct 2 ms 1364 KB Output is correct
56 Correct 2 ms 1364 KB Output is correct
57 Correct 2 ms 1364 KB Output is correct
58 Correct 2 ms 1364 KB Output is correct
59 Correct 3 ms 1364 KB Output is correct
60 Correct 3 ms 1364 KB Output is correct
61 Correct 2 ms 1364 KB Output is correct
62 Correct 2 ms 1364 KB Output is correct
63 Correct 3 ms 1364 KB Output is correct
64 Correct 2 ms 1364 KB Output is correct
65 Correct 3 ms 1364 KB Output is correct
66 Correct 3 ms 1364 KB Output is correct
67 Correct 3 ms 1364 KB Output is correct
68 Correct 3 ms 1364 KB Output is correct
69 Correct 3 ms 1364 KB Output is correct
70 Correct 3 ms 1364 KB Output is correct
71 Correct 2 ms 1364 KB Output is correct
72 Correct 2 ms 1364 KB Output is correct
73 Correct 3 ms 1364 KB Output is correct
74 Correct 2 ms 1364 KB Output is correct
75 Correct 835 ms 143808 KB Output is correct
76 Correct 856 ms 139740 KB Output is correct
77 Correct 832 ms 144036 KB Output is correct
78 Correct 798 ms 146344 KB Output is correct
79 Correct 493 ms 147028 KB Output is correct
80 Correct 492 ms 145996 KB Output is correct
81 Correct 728 ms 148508 KB Output is correct
82 Correct 844 ms 150512 KB Output is correct
83 Correct 811 ms 155596 KB Output is correct
84 Correct 873 ms 155136 KB Output is correct
85 Correct 741 ms 149696 KB Output is correct
86 Correct 570 ms 144384 KB Output is correct
87 Correct 555 ms 142412 KB Output is correct
88 Correct 667 ms 141508 KB Output is correct
89 Correct 685 ms 149760 KB Output is correct
90 Correct 610 ms 157028 KB Output is correct
91 Correct 521 ms 144712 KB Output is correct
92 Correct 507 ms 143356 KB Output is correct
93 Correct 569 ms 149836 KB Output is correct
94 Correct 542 ms 156772 KB Output is correct
95 Correct 642 ms 157104 KB Output is correct
96 Correct 438 ms 145316 KB Output is correct
97 Correct 431 ms 157460 KB Output is correct
98 Correct 426 ms 155028 KB Output is correct
99 Correct 417 ms 155376 KB Output is correct
100 Correct 361 ms 146084 KB Output is correct
101 Correct 370 ms 146100 KB Output is correct
102 Correct 603 ms 146188 KB Output is correct
103 Correct 562 ms 144032 KB Output is correct
104 Correct 623 ms 152336 KB Output is correct
105 Correct 584 ms 151868 KB Output is correct
106 Correct 543 ms 155876 KB Output is correct
107 Correct 481 ms 150184 KB Output is correct
108 Correct 775 ms 149184 KB Output is correct
109 Correct 754 ms 158540 KB Output is correct
110 Correct 323 ms 146548 KB Output is correct
111 Correct 400 ms 148228 KB Output is correct
112 Correct 545 ms 141176 KB Output is correct
113 Correct 544 ms 158872 KB Output is correct