Submission #497177

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
497177	2021-12-22T15:46:41 Z	Sohsoh84	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	118 ms	39644 KB

merchant

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define all(x)			(x).begin(),(x).end()
#define X			first
#define Y			second
#define sep			' '
#define endl			'\n'
#define debug(x)		cerr << #x << ": " <<  x << endl;

const ll MAXN = 3000 + 10;
const ll MAXK = 1000 + 10;
const ll INF = 1e9 + 10; // ?

ll n, m, tk, B[MAXN][MAXK], S[MAXN][MAXK], max_prof[MAXN][MAXN], tdist[MAXN][MAXN];
int dist[MAXN][MAXN];

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	for (int i = 0; i < MAXN; i++) {
		memset(dist[i], 63, sizeof dist[i]);
		dist[i][i] = 0;
	}

	cin >> n >> m >> tk;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= tk; j++) cin >> B[i][j] >> S[i][j];

	for (int i = 1; i <= m; i++) {
		int u, v, d;
		cin >> u >> v >> d;
		dist[u][v] = min(dist[u][v], d);
	}

	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]);

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int t = 1; t <= tk; t++)
				if (S[j][t] >= 0 && B[i][t] >= 0)
					max_prof[i][j] = max(max_prof[i][j], S[j][t] - B[i][t]);
		}
	}
	

	ll l = 0, r = ll(2e9) + 10;
	while (l < r) {
		ll mid = (l + r + 1) >> 1;	
		
		bool flag = false;
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				tdist[i][j] = dist[i][j] * mid - max_prof[i][j];

		for (int k = 1; k <= n; k++)
			for (int v = 1; v <= n; v++)
				for (int u = 1; u <= n; u++)
					if (u != v) 
						tdist[v][u] = min(tdist[v][u], tdist[v][k] + tdist[k][u]);

		// loops
		for (int v = 1; v <= n; v++)
			for (int u = 1; u <= n; u++)
				if (v != u)
					flag |= (tdist[v][u] + tdist[u][v] <= 0);

		if (flag) l = mid;
		else r = mid - 1;
	}

	cout << l << endl;
	return 0;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	88 ms	37824 KB	Output is correct
