oj.uz

Submission #881629

# Submission time Handle Problem Language Result Execution time Memory
881629 2023-12-01T16:05:18 Z 42kangaroo Overtaking (IOI23_overtaking) C++17
100 / 100
 491 ms 90000 KB 
//  E. Overtaking

#include<bits/stdc++.h>
#include "overtaking.h"

using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

template<typename T>
using vv_t = vector<vector<T>>;

vv_t<long long> neArT;
vv_t<long long> arT;
vector<long long> s;
vector<long long> w;
vv_t<long long> backT;

long long x;


struct Val {
	long long en, s, e;
};

bool operator<(const Val& l, const Val& r) {
	return l.e < r.e;
}

vector<Val> resV;

int wij(int i, int j, int p) {
	int l = p - 1, r = s.size();
	while (l + 1 < r){
		int m = (l + r)/2;
		if (arT[p][i] + w[i]*(s[m] - s[p]) > arT[p][j] + w[j]*(s[m] - s[p])) r = m;
		else l = m;
	}
	return l;
}

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S) {
	// init arT amd neArT
	vector<bool> val(N, true);
	int nn = N;
	for (int i = 0; i < N; ++i) {
		if (W[i] <= X) {
			val[i] = false;
			nn--;
		}
	}
	N = nn;
	arT = vv_t<long long>(M - 1, vector<long long>(N));
	neArT = vv_t<long long>(M - 1, vector<long long>(N));
	backT = vv_t<long long>(M, vector<long long>(N));
	for (int i = 0; i < M; ++i) {
		backT[i].reserve(2*N);
	}
	x = X;
	s = vector<long long>(S.begin(), S.end());
	w = vector<long long>(N);
	vector<long long> t(N);
	int ind = 0;
	for (int i = 0; i < W.size(); ++i) {
		if (val[i]) {
			t[ind] = T[i];
			w[ind++] = W[i];
		}
	}
	vector<int> o(N);
	std::iota(o.begin(), o.end(), 0);
	std::sort(o.begin(), o.end(), [&](int l, int r) { return tie(t[l], w[l]) < tie(t[r], w[r]); });
	for (int i = 0; i < N; ++i) {
		arT[0][o[i]] = t[o[i]];
		neArT[0][o[i]] = t[o[i]] + w[o[i]] * (s[1] - s[0]);
		if (i > 0) neArT[0][o[i]] = max(neArT[0][o[i]], neArT[0][o[i - 1]]);
	}
	// for each M
	for (int i = 1; i < M - 1; ++i) {
		// sort bus according to departure first, speed second
		std::sort(o.begin(), o.end(),
		          [&](int l, int r) {
			          return tie(neArT[i - 1][l], w[l]) <
			                 tie(neArT[i - 1][r], w[r]);
		          });
		// go through sorted and compute next arrival time, keep max of others
		for (int j = 0; j < N; ++j) {
			arT[i][o[j]] = neArT[i - 1][o[j]];
			// make a prefix max array of the next arrival time
			neArT[i][o[j]] = arT[i][o[j]] + w[o[j]] * (s[i + 1] - s[i]);
			if (j > 0) neArT[i][o[j]] = max(neArT[i][o[j]], neArT[i][o[j - 1]]);
		}
	}
	for (int i = 0; i < N; ++i) {
		backT.back()[i] = neArT.back()[i];
	}
	// sort by arT, w, and then do deque / convex hull opt to find the
	// find cutting point, by binary search on M
	for (int i = M - 2; i >= 0; --i) {
		std::sort(o.begin(), o.end(),
		          [&](int l, int r) {
			          return tie(arT[i][l], w[l]) <
			                 tie(arT[i][r], w[l]);
		          });
		deque<pair<int,int>> st;
		for (int j = 0; j < N; ++j) {
			int po = o[j];
			if (j > 0 && arT[i][po] == arT[i][o[j - 1]]) {
				backT[i][po] = backT[i][o[j - 1]];
			} else {
				int l = -1, r = st.size();
				while (l + 1 < r) {
					int m = (l + r)/2;
					if (arT[i][po] + x*(s[st[m].second] - s[i]) <= arT[i][st[m].first]+ w[st[m].first]*(s[st[m].second] - s[i])) l = m;
					else r = m;
				}
				if (l == -1) {
					backT[i][po] = arT[i][po] + x*(s.back() - s[i]);
				} else {
					int ll = i, rr = st[l].second;
					if (l < st.size() - 1) {
						ll = st[l + 1].second;
					}
					while (ll + 1 < rr) {
						int mm = (ll + rr)/2;
						if (arT[i][po] + x*(s[mm] - s[i]) <= arT[i][st[l].first]+ w[st[l].first]*(s[mm] - s[i])) rr = mm;
						else ll = mm;
					}
					backT[i][po] = backT[rr][st[l].first];
				}
			}
			while (!st.empty() && wij(st.back().first, po, i) >= st.back().second) st.pop_back();
			if (!st.empty()) st.push_back({po, wij(st.back().first, po, i)});
			else st.push_back({po, M - 1});
			if (st.back().second <= i) st.pop_back();
		}
	}
	// fill in last line by looking at each highest point in order.
	resV.clear();
	std::sort(o.begin(), o.end(),
	          [&](int l, int r) {
		          return tie(arT[0][l], w[l]) <
		                 tie(arT[0][r], w[r]);
	          });
	deque<pair<int,int>> st;
	for (int i = 0; i < N; ++i) {
		int po = o[i];
		int last = 0;
		while (!st.empty() && wij(st.back().first, po, 0) >= st.back().second) {
			for (int j = last + 1; j <= st.back().second; ++j) {
				if (arT[0][st.back().first] + (w[st.back().first] - x)*(s[j - 1] - s[0]) + 1 > arT[0][po]) break;
				resV.push_back({backT[j][st.back().first], arT[0][st.back().first] + (w[st.back().first] - x)*(s[j - 1] - s[0]) + 1, min(arT[0][st.back().first] + (w[st.back().first] - x)*(s[j] - s[0]), arT[0][po])});
			}
			last = st.back().second;
			st.pop_back();
		}
		if (!st.empty()) {
			for (int j = last + 1; j <= wij(st.back().first, po, 0) + 1 && j < M; ++j) {
				if (arT[0][st.back().first] + (w[st.back().first] - x)*(s[j - 1] - s[0]) + 1 > arT[0][po]) break;
				resV.push_back({backT[j][st.back().first], arT[0][st.back().first] + (w[st.back().first] - x)*(s[j - 1] - s[0]) + 1, min(arT[0][st.back().first] + (w[st.back().first] - x)*(s[j] - s[0]), arT[0][po])});
			}
			st.push_back({po, wij(st.back().first, po, 0)});
		}
		else st.push_back({po, M - 1});
		if (st.back().second <= 0) st.pop_back();
	}
	int last = 0;
	while (!st.empty()) {
		for (int j = last + 1; j <= st.back().second + 1 && j < M; ++j) {
			resV.push_back({backT[j][st.back().first], arT[0][st.back().first] + (w[st.back().first] - x)*(s[j - 1] - s[0]) + 1, arT[0][st.back().first] + (w[st.back().first] - x)*(s[j] - s[0])});
		}
		last = st.back().second;
		st.pop_back();
	}
}

