Submission #84267

# Submission time Handle Problem Language Result Execution time Memory
84267 2018-11-14T04:11:17 Z shoemakerjo Travelling Merchant (APIO17_merchant) C++14
100 / 100
118 ms 10568 KB
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define maxn 101
#define maxk 1010
int N, M, K;
const ll inf = 1e18;

ll dist[maxn][maxn];
ll buy[maxn][maxk];
ll sell[maxn][maxk];
ll profit[maxn][maxn];
ll d2[maxn][maxn];

bool check(ll val) {
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			d2[i][j] = profit[i][j] - val*min(inf/val, dist[i][j]);
		}
		
	}
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			for (int k = 1; k <= N; k++) {
				d2[j][k] = max(d2[j][k], d2[j][i] + d2[i][k]);
			}
		}
	}

	for (int i = 1; i <= N; i++) {
		if (d2[i][i] >= 0) return true;
	}
	return false;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> N >> M >> K;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			dist[i][j] = inf;
		}
		dist[i][i] = inf;
	}
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= K; j++) {
			cin >> buy[i][j] >> sell[i][j];
		}
	}
	int vp, wp; ll tp;
	for (int i = 0; i < M; i++) {
		cin >> vp >> wp >> tp;
		dist[vp][wp] = min(dist[vp][wp], tp);
	}

	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			for (int k = 1; k <= N; k++) {
				dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
			}
		}
	}
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (i == j) continue;
			for (int k = 1; k <= K; k++) {
				if (buy[i][k] == -1 || sell[j][k] == -1) continue;
				profit[i][j] = max(profit[i][j], sell[j][k] - buy[i][k]);
			}
		}
	}

	ll lo = 0LL;
	ll hi = 1e12;
	while (lo < hi) {
		ll mid = (lo+hi+1)/2LL;
		if (check(mid)) {
			lo = mid;
		}
		else hi = mid-1;
	}
	cout << lo << endl;

}
# Verdict Execution time Memory Grader output
1 Correct 86 ms 2168 KB Output is correct
2 Correct 59 ms 2168 KB Output is correct
3 Correct 54 ms 2168 KB Output is correct
4 Correct 10 ms 2168 KB Output is correct
5 Correct 9 ms 2168 KB Output is correct
6 Correct 9 ms 2168 KB Output is correct
7 Correct 11 ms 2168 KB Output is correct
8 Correct 2 ms 2168 KB Output is correct
9 Correct 9 ms 2168 KB Output is correct
10 Correct 10 ms 2168 KB Output is correct
11 Correct 10 ms 2168 KB Output is correct
12 Correct 2 ms 2168 KB Output is correct
13 Correct 10 ms 2168 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 2168 KB Output is correct
2 Correct 10 ms 2168 KB Output is correct
3 Correct 10 ms 2168 KB Output is correct
4 Correct 9 ms 2168 KB Output is correct
5 Correct 10 ms 2168 KB Output is correct
6 Correct 2 ms 2168 KB Output is correct
7 Correct 10 ms 2168 KB Output is correct
8 Correct 10 ms 2168 KB Output is correct
9 Correct 10 ms 2168 KB Output is correct
10 Correct 10 ms 2168 KB Output is correct
11 Correct 10 ms 2168 KB Output is correct
12 Correct 10 ms 2168 KB Output is correct
13 Correct 10 ms 2168 KB Output is correct
14 Correct 10 ms 2168 KB Output is correct
15 Correct 11 ms 2168 KB Output is correct
16 Correct 12 ms 2168 KB Output is correct
17 Correct 10 ms 2168 KB Output is correct
18 Correct 3 ms 2168 KB Output is correct
19 Correct 11 ms 2168 KB Output is correct
20 Correct 10 ms 2168 KB Output is correct
21 Correct 11 ms 2168 KB Output is correct
22 Correct 10 ms 2168 KB Output is correct
23 Correct 10 ms 2168 KB Output is correct
24 Correct 9 ms 2168 KB Output is correct
25 Correct 11 ms 2168 KB Output is correct
26 Correct 2 ms 2168 KB Output is correct
27 Correct 9 ms 2168 KB Output is correct
28 Correct 10 ms 2168 KB Output is correct
29 Correct 10 ms 2168 KB Output is correct
30 Correct 2 ms 2168 KB Output is correct
31 Correct 10 ms 2168 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 62 ms 2452 KB Output is correct
2 Correct 116 ms 3056 KB Output is correct
3 Correct 60 ms 3056 KB Output is correct
4 Correct 60 ms 3056 KB Output is correct
5 Correct 60 ms 3056 KB Output is correct
6 Correct 57 ms 3056 KB Output is correct
7 Correct 10 ms 2168 KB Output is correct
8 Correct 3 ms 2168 KB Output is correct
9 Correct 11 ms 2168 KB Output is correct
10 Correct 10 ms 2168 KB Output is correct
11 Correct 11 ms 2168 KB Output is correct
12 Correct 10 ms 2168 KB Output is correct
13 Correct 10 ms 2168 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 2168 KB Output is correct
2 Correct 10 ms 2168 KB Output is correct
3 Correct 10 ms 2168 KB Output is correct
4 Correct 9 ms 2168 KB Output is correct
5 Correct 10 ms 2168 KB Output is correct
6 Correct 2 ms 2168 KB Output is correct
7 Correct 10 ms 2168 KB Output is correct
8 Correct 10 ms 2168 KB Output is correct
9 Correct 10 ms 2168 KB Output is correct
10 Correct 10 ms 2168 KB Output is correct
11 Correct 10 ms 2168 KB Output is correct
12 Correct 10 ms 2168 KB Output is correct
13 Correct 10 ms 2168 KB Output is correct
14 Correct 10 ms 2168 KB Output is correct
15 Correct 11 ms 2168 KB Output is correct
16 Correct 12 ms 2168 KB Output is correct
17 Correct 62 ms 2452 KB Output is correct
18 Correct 116 ms 3056 KB Output is correct
19 Correct 60 ms 3056 KB Output is correct
20 Correct 60 ms 3056 KB Output is correct
21 Correct 60 ms 3056 KB Output is correct
22 Correct 57 ms 3056 KB Output is correct
23 Correct 10 ms 2168 KB Output is correct
24 Correct 3 ms 2168 KB Output is correct
25 Correct 11 ms 2168 KB Output is correct
26 Correct 10 ms 2168 KB Output is correct
27 Correct 11 ms 2168 KB Output is correct
28 Correct 10 ms 2168 KB Output is correct
29 Correct 10 ms 2168 KB Output is correct
30 Correct 57 ms 3056 KB Output is correct
31 Correct 58 ms 3056 KB Output is correct
32 Correct 82 ms 3660 KB Output is correct
33 Correct 57 ms 3660 KB Output is correct
34 Correct 58 ms 3660 KB Output is correct
35 Correct 60 ms 3660 KB Output is correct
36 Correct 114 ms 5772 KB Output is correct
37 Correct 2 ms 5772 KB Output is correct
38 Correct 2 ms 5772 KB Output is correct
39 Correct 55 ms 5772 KB Output is correct
40 Correct 58 ms 5772 KB Output is correct
41 Correct 56 ms 5772 KB Output is correct
42 Correct 59 ms 5772 KB Output is correct
43 Correct 56 ms 5772 KB Output is correct
44 Correct 3 ms 5772 KB Output is correct
45 Correct 12 ms 5772 KB Output is correct
46 Correct 11 ms 5772 KB Output is correct
47 Correct 11 ms 5772 KB Output is correct
48 Correct 118 ms 8464 KB Output is correct
49 Correct 118 ms 10568 KB Output is correct
50 Correct 2 ms 10568 KB Output is correct
51 Correct 86 ms 2168 KB Output is correct
52 Correct 59 ms 2168 KB Output is correct
53 Correct 54 ms 2168 KB Output is correct
54 Correct 10 ms 2168 KB Output is correct
55 Correct 9 ms 2168 KB Output is correct
56 Correct 9 ms 2168 KB Output is correct
57 Correct 11 ms 2168 KB Output is correct
58 Correct 2 ms 2168 KB Output is correct
59 Correct 9 ms 2168 KB Output is correct
60 Correct 10 ms 2168 KB Output is correct
61 Correct 10 ms 2168 KB Output is correct
62 Correct 2 ms 2168 KB Output is correct
63 Correct 10 ms 2168 KB Output is correct