Submission #970632

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
970632	2024-04-27T01:34:31 Z	MinaRagy06	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	240 ms	4444 KB

merchant

#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N = 105, K = 1005;
const ll inf = 1e18;
array<ll, 2> a[N][K];
ll dist[N][N], dist2[N][N], dist3[N][N], c[N][N];
int n, m, t;
bool check(ll v) {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			dist2[i][j] = -1e18;
			for (int k = 1; k <= n; k++) {
				if (dist[i][k] + dist3[k][j] <= inf / v) {
//					if (i == 1 && j == 1) {
//						cout << -(dist[i][k] + dist3[k][j]) * v + c[k][j] << ' ' << k << ' ' << c[k][j] << ' ' << dist[i][k] << ' ' << dist3[k][j] << '\n';
//					}
					dist2[i][j] = max(dist2[i][j], -(dist[i][k] + dist3[k][j]) * v + c[k][j]);
				}
			}
		}
	}
	for (int k = 1; k <= n; k++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				dist2[i][j] = max(dist2[i][j], dist2[i][k] + dist2[k][j]);
			}
		}
	}
	for (int k = 1; k <= n; k++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				if (dist2[i][k] + dist2[k][j] > dist2[i][j]) {
					dist2[i][j] = 1e18;
				}
			}
		}
	}
//	for (int i = 1; i <= n; i++) {
//		for (int j = 1; j <= n; j++) {
//			cout << dist2[i][j] << ' ';
//		}
//		cout << '\n';
//	}
//	cout << dist[1][2] << ' ' << dist[3][1] << ' ' << dist2[2][3] << '\n';
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= n; k++) {
				if (dist[i][j] + dist[k][i] <= inf / v) {
					if (dist2[j][k] - (dist[i][j] + dist[k][i]) * v >= 0) {
//						cout << i << ' ' << j << ' ' << k << ' ' << i << ": " << dist2[j][k] << ' ' << dist[i][j] << ' ' << dist[k][i] << '\n';
						return 1;
					}
				}
			}
		}
	}
	return 0;
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m >> t;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < t; j++) {
			cin >> a[i][j][0] >> a[i][j][1];
			if (a[i][j][0] == -1) {
				a[i][j][0] = 1e18;
			}
			if (a[i][j][1] == -1) {
				a[i][j][1] = -1e18;
			}
		}
	}
	memset(dist, '?', sizeof dist);
	memset(dist3, '?', sizeof dist3);
	for (int i = 0, u, v, w; i < m; i++) {
		cin >> u >> v >> w;
		dist[u][v] = w;
		dist3[u][v] = w;
	}
	for (int i = 1; i <= n; i++) {
		dist[i][i] = 0;
	}
	for (int k = 1; k <= n; k++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
				dist3[i][j] = min(dist3[i][j], dist3[i][k] + dist3[k][j]);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			c[i][j] = -1e18;
			// buy at i, sell at j
			for (int k = 0; k < t; k++) {
//				if (i == 4 && j == 1) {
//					cout << - a[i][k][0] + a[j][k][1] << '\n';
//				}
				c[i][j] = max(c[i][j], - a[i][k][0] + a[j][k][1]);
			}
		}
	}
	ll l = 1, r = 1e18;
	while (l <= r) {
		ll md = ((l + r) >> 1);
		if (check(md)) {
			l = md + 1;
		} else {
			r = md - 1;
		}
	}
	cout << r << '\n';
	return 0;
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	228 ms	3420 KB	Output is correct
2	Correct	206 ms	1364 KB	Output is correct
3	Correct	233 ms	1112 KB	Output is correct
4	Correct	27 ms	856 KB	Output is correct
5	Correct	27 ms	860 KB	Output is correct
6	Correct	29 ms	856 KB	Output is correct
7	Correct	28 ms	1000 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	27 ms	928 KB	Output is correct
10	Correct	28 ms	916 KB	Output is correct
11	Correct	31 ms	860 KB	Output is correct
12	Correct	1 ms	600 KB	Output is correct
13	Correct	26 ms	860 KB	Output is correct

Subtask #2

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	856 KB	Output is correct
2	Correct	28 ms	1000 KB	Output is correct
3	Correct	0 ms	604 KB	Output is correct
4	Correct	27 ms	928 KB	Output is correct
5	Correct	28 ms	916 KB	Output is correct
6	Correct	31 ms	860 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	26 ms	860 KB	Output is correct
9	Correct	28 ms	856 KB	Output is correct
10	Correct	28 ms	944 KB	Output is correct
11	Correct	29 ms	856 KB	Output is correct
12	Correct	26 ms	968 KB	Output is correct
13	Correct	28 ms	860 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	26 ms	924 KB	Output is correct
16	Correct	26 ms	1112 KB	Output is correct
17	Correct	37 ms	856 KB	Output is correct
18	Correct	34 ms	860 KB	Output is correct
19	Correct	29 ms	860 KB	Output is correct
20	Correct	26 ms	856 KB	Output is correct
21	Correct	27 ms	860 KB	Output is correct
22	Correct	28 ms	860 KB	Output is correct
23	Correct	34 ms	860 KB	Output is correct
24	Correct	27 ms	860 KB	Output is correct
25	Correct	32 ms	996 KB	Output is correct
26	Correct	0 ms	600 KB	Output is correct
27	Correct	28 ms	860 KB	Output is correct
28	Correct	27 ms	860 KB	Output is correct
29	Correct	26 ms	860 KB	Output is correct
30	Correct	28 ms	860 KB	Output is correct
31	Correct	25 ms	860 KB	Output is correct