2	Correct	52 ms	37072 KB	Output is correct
3	Correct	60 ms	36988 KB	Output is correct
4	Correct	20 ms	36300 KB	Output is correct
5	Correct	21 ms	36372 KB	Output is correct
6	Correct	27 ms	36428 KB	Output is correct
7	Correct	30 ms	36428 KB	Output is correct
8	Correct	22 ms	35848 KB	Output is correct
9	Correct	21 ms	36376 KB	Output is correct
10	Correct	21 ms	36384 KB	Output is correct
11	Correct	20 ms	36320 KB	Output is correct
12	Correct	18 ms	35856 KB	Output is correct
13	Correct	21 ms	36348 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	36428 KB	Output is correct
2	Correct	30 ms	36428 KB	Output is correct
3	Correct	22 ms	35848 KB	Output is correct
4	Correct	21 ms	36376 KB	Output is correct
5	Correct	21 ms	36384 KB	Output is correct
6	Correct	20 ms	36320 KB	Output is correct
7	Correct	18 ms	35856 KB	Output is correct
8	Correct	21 ms	36348 KB	Output is correct
9	Correct	24 ms	36624 KB	Output is correct
10	Correct	22 ms	36480 KB	Output is correct
11	Correct	21 ms	36604 KB	Output is correct
12	Correct	22 ms	36556 KB	Output is correct
13	Correct	21 ms	36644 KB	Output is correct
14	Correct	14 ms	35836 KB	Output is correct
15	Correct	23 ms	36460 KB	Output is correct
16	Correct	24 ms	36676 KB	Output is correct
17	Correct	21 ms	36464 KB	Output is correct
18	Correct	19 ms	36552 KB	Output is correct
19	Correct	20 ms	36600 KB	Output is correct
20	Correct	21 ms	36600 KB	Output is correct
21	Correct	20 ms	36556 KB	Output is correct
22	Correct	26 ms	36664 KB	Output is correct
23	Correct	21 ms	36668 KB	Output is correct
24	Correct	20 ms	36372 KB	Output is correct
25	Correct	21 ms	36684 KB	Output is correct
26	Correct	13 ms	35788 KB	Output is correct
27	Correct	22 ms	36612 KB	Output is correct
28	Correct	21 ms	36600 KB	Output is correct
29	Correct	21 ms	36684 KB	Output is correct
30	Correct	20 ms	36556 KB	Output is correct
31	Correct	21 ms	36620 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	36684 KB	Output is correct
2	Correct	13 ms	35788 KB	Output is correct
3	Correct	22 ms	36612 KB	Output is correct
4	Correct	21 ms	36600 KB	Output is correct
5	Correct	21 ms	36684 KB	Output is correct
6	Correct	20 ms	36556 KB	Output is correct
7	Correct	21 ms	36620 KB	Output is correct
8	Correct	78 ms	37656 KB	Output is correct
9	Correct	110 ms	38276 KB	Output is correct
10	Correct	59 ms	37516 KB	Output is correct
11	Correct	62 ms	37684 KB	Output is correct
12	Correct	62 ms	37696 KB	Output is correct
13	Correct	57 ms	37616 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	36624 KB	Output is correct
2	Correct	22 ms	36480 KB	Output is correct
3	Correct	21 ms	36604 KB	Output is correct
4	Correct	22 ms	36556 KB	Output is correct
5	Correct	21 ms	36644 KB	Output is correct
6	Correct	14 ms	35836 KB	Output is correct
7	Correct	23 ms	36460 KB	Output is correct
8	Correct	24 ms	36676 KB	Output is correct
9	Correct	21 ms	36464 KB	Output is correct
10	Correct	19 ms	36552 KB	Output is correct
11	Correct	20 ms	36600 KB	Output is correct
12	Correct	21 ms	36600 KB	Output is correct
13	Correct	20 ms	36556 KB	Output is correct
14	Correct	26 ms	36664 KB	Output is correct
15	Correct	21 ms	36668 KB	Output is correct
16	Correct	20 ms	36372 KB	Output is correct
17	Correct	78 ms	37656 KB	Output is correct
18	Correct	110 ms	38276 KB	Output is correct
19	Correct	59 ms	37516 KB	Output is correct
20	Correct	62 ms	37684 KB	Output is correct
21	Correct	62 ms	37696 KB	Output is correct
22	Correct	57 ms	37616 KB	Output is correct
23	Correct	21 ms	36684 KB	Output is correct
24	Correct	13 ms	35788 KB	Output is correct
25	Correct	22 ms	36612 KB	Output is correct
26	Correct	21 ms	36600 KB	Output is correct
27	Correct	21 ms	36684 KB	Output is correct
28	Correct	20 ms	36556 KB	Output is correct
29	Correct	21 ms	36620 KB	Output is correct
30	Correct	88 ms	37824 KB	Output is correct
31	Correct	52 ms	37072 KB	Output is correct
32	Correct	60 ms	36988 KB	Output is correct
33	Correct	20 ms	36300 KB	Output is correct
34	Correct	21 ms	36372 KB	Output is correct
35	Correct	27 ms	36428 KB	Output is correct
36	Correct	30 ms	36428 KB	Output is correct
37	Correct	22 ms	35848 KB	Output is correct
38	Correct	21 ms	36376 KB	Output is correct
39	Correct	21 ms	36384 KB	Output is correct
40	Correct	20 ms	36320 KB	Output is correct
41	Correct	18 ms	35856 KB	Output is correct
42	Correct	21 ms	36348 KB	Output is correct
43	Correct	70 ms	37256 KB	Output is correct
44	Correct	63 ms	37676 KB	Output is correct
45	Correct	75 ms	38180 KB	Output is correct
46	Correct	57 ms	37640 KB	Output is correct
47	Correct	58 ms	37632 KB	Output is correct
48	Correct	60 ms	37648 KB	Output is correct
49	Correct	109 ms	38408 KB	Output is correct
50	Correct	17 ms	35788 KB	Output is correct
51	Correct	16 ms	35788 KB	Output is correct
52	Correct	55 ms	37068 KB	Output is correct
53	Correct	57 ms	37176 KB	Output is correct
54	Correct	56 ms	37468 KB	Output is correct
55	Correct	57 ms	37232 KB	Output is correct
56	Correct	60 ms	37188 KB	Output is correct
57	Correct	15 ms	35780 KB	Output is correct
58	Correct	23 ms	36828 KB	Output is correct
59	Correct	23 ms	36772 KB	Output is correct
60	Correct	22 ms	36828 KB	Output is correct
61	Correct	110 ms	39640 KB	Output is correct
62	Correct	118 ms	39644 KB	Output is correct
63	Correct	15 ms	35840 KB	Output is correct

Submission #497177

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0