long long arrival_time(long long Y) {
	int neP = std::lower_bound(resV.begin(), resV.end(), Y,
	                          [&](Val l, long long r) { return l.e < r;}) - resV.begin();
	if (neP < resV.size() && resV[neP].s <= Y) return resV[neP].en;
	return Y + x*(s.back() - s.front());
}

Compilation message

overtaking.cpp: In function 'void init(int, int, std::vector<long long int>, std::vector<int>, int, int, std::vector<int>)':
overtaking.cpp:64:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  for (int i = 0; i < W.size(); ++i) {
      |                  ~~^~~~~~~~~~
overtaking.cpp:121:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |      if (l < st.size() - 1) {
      |          ~~^~~~~~~~~~~~~~~
overtaking.cpp: In function 'long long int arrival_time(long long int)':
overtaking.cpp:180:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Val>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  180 |  if (neP < resV.size() && resV[neP].s <= Y) return resV[neP].en;
      |      ~~~~^~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 700 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 472 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 1020 KB Output is correct
11 Correct 1 ms 1052 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 996 KB Output is correct
14 Correct 2 ms 868 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 712 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 696 KB Output is correct
27 Correct 1 ms 856 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 1112 KB Output is correct
33 Correct 1 ms 1112 KB Output is correct
34 Correct 1 ms 1268 KB Output is correct
35 Correct 1 ms 1112 KB Output is correct
36 Correct 1 ms 1112 KB Output is correct
37 Correct 1 ms 1112 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 860 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 700 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 1020 KB Output is correct
18 Correct 1 ms 1052 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 996 KB Output is correct
21 Correct 2 ms 868 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 712 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 696 KB Output is correct
34 Correct 1 ms 856 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 1112 KB Output is correct
40 Correct 1 ms 1112 KB Output is correct
41 Correct 1 ms 1268 KB Output is correct
42 Correct 1 ms 1112 KB Output is correct
43 Correct 1 ms 1112 KB Output is correct
44 Correct 1 ms 1112 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 860 KB Output is correct
48 Correct 195 ms 30480 KB Output is correct
49 Correct 191 ms 30852 KB Output is correct
50 Correct 205 ms 30836 KB Output is correct
51 Correct 184 ms 30524 KB Output is correct
52 Correct 177 ms 30772 KB Output is correct
53 Correct 181 ms 30796 KB Output is correct
54 Correct 180 ms 30596 KB Output is correct
55 Correct 155 ms 29996 KB Output is correct
56 Correct 168 ms 30524 KB Output is correct
57 Correct 131 ms 30528 KB Output is correct
58 Correct 166 ms 30736 KB Output is correct
59 Correct 172 ms 30528 KB Output is correct
60 Correct 166 ms 30528 KB Output is correct
61 Correct 174 ms 30520 KB Output is correct
62 Correct 2 ms 856 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 93 ms 16328 KB Output is correct
65 Correct 67 ms 15312 KB Output is correct
66 Correct 135 ms 30040 KB Output is correct
67 Correct 125 ms 30288 KB Output is correct
68 Correct 126 ms 30292 KB Output is correct
69 Correct 109 ms 55996 KB Output is correct
70 Correct 120 ms 55220 KB Output is correct
71 Correct 108 ms 55280 KB Output is correct
72 Correct 135 ms 56304 KB Output is correct
73 Correct 106 ms 56040 KB Output is correct
74 Correct 107 ms 55484 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 2 ms 604 KB Output is correct
78 Correct 108 ms 44324 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 700 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 472 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 1020 KB Output is correct
29 Correct 1 ms 1052 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 996 KB Output is correct
32 Correct 2 ms 868 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 600 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 712 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 696 KB Output is correct
45 Correct 1 ms 856 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 1112 KB Output is correct
51 Correct 1 ms 1112 KB Output is correct
52 Correct 1 ms 1268 KB Output is correct
53 Correct 1 ms 1112 KB Output is correct
54 Correct 1 ms 1112 KB Output is correct
55 Correct 1 ms 1112 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 860 KB Output is correct
59 Correct 195 ms 30480 KB Output is correct
60 Correct 191 ms 30852 KB Output is correct
61 Correct 205 ms 30836 KB Output is correct
62 Correct 184 ms 30524 KB Output is correct
63 Correct 177 ms 30772 KB Output is correct
64 Correct 181 ms 30796 KB Output is correct
65 Correct 180 ms 30596 KB Output is correct
66 Correct 155 ms 29996 KB Output is correct
67 Correct 168 ms 30524 KB Output is correct
68 Correct 131 ms 30528 KB Output is correct
69 Correct 166 ms 30736 KB Output is correct
70 Correct 172 ms 30528 KB Output is correct
71 Correct 166 ms 30528 KB Output is correct
72 Correct 174 ms 30520 KB Output is correct
73 Correct 2 ms 856 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 93 ms 16328 KB Output is correct
76 Correct 67 ms 15312 KB Output is correct
77 Correct 135 ms 30040 KB Output is correct
78 Correct 125 ms 30288 KB Output is correct
79 Correct 126 ms 30292 KB Output is correct
80 Correct 109 ms 55996 KB Output is correct
81 Correct 120 ms 55220 KB Output is correct
82 Correct 108 ms 55280 KB Output is correct
83 Correct 135 ms 56304 KB Output is correct
84 Correct 106 ms 56040 KB Output is correct
85 Correct 107 ms 55484 KB Output is correct
86 Correct 2 ms 604 KB Output is correct
87 Correct 2 ms 604 KB Output is correct
88 Correct 2 ms 604 KB Output is correct
89 Correct 108 ms 44324 KB Output is correct
90 Correct 217 ms 33616 KB Output is correct
91 Correct 409 ms 65588 KB Output is correct
92 Correct 430 ms 65188 KB Output is correct
93 Correct 408 ms 65480 KB Output is correct
94 Correct 424 ms 65180 KB Output is correct
95 Correct 418 ms 65712 KB Output is correct
96 Correct 414 ms 65492 KB Output is correct
97 Correct 182 ms 33364 KB Output is correct
98 Correct 390 ms 64944 KB Output is correct
99 Correct 360 ms 66104 KB Output is correct
100 Correct 396 ms 65332 KB Output is correct
101 Correct 399 ms 64848 KB Output is correct
102 Correct 395 ms 65112 KB Output is correct
103 Correct 412 ms 65336 KB Output is correct
104 Correct 317 ms 48980 KB Output is correct
105 Correct 323 ms 52820 KB Output is correct
106 Correct 365 ms 73056 KB Output is correct
107 Correct 369 ms 72656 KB Output is correct
108 Correct 386 ms 72832 KB Output is correct
109 Correct 385 ms 73104 KB Output is correct
110 Correct 383 ms 73024 KB Output is correct
111 Correct 411 ms 88488 KB Output is correct
112 Correct 419 ms 88912 KB Output is correct
113 Correct 471 ms 89664 KB Output is correct
114 Correct 464 ms 79536 KB Output is correct
115 Correct 456 ms 89612 KB Output is correct
116 Correct 420 ms 90000 KB Output is correct
117 Correct 193 ms 39220 KB Output is correct
118 Correct 183 ms 39572 KB Output is correct
119 Correct 191 ms 37588 KB Output is correct
120 Correct 185 ms 39484 KB Output is correct
121 Correct 190 ms 40380 KB Output is correct
122 Correct 368 ms 71080 KB Output is correct
123 Correct 477 ms 79400 KB Output is correct
124 Correct 491 ms 76596 KB Output is correct
125 Correct 473 ms 76264 KB Output is correct