oj.uz

Submission #710279

# Submission time Handle Problem Language Result Execution time Memory
710279 2023-03-15T06:36:46 Z Darren0724 Cake 3 (JOI19_cake3) C++17
100 / 100
 1037 ms 242248 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
#define x first
#define y second
const long long INF=1e18;
const int N=200005;
int n,m;
int cnta=0;
vector<int> lisan;
vector<pair<int,int>> v;
struct seg{
    int l,m,r;
    seg *lc,*rc;
    long long cnt=0,total=0;
    seg(int l1,int r1){
        l=l1,r=r1;
        m=(l+r)>>1;
        lc=rc=NULL;
        cnta++;
    }
    void pull(){
        cnt=0;
        total=0;
        if(lc){
            cnt+=lc->cnt;
            total+=lc->total;
        }
        if(rc){
            cnt+=rc->cnt;
            total+=rc->total;
        }
    }
    void add(int p){
        if(r-l==1){
            cnt++;
            total+=lisan[p];
            return;
        }
        m=(l+r)>>1;
        if(p<m){
            lc=(lc?new seg(*lc):new seg(l,m));
            lc->add(p);
        }
        else{
            rc=(rc?new seg(*rc):new seg(m,r));
            rc->add(p);
        }
        pull();
    }
};
vector<seg*> tr;
long long total(seg* s){
    return s?s->total:0;
}
int cnt(seg* s){
    return s?s->cnt:0;
}
seg* lc(seg* s){
    return s?s->lc:NULL;
}
seg* rc(seg* s){
    return s?s->rc:NULL;
}
long long ask(seg* a,seg* b,int need,int l,int r){
    //cout<<l<<' '<<r<<endl;
    if(r-l==1){
        return (need>cnt(b)-cnt(a)?-INF:need*lisan[l]);
    }
    int m=(l+r)>>1;
    if(cnt(rc(b))-cnt(rc(a))>=need){
        return ask(rc(a),rc(b),need,m,r);
    }
    else{
        return total(rc(b))-total(rc(a))+ask(lc(a),lc(b),need-cnt(rc(b))+cnt(rc(a)),l,m);
    }
}
long long ans1=-INF;
void dc(int l,int r,int a,int b){
    //cout<<l<<' '<<r<<endl;
    if(l>=r){
        return;
    }
    pair<long long,int> p={-INF,-1};
    int m1=(l+r)>>1;
    for(int i=a;i<=min(b,m1-1);i++){
        p=max(p,{ask(tr[i],tr[m1],m,0,N)-(v[m1].x-v[i+1].x)*2,i});
        //cout<<m1<<' '<<i<<endl;
    }
    ans1=max(ans1,p.first);
    dc(l,m1,a,p.second);
    dc(m1+1,r,p.second,b);
}
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    v.resize(n+1);
    for(int i=1;i<=n;i++){
        cin>>v[i].y>>v[i].x;
        //v[i].x=100+i*5720;
        //v[i].y=100019+i*2729;
        //lisan.push_back(v[i].x);
        lisan.push_back(v[i].y);
    }
    sort(all(lisan));
    lisan.resize(unique(all(lisan))-lisan.begin());
    for(int i=1;i<=n;i++){
        v[i].y=lower_bound(all(lisan),v[i].y)-lisan.begin();
    }
    sort(v.begin(),v.end());
    tr.resize(n+1);
    tr[0]=new seg(0,N);
    for(int i=1;i<=n;i++){
        tr[i]=new seg(*tr[i-1]);
        tr[i]->add(v[i].y);
    }
    int idx=0;
    dc(m,n+1,0,n);
    cout<<ans1<<endl;
    //cout<<cnta<<endl;

    return 0;
}

Compilation message

cake3.cpp: In function 'int32_t main()':
cake3.cpp:118:9: warning: unused variable 'idx' [-Wunused-variable]
  118 |     int idx=0;
      |         ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 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 320 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 320 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 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 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 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 320 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 320 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 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 5 ms 2516 KB Output is correct
