oj.uz

답안 #250322

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250322 2020-07-17T11:51:50 Z errorgorn Cake 3 (JOI19_cake3) C++14
100 / 100
 1223 ms 219808 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

ll MAX(ll a){return a;}
ll MIN(ll a){return a;}
template<typename... Args>
ll MAX(ll a,Args... args){return max(a,MAX(args...));}
template<typename... Args>
ll MIN(ll a,Args... args){return min(a,MIN(args...));}

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,k;
ii arr[200005];
vector<int> uni;
map<int,int> vmap;

struct wavelet{
    vector<int> index; ///indexes inside this segment
    vector<int> val; ///values inside this segment (sorted)
	vector<ll> pref;
    vector<int> l_child;
    vector<int> r_child;
    int _min,_max;
    wavelet *l, *r;
    wavelet(){}

    void init(){
        _min=val.front();
        _max=val.back();
		
		pref.push_back(0);
		rep(x,0,sz(val)) pref.push_back(pref.back()+uni[arr[index[x]].fi]);
		
        if (_min==_max) return; ///dont need to propogate more
        l=new wavelet();
        r=new wavelet();
        int pivot=max(val[val.size()>>1],_min+1);
        l_child.push_back(-1);
        r_child.push_back(-1);
		for (int x=0;x<val.size();x++){
            ///we handle val and index seperately
            if (val[x]<pivot) l->val.push_back(val[x]);
            else r->val.push_back(val[x]);

            if (arr[index[x]].fi<pivot){ //arr stores values of stuff
                l->index.push_back(index[x]);
                l_child.push_back(l_child.back()+1);
                r_child.push_back(r_child.back());
            }
            else {
                r->index.push_back(index[x]);
                l_child.push_back(l_child.back());
                r_child.push_back(r_child.back()+1);
            }
        }
		
		l->init();
        r->init();
    }

    ll query(int i,int j,ll k){
		if (_min==_max) return k*uni[_min];
		
		int len=r_child[j+1]-r_child[i];
		
		if (len<=k) return r->pref[r_child[j+1]+1]-r->pref[r_child[i]+1]+l->query(l_child[i]+1,l_child[j+1],k-len);
		else return r->query(r_child[i]+1,r_child[j+1],k);
    }
}*root=new wavelet();

ll ans=-1e18;

void dp(int l,int r,int optl,int optr){
	if (l>r) return;
	
	int m=l+r>>1;
	int optm=-1;
	
	ll best=-1e18;
	
	rep(x,optl,optr+1) if (x-m+1>=k){
		ll val=2*(arr[m].se-arr[x].se)+uni[arr[m].fi]+uni[arr[x].fi]+root->query(m+1,x-1,k-2);
		
		//cout<<m<<" "<<x<<" "<<val<<endl;
		
		if (val>best){
			best=val;
			optm=x;
		}
	}
	
	ans=max(ans,best);
	dp(l,m-1,optl,optm),dp(m+1,r,optm,optr);
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n>>k;
	rep(x,0,n){
		cin>>arr[x].fi>>arr[x].se;
		uni.push_back(arr[x].fi);
	}
	
	sort(arr,arr+n,[](ii i,ii j){
		return i.se<j.se;
	});
	
	sort(all(uni));
	uni.erase(unique(all(uni)),uni.end());
	
	rep(x,0,sz(uni)){
		vmap[uni[x]]=x;
	}
	
	rep(x,0,n){
		arr[x].fi=vmap[arr[x].fi];
		
		root->index.push_back(x);
		root->val.push_back(arr[x].fi);
	}
	
	sort(all(root->val));
	root->init();
	
	//rep(x,0,n) cout<<uni[arr[x].fi]<<" "; cout<<endl;
	
	dp(0,n-k,0,n-1);
	
	cout<<ans<<endl;
}

Compilation message