Subtask #3

33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	32 ms	996 KB	Output is correct
2	Correct	0 ms	600 KB	Output is correct
3	Correct	28 ms	860 KB	Output is correct
4	Correct	27 ms	860 KB	Output is correct
5	Correct	26 ms	860 KB	Output is correct
6	Correct	28 ms	860 KB	Output is correct
7	Correct	25 ms	860 KB	Output is correct
8	Correct	213 ms	1368 KB	Output is correct
9	Correct	235 ms	3928 KB	Output is correct
10	Correct	240 ms	1112 KB	Output is correct
11	Correct	220 ms	1628 KB	Output is correct
12	Correct	211 ms	1548 KB	Output is correct
13	Correct	206 ms	1332 KB	Output is correct

Subtask #4

34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	856 KB	Output is correct
2	Correct	28 ms	944 KB	Output is correct
3	Correct	29 ms	856 KB	Output is correct
4	Correct	26 ms	968 KB	Output is correct
5	Correct	28 ms	860 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	26 ms	924 KB	Output is correct
8	Correct	26 ms	1112 KB	Output is correct
9	Correct	37 ms	856 KB	Output is correct
10	Correct	34 ms	860 KB	Output is correct
11	Correct	29 ms	860 KB	Output is correct
12	Correct	26 ms	856 KB	Output is correct
13	Correct	27 ms	860 KB	Output is correct
14	Correct	28 ms	860 KB	Output is correct
15	Correct	34 ms	860 KB	Output is correct
16	Correct	27 ms	860 KB	Output is correct
17	Correct	213 ms	1368 KB	Output is correct
18	Correct	235 ms	3928 KB	Output is correct
19	Correct	240 ms	1112 KB	Output is correct
20	Correct	220 ms	1628 KB	Output is correct
21	Correct	211 ms	1548 KB	Output is correct
22	Correct	206 ms	1332 KB	Output is correct
23	Correct	32 ms	996 KB	Output is correct
24	Correct	0 ms	600 KB	Output is correct
25	Correct	28 ms	860 KB	Output is correct
26	Correct	27 ms	860 KB	Output is correct
27	Correct	26 ms	860 KB	Output is correct
28	Correct	28 ms	860 KB	Output is correct
29	Correct	25 ms	860 KB	Output is correct
30	Correct	228 ms	3420 KB	Output is correct
31	Correct	206 ms	1364 KB	Output is correct
32	Correct	233 ms	1112 KB	Output is correct
33	Correct	27 ms	856 KB	Output is correct
34	Correct	27 ms	860 KB	Output is correct
35	Correct	29 ms	856 KB	Output is correct
36	Correct	28 ms	1000 KB	Output is correct
37	Correct	0 ms	604 KB	Output is correct
38	Correct	27 ms	928 KB	Output is correct
39	Correct	28 ms	916 KB	Output is correct
40	Correct	31 ms	860 KB	Output is correct
41	Correct	1 ms	600 KB	Output is correct
42	Correct	26 ms	860 KB	Output is correct
43	Correct	227 ms	1236 KB	Output is correct
44	Correct	210 ms	1416 KB	Output is correct
45	Correct	232 ms	2896 KB	Output is correct
46	Correct	209 ms	1396 KB	Output is correct
47	Correct	215 ms	1372 KB	Output is correct
48	Correct	222 ms	1424 KB	Output is correct
49	Correct	233 ms	4308 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	1 ms	604 KB	Output is correct
52	Correct	213 ms	1088 KB	Output is correct
53	Correct	208 ms	1320 KB	Output is correct
54	Correct	197 ms	1288 KB	Output is correct
55	Correct	198 ms	1112 KB	Output is correct
56	Correct	216 ms	1360 KB	Output is correct
57	Correct	1 ms	600 KB	Output is correct
58	Correct	27 ms	860 KB	Output is correct
59	Correct	27 ms	860 KB	Output is correct
60	Correct	27 ms	860 KB	Output is correct
61	Correct	232 ms	4444 KB	Output is correct
62	Correct	232 ms	4176 KB	Output is correct
63	Correct	0 ms	604 KB	Output is correct