oj.uz

Submission #79070

# Submission time Handle Problem Language Result Execution time Memory
79070 2018-10-11T03:00:52 Z gs14004 Meetings (IOI18_meetings) C++17
60 / 100
 5500 ms 162180 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);
	}
}

struct tree_cht{
	struct queries{
		int s, e, x;
	};
	int par[MAXN];
	int a[MAXN]; lint b[MAXN];
	vector<queries> query;
	void build(int n, int *p, node *t, lint *intercept){
		for(int i=1; i<=n; i++){
			par[i] = p[i-1] + 1;
			a[i] = t[i-1].h;
			b[i] = intercept[i-1];
		}
	}
	void add_query(int s, int e, int x){
		query.push_back({s + 1, e + 1, x});
	}
	vector<lint> batch(){
		vector<lint> ret;
		for(auto &i : query){
			lint val = 1e18;
			int s = i.s, e = i.e;
			while(s != e){
				val = min(val, 1ll * a[s] * i.x + b[s]);
				s = par[s];
			}
			ret.push_back(val);
		}
		return ret;
	}
}t1, t2;

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]);
		}
	}
	t1.build(ptr + 1, parL, tr, L_intercept);
	t2.build(ptr + 1, parR, tr, R_intercept);
	vector<pi> lca(q);
	for(int i=0; i<q; i++){
		lca[i] = seg.query(L[i], R[i]);
		t1.add_query(loc[L[i]], loc[lca[i].second], -L[i]);
		t2.add_query(loc[R[i]], loc[lca[i].second], R[i]);
	}
	auto sol1 = t1.batch();
	auto sol2 = t2.batch();
	vector<lint> ret(q);
	for(int i=0; i<q; i++){
		pi p = lca[i];
		int root_num = loc[p.second]; 
		ret[i] = 1ll * (R[i] - L[i] + 1) * p.first;
		if(L[i] < p.second){
			ret[i] = min(ret[i], sol1[i] + 1ll * (R[i] - p.second + 1) * p.first - lgo[tr[root_num].lp]);
		}
		if(p.second < R[i]){
			ret[i] = min(ret[i], sol2[i] + 1ll * (p.second - L[i] + 1) * p.first - rgo[tr[root_num].rp]);
		}
	}
	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 19 ms 16916 KB Output is correct
2 Correct 20 ms 17272 KB Output is correct
3 Correct 19 ms 17272 KB Output is correct
4 Correct 19 ms 17268 KB Output is correct
5 Correct 19 ms 17244 KB Output is correct
6 Correct 20 ms 17320 KB Output is correct
7 Correct 19 ms 17224 KB Output is correct
8 Correct 19 ms 17344 KB Output is correct
9 Correct 20 ms 17304 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16916 KB Output is correct
2 Correct 20 ms 17272 KB Output is correct
3 Correct 19 ms 17272 KB Output is correct
4 Correct 19 ms 17268 KB Output is correct
5 Correct 19 ms 17244 KB Output is correct
6 Correct 20 ms 17320 KB Output is correct
7 Correct 19 ms 17224 KB Output is correct
8 Correct 19 ms 17344 KB Output is correct
9 Correct 20 ms 17304 KB Output is correct
10 Correct 24 ms 18040 KB Output is correct
11 Correct 23 ms 18048 KB Output is correct
12 Correct 24 ms 17964 KB Output is correct
13 Correct 24 ms 18072 KB Output is correct
14 Correct 33 ms 18172 KB Output is correct
15 Correct 24 ms 17988 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16832 KB Output is correct
2 Correct 199 ms 22016 KB Output is correct
3 Correct 3840 ms 39136 KB Output is correct
4 Correct 226 ms 36008 KB Output is correct
5 Correct 108 ms 39108 KB Output is correct
6 Correct 237 ms 39496 KB Output is correct
7 Correct 4777 ms 40636 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16832 KB Output is correct
2 Correct 199 ms 22016 KB Output is correct
3 Correct 3840 ms 39136 KB Output is correct
4 Correct 226 ms 36008 KB Output is correct
5 Correct 108 ms 39108 KB Output is correct
6 Correct 237 ms 39496 KB Output is correct
7 Correct 4777 ms 40636 KB Output is correct
8 Correct 524 ms 36252 KB Output is correct
9 Correct 1240 ms 36252 KB Output is correct
10 Correct 134 ms 36300 KB Output is correct
11 Correct 157 ms 36044 KB Output is correct
12 Correct 177 ms 35936 KB Output is correct
13 Correct 132 ms 36032 KB Output is correct
14 Correct 3821 ms 39108 KB Output is correct
15 Correct 128 ms 36016 KB Output is correct
16 Correct 2285 ms 39220 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16916 KB Output is correct
2 Correct 20 ms 17272 KB Output is correct
3 Correct 19 ms 17272 KB Output is correct
4 Correct 19 ms 17268 KB Output is correct
5 Correct 19 ms 17244 KB Output is correct
6 Correct 20 ms 17320 KB Output is correct
7 Correct 19 ms 17224 KB Output is correct
8 Correct 19 ms 17344 KB Output is correct
9 Correct 20 ms 17304 KB Output is correct
10 Correct 24 ms 18040 KB Output is correct
11 Correct 23 ms 18048 KB Output is correct
12 Correct 24 ms 17964 KB Output is correct
13 Correct 24 ms 18072 KB Output is correct
14 Correct 33 ms 18172 KB Output is correct
15 Correct 24 ms 17988 KB Output is correct
16 Correct 19 ms 16832 KB Output is correct
17 Correct 199 ms 22016 KB Output is correct
18 Correct 3840 ms 39136 KB Output is correct
19 Correct 226 ms 36008 KB Output is correct
20 Correct 108 ms 39108 KB Output is correct
21 Correct 237 ms 39496 KB Output is correct
22 Correct 4777 ms 40636 KB Output is correct
23 Correct 524 ms 36252 KB Output is correct
24 Correct 1240 ms 36252 KB Output is correct
25 Correct 134 ms 36300 KB Output is correct
26 Correct 157 ms 36044 KB Output is correct
27 Correct 177 ms 35936 KB Output is correct
28 Correct 132 ms 36032 KB Output is correct
29 Correct 3821 ms 39108 KB Output is correct
30 Correct 128 ms 36016 KB Output is correct
31 Correct 2285 ms 39220 KB Output is correct
32 Correct 1289 ms 157504 KB Output is correct
33 Correct 901 ms 157508 KB Output is correct
34 Correct 1101 ms 157488 KB Output is correct
35 Correct 2173 ms 157588 KB Output is correct
36 Correct 3427 ms 157628 KB Output is correct
37 Correct 1060 ms 157636 KB Output is correct
38 Execution timed out 5544 ms 162180 KB Time limit exceeded
39 Halted 0 ms 0 KB -