oj.uz

Submission #79032

# Submission time Handle Problem Language Result Execution time Memory
79032 2018-10-10T17:28:46 Z gs14004 Meetings (IOI18_meetings) C++17
60 / 100
 5500 ms 119468 KB 
#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 750005;
const int MAXT = 2100000;
const int inf = 1e9 + 10;

struct seg{
	int lim;
	pi tree[MAXT];
	void init(vector<int> &v){
		for(lim = 1; lim <= v.size(); lim <<= 1);
		fill(tree, tree + MAXT, pi(-1e9, 0));
		for(int i=0; i<v.size(); i++) tree[i + lim] = pi(v[i], i);
		for(int i=lim-1; i; i--) tree[i] = max(tree[2*i], tree[2*i+1]);
	}
	pi query(int s, int e){
		s += lim;
		e += lim;
		pi ret(-1e9, 0);
		while(s < e){
			if(s%2 == 1) ret = max(ret, tree[s++]);
			if(e%2 == 0) ret = max(ret, tree[e--]);
			s >>= 1;
			e >>= 1;
		}
		if(s == e) ret = max(ret, tree[s]);
		return ret;
	}
}seg;

struct node{
	int s, e, rep; // node range
	int lp, rp; // pointers
	int h; // height
}tr[MAXN];

int ptr, loc[MAXN], parL[MAXN], parR[MAXN];
lint dp[MAXN], lgo[MAXN], rgo[MAXN];
lint L_intercept[MAXN], R_intercept[MAXN];

void make_tree(int s, int e, int v){
	int h, m;
	tie(h, m) = seg.query(s, e);
	loc[m] = v;
	tr[v] = {s, e, m, -1, -1, h};
	if(s <= m - 1){
		ptr++;
		tr[v].lp = ptr;
		make_tree(s, m-1, tr[v].lp);
	}
	if(m + 1 <= e){
		ptr++;
		tr[v].rp = ptr;
		make_tree(m+1, e, tr[v].rp);
	}
}

lint go_left(int pos, int root){
	int L = pos;
	int v = loc[pos];
	root = loc[root];
	lint ret = 1e18;
	while(v != root){
		ret = min(ret, 1ll * tr[v].h * -L + L_intercept[v]);
		v = parL[v];
	}
	ret -= lgo[tr[root].lp];
//	printf("go_left %d -> %d = %lld\n", L, root, ret);
	return ret;
}

lint go_right(int pos, int root){
	int R = pos;
	int v = loc[pos];
	root = loc[root];
	lint ret = 1e18;
	while(v != root){
		ret = min(ret, 1ll * tr[v].h * R + R_intercept[v]);
		v = parR[v];
	}
	ret -= rgo[tr[root].rp];
//	printf("go_right %d -> %d = %lld\n", R, root, ret);
	return ret;
}

vector<lint> minimum_costs(vector<int> H, vector<int> L, vector<int> R){
	int n = H.size();
	int q = L.size();
	seg.init(H);
	make_tree(0, n-1, 0);
	for(int i=ptr; i>=0; i--){
		dp[i] = 1ll * H[tr[i].rep] * (tr[i].e - tr[i].s + 1);
		if(~tr[i].lp){
			dp[i] = min(dp[i], dp[tr[i].lp] + 1ll * H[tr[i].rep] * (tr[i].e - tr[i].rep + 1));
		}
		if(~tr[i].rp){
			dp[i] = min(dp[i], dp[tr[i].rp] + 1ll * H[tr[i].rep] * (tr[i].rep - tr[i].s + 1));
		}
	}
	for(int i=0; i<=ptr; i++){
		if(tr[i].s - 1 >= 0) parR[i] = loc[tr[i].s - 1];
		else parR[i] = -1;
		if(tr[i].e + 1 < n) parL[i] = loc[tr[i].e + 1];
		else parL[i] = -1;
		if(~tr[i].lp){
			lgo[tr[i].lp] = lgo[i] + 1ll * H[tr[i].rep] * (tr[i].e - tr[i].rep + 1);
			rgo[tr[i].lp] = rgo[i];
		}
		if(~tr[i].rp){
			lgo[tr[i].rp] = lgo[i];
			rgo[tr[i].rp] = rgo[i] + 1ll * H[tr[i].rep] * (tr[i].rep - tr[i].s + 1);
		}
		L_intercept[i] = lgo[i] + 1ll * tr[i].h * (tr[i].e + 1);
		if(~tr[i].rp){
			L_intercept[i] = min(L_intercept[i], lgo[i] + 1ll * tr[i].h * (tr[i].rep + 1) + dp[tr[i].rp]);
		}
		R_intercept[i] = rgo[i] + 1ll * tr[i].h * (1 - tr[i].s);
		if(~tr[i].lp){
			R_intercept[i] = min(R_intercept[i], rgo[i] + 1ll * tr[i].h * (1 - tr[i].rep) + dp[tr[i].lp]);
		}
	}
	vector<lint> ret(q);
	for(int i=0; i<q; i++){
		pi p = seg.query(L[i], R[i]);
		ret[i] = min({1ll * (R[i] - L[i] + 1) * p.first, 
			go_left(L[i], p.second) + 1ll * (R[i] - p.second + 1) * p.first, 
			go_right(R[i], p.second) + 1ll * (p.second - L[i] + 1) * p.first});
	}
	return ret;
}

