Submission #848540

#	Time	Username	Problem	Language	Result	Execution time	Memory
848540		Naser	Overtaking (IOI23_overtaking)	C++17	0 / 100	2 ms	4956 KiB

overtaking

#include <bits/stdc++.h>
//#define int long long
#define endl '\n'
#define pii pair<int,int>
#define vint vector<int>
#define vll vector<long long>
#define vpii vector<pii>
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(), x.end()
#define graph vector<vector<int>>
using namespace std;
const int N = (int)2e5 + 69;
const int mod = (int)1e4 + 7;
const int naser = 3999, tourist = 3816;
int power(int a, int b) { int ans = 1; while (b) { if (b % 2) ans *= a; a *= a; b /= 2; } return ans; }

long long ex[1001][1001], ti[1001][1001], y, x, n, m;
vint tmp, w, s;
vll t;
bool cmp(int a, int b) {

	long double aa = -1;
	if (w[a] != x)
		aa = (y - t[a]) / (w[a] - x);
	long double bb = -1;
	if (w[b] != x)
		bb = (y - t[b]) / (w[b] - x);
	return aa < bb;
}
void init(int l, int N, vll T, vint W, int X, int M, vint S) {
	t = T;
	w = W;
	s = S;
	x = X;
	n = N;
	m = M;
	tmp.resize(n);
	for (int i = 0; i < m; i++)
		ti[i][0] = t[i];
	for (int j = 1; j < m; j++) {
		for (int i = 0; i < n; i++) {
			ex[i][j] = ti[i][j - 1] + (s[j] - s[j - 1]) * w[i];
		}
		for (int i = 0; i < n; i++) {
			ti[i][j] = ex[i][j];
			for (int k = 0; k < n; k++) {
				if (ti[k][j - 1] < ti[i][j - 1])
					ti[i][j] = max(ex[i][j], ex[k][j]);
			}
		}
	}
	for (int i = 0; i < n; i++)
		tmp[i] = i;
}
long long arrival_time(long long Y) {
	y = Y;
	long long arrive[1001] = {};
	sort(all(tmp), cmp);
	int it = 1;
	arrive[0] = y;
	long long ksmalcode = 0;
	for (int i = 0; i < n; i++) {
		if (t[i] < y)
			ksmalcode = max(ksmalcode, ex[i][1]);
		if (w[tmp[i]] == x || w[tmp[i]] <= x || t[tmp[i]] >= y)
			continue;
		int cross = (arrive[it-1] - ti[tmp[i]][it - 1]) / (w[tmp[i]] - x) + ((arrive[it - 1] - ti[tmp[i]][it - 1]) % (w[tmp[i]] - x) != 0);
		cross += s[it - 1];
		int idx = lower_bound(all(s), cross) - s.begin();

		while (it < m - 1 && it < idx) {
			arrive[it] = arrive[it - 1] + (s[it] - s[it - 1]) * x;
			it++;
		}
		if (idx == it && idx < m) {
			arrive[it] = max(ti[tmp[i]][it], arrive[it - 1] + (s[it] - s[it - 1]) * x);
			it++;
		}
	}
	while (it < m) {
		arrive[it] = arrive[it - 1] + (s[it] - s[it - 1]) * x;
		it++;
	}
	return ksmalcode;
}
//int32_t main() {
//
//	init(6, 4, { 20, 10, 40, 0 }, { 5, 20, 20, 30 }, 10, 2, { 0, 1, 3, 6 });
//	//init(6, 2, { 10, 20 }, { 5, 3 }, 2, 2, { 0, 6 });
//	while (naser > tourist) {
//		int y;
//		cin >> y;
//		cout << arrival_time(y) << endl;
//	}
//
//}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 26
• Subtask 5: 0 / 35