cake3.cpp: In member function 'void wavelet::init()':
cake3.cpp:62:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int x=0;x<val.size();x++){
                ~^~~~~~~~~~~
cake3.cpp: In function 'void dp(int, int, int, int)':
cake3.cpp:98:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m=l+r>>1;
        ~^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 6 ms 1996 KB Output is correct
39 Correct 7 ms 2048 KB Output is correct
40 Correct 6 ms 2048 KB Output is correct
41 Correct 6 ms 1920 KB Output is correct
42 Correct 6 ms 2048 KB Output is correct
43 Correct 6 ms 1920 KB Output is correct
44 Correct 7 ms 1920 KB Output is correct
45 Correct 7 ms 2048 KB Output is correct
46 Correct 7 ms 2176 KB Output is correct
47 Correct 6 ms 2048 KB Output is correct
48 Correct 6 ms 1920 KB Output is correct
49 Correct 6 ms 2048 KB Output is correct
50 Correct 7 ms 2048 KB Output is correct
51 Correct 6 ms 2048 KB Output is correct
52 Correct 6 ms 2048 KB Output is correct
53 Correct 6 ms 2048 KB Output is correct
54 Correct 6 ms 2176 KB Output is correct
55 Correct 6 ms 2176 KB Output is correct
56 Correct 5 ms 2048 KB Output is correct
57 Correct 6 ms 2048 KB Output is correct
58 Correct 5 ms 2048 KB Output is correct
59 Correct 1 ms 512 KB Output is correct
60 Correct 2 ms 512 KB Output is correct
61 Correct 1 ms 512 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 2 ms 512 KB Output is correct
64 Correct 1 ms 512 KB Output is correct
65 Correct 6 ms 1920 KB Output is correct
66 Correct 6 ms 1920 KB Output is correct
67 Correct 6 ms 1920 KB Output is correct
68 Correct 6 ms 2048 KB Output is correct
69 Correct 6 ms 1920 KB Output is correct
70 Correct 6 ms 1920 KB Output is correct
71 Correct 2 ms 640 KB Output is correct
72 Correct 2 ms 640 KB Output is correct
73 Correct 7 ms 2048 KB Output is correct
74 Correct 6 ms 2176 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 6 ms 1996 KB Output is correct
39 Correct 7 ms 2048 KB Output is correct
40 Correct 6 ms 2048 KB Output is correct
41 Correct 6 ms 1920 KB Output is correct
42 Correct 6 ms 2048 KB Output is correct
43 Correct 6 ms 1920 KB Output is correct
44 Correct 7 ms 1920 KB Output is correct
45 Correct 7 ms 2048 KB Output is correct
46 Correct 7 ms 2176 KB Output is correct
47 Correct 6 ms 2048 KB Output is correct
48 Correct 6 ms 1920 KB Output is correct
49 Correct 6 ms 2048 KB Output is correct
50 Correct 7 ms 2048 KB Output is correct
51 Correct 6 ms 2048 KB Output is correct
52 Correct 6 ms 2048 KB Output is correct
53 Correct 6 ms 2048 KB Output is correct
54 Correct 6 ms 2176 KB Output is correct
55 Correct 6 ms 2176 KB Output is correct
56 Correct 5 ms 2048 KB Output is correct
57 Correct 6 ms 2048 KB Output is correct
58 Correct 5 ms 2048 KB Output is correct
59 Correct 1 ms 512 KB Output is correct
60 Correct 2 ms 512 KB Output is correct
61 Correct 1 ms 512 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 2 ms 512 KB Output is correct
64 Correct 1 ms 512 KB Output is correct
65 Correct 6 ms 1920 KB Output is correct
66 Correct 6 ms 1920 KB Output is correct
67 Correct 6 ms 1920 KB Output is correct
68 Correct 6 ms 2048 KB Output is correct
69 Correct 6 ms 1920 KB Output is correct
70 Correct 6 ms 1920 KB Output is correct
71 Correct 2 ms 640 KB Output is correct
72 Correct 2 ms 640 KB Output is correct
73 Correct 7 ms 2048 KB Output is correct
74 Correct 6 ms 2176 KB Output is correct
75 Correct 1148 ms 208660 KB Output is correct
76 Correct 1200 ms 204568 KB Output is correct
77 Correct 1024 ms 209036 KB Output is correct
78 Correct 1223 ms 211200 KB Output is correct
79 Correct 690 ms 212164 KB Output is correct
80 Correct 645 ms 207660 KB Output is correct
81 Correct 527 ms 108384 KB Output is correct
82 Correct 744 ms 122712 KB Output is correct
83 Correct 616 ms 114180 KB Output is correct
84 Correct 618 ms 116244 KB Output is correct
85 Correct 557 ms 109384 KB Output is correct
86 Correct 397 ms 99724 KB Output is correct
87 Correct 402 ms 100500 KB Output is correct
88 Correct 526 ms 105648 KB Output is correct
89 Correct 482 ms 104344 KB Output is correct
90 Correct 420 ms 102188 KB Output is correct
91 Correct 356 ms 95884 KB Output is correct
92 Correct 373 ms 96088 KB Output is correct
93 Correct 366 ms 98832 KB Output is correct
94 Correct 352 ms 96960 KB Output is correct
95 Correct 409 ms 101652 KB Output is correct
96 Correct 79 ms 10396 KB Output is correct
97 Correct 81 ms 11012 KB Output is correct
98 Correct 78 ms 10776 KB Output is correct
99 Correct 78 ms 10904 KB Output is correct
100 Correct 73 ms 10388 KB Output is correct
101 Correct 71 ms 10392 KB Output is correct
102 Correct 321 ms 77332 KB Output is correct
103 Correct 303 ms 76304 KB Output is correct
104 Correct 351 ms 81680 KB Output is correct
105 Correct 283 ms 74388 KB Output is correct
106 Correct 312 ms 75540 KB Output is correct
107 Correct 267 ms 72704 KB Output is correct
108 Correct 1123 ms 210320 KB Output is correct
109 Correct 1144 ms 219596 KB Output is correct
110 Correct 109 ms 27024 KB Output is correct
111 Correct 122 ms 27536 KB Output is correct
112 Correct 1171 ms 202676 KB Output is correct
113 Correct 825 ms 219808 KB Output is correct