39 Correct 6 ms 2704 KB Output is correct
40 Correct 5 ms 2516 KB Output is correct
41 Correct 6 ms 2516 KB Output is correct
42 Correct 4 ms 2644 KB Output is correct
43 Correct 5 ms 2416 KB Output is correct
44 Correct 6 ms 2516 KB Output is correct
45 Correct 6 ms 2552 KB Output is correct
46 Correct 5 ms 2628 KB Output is correct
47 Correct 7 ms 2516 KB Output is correct
48 Correct 6 ms 2504 KB Output is correct
49 Correct 5 ms 2644 KB Output is correct
50 Correct 5 ms 2644 KB Output is correct
51 Correct 6 ms 2644 KB Output is correct
52 Correct 5 ms 2508 KB Output is correct
53 Correct 6 ms 2552 KB Output is correct
54 Correct 5 ms 2644 KB Output is correct
55 Correct 5 ms 2516 KB Output is correct
56 Correct 5 ms 2516 KB Output is correct
57 Correct 5 ms 2516 KB Output is correct
58 Correct 5 ms 2516 KB Output is correct
59 Correct 5 ms 2388 KB Output is correct
60 Correct 5 ms 2516 KB Output is correct
61 Correct 5 ms 2544 KB Output is correct
62 Correct 5 ms 2516 KB Output is correct
63 Correct 5 ms 2644 KB Output is correct
64 Correct 5 ms 2516 KB Output is correct
65 Correct 5 ms 2516 KB Output is correct
66 Correct 5 ms 2516 KB Output is correct
67 Correct 5 ms 2644 KB Output is correct
68 Correct 5 ms 2644 KB Output is correct
69 Correct 5 ms 2516 KB Output is correct
70 Correct 5 ms 2644 KB Output is correct
71 Correct 5 ms 2516 KB Output is correct
72 Correct 5 ms 2644 KB Output is correct
73 Correct 5 ms 2516 KB Output is correct
74 Correct 4 ms 2684 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 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 320 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 320 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 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 5 ms 2516 KB Output is correct
39 Correct 6 ms 2704 KB Output is correct
40 Correct 5 ms 2516 KB Output is correct
41 Correct 6 ms 2516 KB Output is correct
42 Correct 4 ms 2644 KB Output is correct
43 Correct 5 ms 2416 KB Output is correct
44 Correct 6 ms 2516 KB Output is correct
45 Correct 6 ms 2552 KB Output is correct
46 Correct 5 ms 2628 KB Output is correct
47 Correct 7 ms 2516 KB Output is correct
48 Correct 6 ms 2504 KB Output is correct
49 Correct 5 ms 2644 KB Output is correct
50 Correct 5 ms 2644 KB Output is correct
51 Correct 6 ms 2644 KB Output is correct
52 Correct 5 ms 2508 KB Output is correct
53 Correct 6 ms 2552 KB Output is correct
54 Correct 5 ms 2644 KB Output is correct
55 Correct 5 ms 2516 KB Output is correct
56 Correct 5 ms 2516 KB Output is correct
57 Correct 5 ms 2516 KB Output is correct
58 Correct 5 ms 2516 KB Output is correct
59 Correct 5 ms 2388 KB Output is correct
60 Correct 5 ms 2516 KB Output is correct
61 Correct 5 ms 2544 KB Output is correct
62 Correct 5 ms 2516 KB Output is correct
63 Correct 5 ms 2644 KB Output is correct
64 Correct 5 ms 2516 KB Output is correct
65 Correct 5 ms 2516 KB Output is correct
66 Correct 5 ms 2516 KB Output is correct
67 Correct 5 ms 2644 KB Output is correct
68 Correct 5 ms 2644 KB Output is correct
69 Correct 5 ms 2516 KB Output is correct
70 Correct 5 ms 2644 KB Output is correct
71 Correct 5 ms 2516 KB Output is correct
72 Correct 5 ms 2644 KB Output is correct
73 Correct 5 ms 2516 KB Output is correct
74 Correct 4 ms 2684 KB Output is correct
75 Correct 1035 ms 222300 KB Output is correct
76 Correct 1031 ms 219464 KB Output is correct
77 Correct 1004 ms 226104 KB Output is correct
78 Correct 1018 ms 229516 KB Output is correct
79 Correct 646 ms 230340 KB Output is correct
80 Correct 815 ms 223748 KB Output is correct
81 Correct 833 ms 227388 KB Output is correct
82 Correct 896 ms 230600 KB Output is correct
83 Correct 876 ms 237988 KB Output is correct
84 Correct 881 ms 237512 KB Output is correct
85 Correct 833 ms 229248 KB Output is correct
86 Correct 803 ms 221640 KB Output is correct
87 Correct 807 ms 218696 KB Output is correct
88 Correct 777 ms 217228 KB Output is correct
89 Correct 838 ms 229348 KB Output is correct
90 Correct 877 ms 239832 KB Output is correct
91 Correct 815 ms 221876 KB Output is correct
92 Correct 794 ms 220220 KB Output is correct
93 Correct 857 ms 229640 KB Output is correct
94 Correct 911 ms 239792 KB Output is correct
95 Correct 884 ms 240024 KB Output is correct
96 Correct 526 ms 215168 KB Output is correct
97 Correct 562 ms 232032 KB Output is correct
98 Correct 592 ms 228600 KB Output is correct
99 Correct 560 ms 229084 KB Output is correct
100 Correct 518 ms 216168 KB Output is correct
101 Correct 544 ms 216084 KB Output is correct
102 Correct 865 ms 224448 KB Output is correct
103 Correct 814 ms 221056 KB Output is correct
104 Correct 895 ms 233228 KB Output is correct
105 Correct 885 ms 232588 KB Output is correct
106 Correct 851 ms 238312 KB Output is correct
107 Correct 792 ms 230132 KB Output is correct
108 Correct 1008 ms 228360 KB Output is correct
109 Correct 1037 ms 241832 KB Output is correct
110 Correct 534 ms 223992 KB Output is correct
111 Correct 546 ms 226376 KB Output is correct
112 Correct 612 ms 217304 KB Output is correct
113 Correct 409 ms 242248 KB Output is correct