제출 #850348

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
850348		Naser	추월 (IOI23_overtaking)	C++17	10 / 100	3 ms	420 KiB

overtaking

#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define endl '\n'
#define pii pair<int,int>
#define vint vector<int>
#define vll vector<ll>
#define vpii vector<pii>
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(), x.end()
#define graph vector<vll>
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; }

ll n, x, m, l, y,stn;
vll w, s, t;
graph arv, srt;

bool cmp(int a, int b) {
	if (arv[stn][a] == arv[stn][b])
		return w[a] < w[b];
	return arv[stn][a] < arv[stn][b];
}
bool cmp2(int a, int b) {
	return arv[stn][a] < b;
}
void init(int L, int N, vll T, vint W, int X, int M, vint S) {
	n = N;
	t = T;
	w.resize(n);
	for (int i = 0; i < n; i++)
		w[i] = W[i];
	x = X;
	m = M;
	s.resize(m);
	for (int i = 0; i < m; i++)
		s[i] = S[i];
	arv.resize(m, vll(n));
	srt.resize(m, vll(n));
	vector<ll> tmp;
	for (int i = 0; i < n; i++) {
		arv[0][i] = t[i];
		tmp.pb(i);
	}
	for (int i = 1; i < m; i++) {
		stn = i - 1;
		sort(all(tmp),cmp);
		for (int j = 0; j < n; j++) 
			srt[i][j] = tmp[j];
		for (int j = 0; j < n; j++) {
			int bus = srt[i][j];
			int prv = (j ? srt[i][j - 1] : srt[i][j]);
			arv[i][bus] = arv[i - 1][bus] + (s[i] - s[i - 1]) * w[bus];
			if (arv[i - 1][prv] < arv[i - 1][bus])
				arv[i][bus] = max(arv[i][bus], arv[i][prv]);
		}
	}
}

long long arrival_time(long long y) {
	ll ans = y;
	if (m == 2) {
		ans += (s[m - 1] * x);
		for (int i = 0; i < n; i++) {
			if (t[i] < y)
				ans = max(ans, t[i] + (s[m - 1] * w[i]));
		}
		return ans;
	}
	if (n == 1) {
		for (int i = 1; i < 0; i++) {
			if (arv[i - 1][0] < ans)
				ans = arv[i][0];
			else
				ans += (s[i] - s[i - 1]) * x;
;		}
		return ans;
	}
	for (int i = 1; i < m; i++) {
		stn = i - 1;
		int idx = lower_bound(all(srt[i]), ans, cmp2) - srt[i].begin();

		int prv = (idx? srt[i][idx - 1] : -1);
		if (prv != -1 && arv[i-1][prv] < ans)
			ans = max(ans + (s[i] - s[i - 1]) * x, arv[i][prv]);
		else
			ans += (s[i] - s[i - 1]) * x;
	}
	return ans;
}
/*int32_t main() {

	init(6, 4, { 20, 10, 40, 0 }, { 5, 20, 20, 30 }, 10, 4, { 0, 1, 3, 6 });
	//init(6, 1, { 5 }, { 20 }, 10, 5, { 0,2,4,5 ,6 });
	while (naser > tourist) {
		ll Y;
		cin >> Y;
		cout << arrival_time(Y) << endl;
	}

}*/

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