Compilation message

meetings.cpp: In member function 'void seg::init(std::vector<int>&)':
meetings.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(lim = 1; lim <= v.size(); lim <<= 1);
                ~~~~^~~~~~~~~~~
meetings.cpp:16:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<v.size(); i++) tree[i + lim] = pi(v[i], i);
                ~^~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16860 KB Output is correct
2 Correct 19 ms 17104 KB Output is correct
3 Correct 19 ms 17144 KB Output is correct
4 Correct 19 ms 17116 KB Output is correct
5 Correct 19 ms 17124 KB Output is correct
6 Correct 19 ms 17144 KB Output is correct
7 Correct 19 ms 17116 KB Output is correct
8 Correct 19 ms 17172 KB Output is correct
9 Correct 19 ms 17144 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16860 KB Output is correct
2 Correct 19 ms 17104 KB Output is correct
3 Correct 19 ms 17144 KB Output is correct
4 Correct 19 ms 17116 KB Output is correct
5 Correct 19 ms 17124 KB Output is correct
6 Correct 19 ms 17144 KB Output is correct
7 Correct 19 ms 17116 KB Output is correct
8 Correct 19 ms 17172 KB Output is correct
9 Correct 19 ms 17144 KB Output is correct
10 Correct 23 ms 17372 KB Output is correct
11 Correct 23 ms 17372 KB Output is correct
12 Correct 24 ms 17336 KB Output is correct
13 Correct 23 ms 17400 KB Output is correct
14 Correct 32 ms 17552 KB Output is correct
15 Correct 22 ms 17372 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16752 KB Output is correct
2 Correct 199 ms 18944 KB Output is correct
3 Correct 3972 ms 30580 KB Output is correct
4 Correct 233 ms 27472 KB Output is correct
5 Correct 98 ms 30456 KB Output is correct
6 Correct 242 ms 30920 KB Output is correct
7 Correct 4908 ms 32148 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16752 KB Output is correct
2 Correct 199 ms 18944 KB Output is correct
3 Correct 3972 ms 30580 KB Output is correct
4 Correct 233 ms 27472 KB Output is correct
5 Correct 98 ms 30456 KB Output is correct
6 Correct 242 ms 30920 KB Output is correct
7 Correct 4908 ms 32148 KB Output is correct
8 Correct 552 ms 27764 KB Output is correct
9 Correct 1245 ms 27740 KB Output is correct
10 Correct 134 ms 27712 KB Output is correct
11 Correct 170 ms 27452 KB Output is correct
12 Correct 163 ms 27344 KB Output is correct
13 Correct 130 ms 27448 KB Output is correct
14 Correct 4080 ms 30500 KB Output is correct
15 Correct 129 ms 27352 KB Output is correct
16 Correct 2410 ms 30656 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16860 KB Output is correct
2 Correct 19 ms 17104 KB Output is correct
3 Correct 19 ms 17144 KB Output is correct
4 Correct 19 ms 17116 KB Output is correct
5 Correct 19 ms 17124 KB Output is correct
6 Correct 19 ms 17144 KB Output is correct
7 Correct 19 ms 17116 KB Output is correct
8 Correct 19 ms 17172 KB Output is correct
9 Correct 19 ms 17144 KB Output is correct
10 Correct 23 ms 17372 KB Output is correct
11 Correct 23 ms 17372 KB Output is correct
12 Correct 24 ms 17336 KB Output is correct
13 Correct 23 ms 17400 KB Output is correct
14 Correct 32 ms 17552 KB Output is correct
15 Correct 22 ms 17372 KB Output is correct
16 Correct 18 ms 16752 KB Output is correct
17 Correct 199 ms 18944 KB Output is correct
18 Correct 3972 ms 30580 KB Output is correct
19 Correct 233 ms 27472 KB Output is correct
20 Correct 98 ms 30456 KB Output is correct
21 Correct 242 ms 30920 KB Output is correct
22 Correct 4908 ms 32148 KB Output is correct
23 Correct 552 ms 27764 KB Output is correct
24 Correct 1245 ms 27740 KB Output is correct
25 Correct 134 ms 27712 KB Output is correct
26 Correct 170 ms 27452 KB Output is correct
27 Correct 163 ms 27344 KB Output is correct
28 Correct 130 ms 27448 KB Output is correct
29 Correct 4080 ms 30500 KB Output is correct
30 Correct 129 ms 27352 KB Output is correct
31 Correct 2410 ms 30656 KB Output is correct
32 Correct 1719 ms 99000 KB Output is correct
33 Correct 827 ms 99260 KB Output is correct
34 Correct 1347 ms 96956 KB Output is correct
35 Correct 2553 ms 99136 KB Output is correct
36 Correct 3459 ms 99276 KB Output is correct
37 Correct 1332 ms 97016 KB Output is correct
38 Execution timed out 5566 ms 119468 KB Time limit exceeded
39 Halted 0 ms 0 KB -