oj.uz

Submission #210193

# Submission time Handle Problem Language Result Execution time Memory
210193 2020-03-16T19:41:12 Z hanagasumi Long Distance Coach (JOI17_coach) C++17
71 / 100
 2000 ms 144984 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <chrono>

#define ft first
#define sc second
#define pb push_back
#define len(v) (int)v.size()
#define int ll

using namespace std;
typedef long long ll;
typedef long double ld;

int inf = (1LL << 45);
const int N = (1 << 18);

struct line {	
	int k, b;
	int get(int x) {
		return k * x + b;
	}
	bool operator < (const line& x) const {
		return k < x.k;
	}
};

struct node {
	node* l;
	node* r;
	line now;
	node(node* _l, node* _r, line _now) : l(_l), r(_r), now(_now) {}
};


struct lichao {
	node* v;
	lichao() {
		v = new node(NULL, NULL, {0, inf});
	}
	int get(node* v, int l, int r, int x) {
		int ans = v->now.get(x);
		int m = (l + r) / 2;
		if(m <= x) {
			if(v->r == NULL) 
				return ans;
			else
				return min(ans, get(v->r, m, r, x));
		}
		else {
			if(v->l == NULL) 
				return ans;
			else
				return min(ans, get(v->l, l, m, x));
		}
	}
	void upd(node* v, int l, int r, line val) {
		int m = (l + r) / 2;
		bool lft = val.get(l) < v->now.get(l);
		bool mid = val.get(m) < v->now.get(m);
		if(mid) 
			swap(v->now, val);
		if(r - l == 1) 
			return;
		if(lft == mid) {
			if(v->r == NULL) {
				auto neww = new node(NULL, NULL, {0, inf});
				v->r = neww;
			}
			upd(v->r, m, r, val);
			return;
		}
		else {
			if(v->l == NULL) {
				auto neww = new node(NULL, NULL, {0, inf});
				v->l = neww;
			}
			upd(v->l, l, m, val);
			return;
		}
	}
	int get(int x) {
		return get(v, 0, inf, x);
	}
	void upd(line val) {
		upd(v, 0, inf, val);
	}
};

lichao tree[2 * N];

int get(int v, int l, int r, int vl, int vr, int X) {
	if(r <= vl || vr <= l) 
		return inf;
	if(vl <= l && r <= vr) {
		return tree[v].get(X);
	}
	int m = (l + r) / 2;
	return min(get(v * 2, l, m, vl, vr, X), get(v * 2 + 1, m, r, vl, vr, X));
}

void upd(int v, line val) {
	if(v == 0) 
		return;
	tree[v].upd(val);
	upd(v / 2, val);
	return;
}

signed main() {
	#ifdef PC
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	#endif	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int x, n, m, w, T;
	cin >> x >> n >> m >> w >> T;
	vector<int> s(n + 1);
	vector<pair<int, int>> p(m);
	vector<int> pref(m + 1, 0);
	vector<int> cnt(m + 1, 0);
	vector<int> d(m + 1, 0);
	s[0] = 0;
	for (int i = 1; i <= n; i++) 
		cin >> s[i];	
	s.pb(x);
	n += 2;
	sort(s.begin(), s.end());
	for (int i = 0; i < m; i++) {
		cin >> p[i].ft >> p[i].sc;
	}
	sort(p.begin(), p.end());
	vector<int> have;
	for (int i = 0; i < m; i++) {
		pref[i + 1] = pref[i] + p[i].sc;
		cnt[i] = (x - p[i].ft) / T + 1;
		d[i] = p[i].ft;
		have.pb(d[i]);
	}

	vector<vector<pair<int, int>>> can(m + 1);

	for (int i = 1; i < n; i++) {
		int driver = s[i] / T * T;
		int minn = lower_bound(have.begin(), have.end(), max(0LL, s[i - 1] - driver)) - have.begin();
		int lst = upper_bound(have.begin(), have.end(), s[i] - driver) - have.begin() - 1;
		if(lst < minn) 
			continue;
		can[lst].pb({s[i], minn});

		// int lstt = -1, lst = -1;
		// for (int j = 0; j < m; j++) {
		// 	int time = s[i] / T * T + d[j];
		// 	if(time > s[i]) 
		// 		time -= T;
		// 	if(time < s[i - 1])
		// 		continue;
		// 	if(time < driver) 
		// 		continue;
		// 	if(time > lstt) {
		// 		lstt = time;
		// 		lst = j;
		// 	}
		// }
		// if(lstt == -1) 
		// 	continue;
		// int minn = lst;
		// for (int j = m - 1; j >= 0; j--) {
		// 	int time = s[i] / T * T + d[j];
		// 	if(time > s[i]) 
		// 		time -= T;
		// 	if(time < s[i - 1]) 
		// 		continue;
		// 	if(time < driver) 
		// 		continue;
		// 	minn = min(j, minn);
		// 	// can[lst].pb({s[i], j});
		// }
		can[lst].pb({s[i], minn});
	}

	vector<int> dp(m + 1, 0);
	for (int i = 0; i < m; i++) {
		dp[i + 1] = dp[i] + cnt[i] * w;
		upd(N + i, {-i, -pref[i] + dp[i]});
		for (auto x : can[i]) {
			int time = x.ft / T * T + d[i];
			if(time > x.ft) 
				time -= T;
			for (int j = x.sc; j <= i; j++) {
				int time1 = x.ft / T * T + d[j];
				if(time > x.ft) 
					time -= T;
				if(time1 / T * w != time / T * w) 
					return -1;
			}
			
			int X = time / T * w;
			// cout << X << " " << x.ft << " " << x.sc << " " << i << " " << pref[i + 1] + (i + 1) * X + get(1, 0, N, i, i + 1, X) << " " << pref[i + 1] + (i + 1) * X + get(1, 0, N, x.sc, i + 1, X) << endl;
			dp[i + 1] = min(dp[i + 1], pref[i + 1] + (i + 1) * X + get(1, 0, N, x.sc, i + 1, X));
		}
		// cout << i << " " << dp[i + 1] << endl;
	}
	cout << dp[m] + ((x / T + 1) * w) << endl;


	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 29048 KB Output is correct
2 Correct 28 ms 29048 KB Output is correct
3 Correct 29 ms 29048 KB Output is correct
4 Correct 28 ms 29048 KB Output is correct
5 Correct 29 ms 29176 KB Output is correct
6 Correct 30 ms 29176 KB Output is correct
7 Correct 29 ms 29304 KB Output is correct
8 Correct 33 ms 29304 KB Output is correct
9 Correct 29 ms 29304 KB Output is correct
10 Correct 31 ms 29208 KB Output is correct
11 Correct 29 ms 29304 KB Output is correct
12 Correct 29 ms 29176 KB Output is correct
13 Correct 28 ms 29176 KB Output is correct
14 Correct 30 ms 29048 KB Output is correct
15 Correct 43 ms 29304 KB Output is correct
16 Correct 32 ms 29048 KB Output is correct
17 Correct 32 ms 29176 KB Output is correct
18 Correct 33 ms 29308 KB Output is correct
19 Correct 30 ms 29304 KB Output is correct
20 Correct 30 ms 29304 KB Output is correct
21 Correct 28 ms 29304 KB Output is correct
22 Correct 29 ms 29308 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 29048 KB Output is correct
2 Correct 28 ms 29048 KB Output is correct
3 Correct 29 ms 29048 KB Output is correct
4 Correct 28 ms 29048 KB Output is correct
5 Correct 29 ms 29176 KB Output is correct
6 Correct 30 ms 29176 KB Output is correct
7 Correct 29 ms 29304 KB Output is correct
8 Correct 33 ms 29304 KB Output is correct
9 Correct 29 ms 29304 KB Output is correct
10 Correct 31 ms 29208 KB Output is correct
11 Correct 29 ms 29304 KB Output is correct
12 Correct 29 ms 29176 KB Output is correct
13 Correct 28 ms 29176 KB Output is correct
14 Correct 30 ms 29048 KB Output is correct
15 Correct 43 ms 29304 KB Output is correct
16 Correct 32 ms 29048 KB Output is correct
17 Correct 32 ms 29176 KB Output is correct
18 Correct 33 ms 29308 KB Output is correct
19 Correct 30 ms 29304 KB Output is correct
20 Correct 30 ms 29304 KB Output is correct
21 Correct 28 ms 29304 KB Output is correct
22 Correct 29 ms 29308 KB Output is correct
23 Correct 31 ms 30072 KB Output is correct
24 Correct 30 ms 30200 KB Output is correct
25 Correct 33 ms 29816 KB Output is correct
26 Correct 30 ms 30456 KB Output is correct
27 Correct 30 ms 30456 KB Output is correct
28 Correct 30 ms 29944 KB Output is correct
29 Correct 30 ms 29560 KB Output is correct
30 Correct 30 ms 29560 KB Output is correct
31 Correct 36 ms 31224 KB Output is correct
32 Correct 30 ms 29560 KB Output is correct
33 Correct 34 ms 30584 KB Output is correct
34 Correct 30 ms 30200 KB Output is correct
35 Correct 29 ms 30072 KB Output is correct
36 Correct 31 ms 29688 KB Output is correct
37 Correct 29 ms 29820 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 29048 KB Output is correct
2 Correct 28 ms 29048 KB Output is correct
3 Correct 29 ms 29048 KB Output is correct
4 Correct 28 ms 29048 KB Output is correct
5 Correct 29 ms 29176 KB Output is correct
6 Correct 30 ms 29176 KB Output is correct
7 Correct 29 ms 29304 KB Output is correct
8 Correct 33 ms 29304 KB Output is correct
9 Correct 29 ms 29304 KB Output is correct
10 Correct 31 ms 29208 KB Output is correct
11 Correct 29 ms 29304 KB Output is correct
12 Correct 29 ms 29176 KB Output is correct
13 Correct 28 ms 29176 KB Output is correct
14 Correct 30 ms 29048 KB Output is correct
15 Correct 43 ms 29304 KB Output is correct
16 Correct 32 ms 29048 KB Output is correct
17 Correct 32 ms 29176 KB Output is correct
18 Correct 33 ms 29308 KB Output is correct
19 Correct 30 ms 29304 KB Output is correct
20 Correct 30 ms 29304 KB Output is correct
21 Correct 28 ms 29304 KB Output is correct
22 Correct 29 ms 29308 KB Output is correct
23 Correct 31 ms 30072 KB Output is correct
24 Correct 30 ms 30200 KB Output is correct
25 Correct 33 ms 29816 KB Output is correct
26 Correct 30 ms 30456 KB Output is correct
27 Correct 30 ms 30456 KB Output is correct
28 Correct 30 ms 29944 KB Output is correct
29 Correct 30 ms 29560 KB Output is correct
30 Correct 30 ms 29560 KB Output is correct
31 Correct 36 ms 31224 KB Output is correct
32 Correct 30 ms 29560 KB Output is correct
33 Correct 34 ms 30584 KB Output is correct
34 Correct 30 ms 30200 KB Output is correct
35 Correct 29 ms 30072 KB Output is correct
36 Correct 31 ms 29688 KB Output is correct
37 Correct 29 ms 29820 KB Output is correct
38 Correct 112 ms 48632 KB Output is correct
39 Correct 113 ms 47352 KB Output is correct
40 Correct 142 ms 45280 KB Output is correct
41 Correct 115 ms 45304 KB Output is correct
42 Correct 114 ms 45048 KB Output is correct
43 Correct 102 ms 45432 KB Output is correct
44 Correct 146 ms 46712 KB Output is correct
45 Correct 114 ms 43768 KB Output is correct
46 Correct 136 ms 67320 KB Output is correct
47 Correct 115 ms 40952 KB Output is correct
48 Correct 143 ms 49020 KB Output is correct
49 Correct 59 ms 50936 KB Output is correct
50 Correct 116 ms 48252 KB Output is correct
51 Correct 112 ms 47992 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 29048 KB Output is correct
2 Correct 28 ms 29048 KB Output is correct
3 Correct 29 ms 29048 KB Output is correct
4 Correct 28 ms 29048 KB Output is correct
5 Correct 29 ms 29176 KB Output is correct
6 Correct 30 ms 29176 KB Output is correct
7 Correct 29 ms 29304 KB Output is correct
8 Correct 33 ms 29304 KB Output is correct
9 Correct 29 ms 29304 KB Output is correct
10 Correct 31 ms 29208 KB Output is correct
11 Correct 29 ms 29304 KB Output is correct
12 Correct 29 ms 29176 KB Output is correct
13 Correct 28 ms 29176 KB Output is correct
14 Correct 30 ms 29048 KB Output is correct
15 Correct 43 ms 29304 KB Output is correct
16 Correct 32 ms 29048 KB Output is correct
17 Correct 32 ms 29176 KB Output is correct
18 Correct 33 ms 29308 KB Output is correct
19 Correct 30 ms 29304 KB Output is correct
20 Correct 30 ms 29304 KB Output is correct
21 Correct 28 ms 29304 KB Output is correct
22 Correct 29 ms 29308 KB Output is correct
23 Correct 31 ms 30072 KB Output is correct
24 Correct 30 ms 30200 KB Output is correct
25 Correct 33 ms 29816 KB Output is correct
26 Correct 30 ms 30456 KB Output is correct
27 Correct 30 ms 30456 KB Output is correct
28 Correct 30 ms 29944 KB Output is correct
29 Correct 30 ms 29560 KB Output is correct
30 Correct 30 ms 29560 KB Output is correct
31 Correct 36 ms 31224 KB Output is correct
32 Correct 30 ms 29560 KB Output is correct
33 Correct 34 ms 30584 KB Output is correct
34 Correct 30 ms 30200 KB Output is correct
35 Correct 29 ms 30072 KB Output is correct
36 Correct 31 ms 29688 KB Output is correct
37 Correct 29 ms 29820 KB Output is correct
38 Correct 112 ms 48632 KB Output is correct
39 Correct 113 ms 47352 KB Output is correct
40 Correct 142 ms 45280 KB Output is correct
41 Correct 115 ms 45304 KB Output is correct
42 Correct 114 ms 45048 KB Output is correct
43 Correct 102 ms 45432 KB Output is correct
44 Correct 146 ms 46712 KB Output is correct
45 Correct 114 ms 43768 KB Output is correct
46 Correct 136 ms 67320 KB Output is correct
47 Correct 115 ms 40952 KB Output is correct
48 Correct 143 ms 49020 KB Output is correct
49 Correct 59 ms 50936 KB Output is correct
50 Correct 116 ms 48252 KB Output is correct
51 Correct 112 ms 47992 KB Output is correct
52 Execution timed out 2102 ms 144984 KB Time limit exceeded
53 Halted 0 ms 0 KB -