Submission #308273

# Submission time Handle Problem Language Result Execution time Memory
308273 2020-09-30T17:20:00 Z shivensinha4 Travelling Merchant (APIO17_merchant) C++17
100 / 100
117 ms 8312 KB
#include <bits/stdc++.h> 
using namespace std; 
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'

const int MXN = 100;
const ll INF = 1e15;

ll dist[MXN+1][MXN+1], gain[MXN+1][MXN+1], aux[MXN+1][MXN+1];

int main() {
	#ifdef shiven
	freopen("test.in", "r", stdin);
	#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n, m, k; cin >> n >> m >> k;
	vector<vector<vector<ll>>> cost(n, vector<vector<ll>>(k, vector<ll>(2)));
	
	for_(i, 0, n) for_(j, 0, k) cin >> cost[i][j][0] >> cost[i][j][1];
	for_(i, 0, n) for_(j, 0, n) dist[i][j] = INF;
	for_(i, 0, m) {
		int a, b; ll w; cin >> a >> b >> w;
		a -= 1; b -= 1;
		dist[a][b] = min(dist[a][b], w);
	}
	
	for_(p, 0, n) for_(i, 0, n) for_(j, 0, n) dist[i][j] = min(dist[i][j], dist[i][p]+dist[p][j]);
	
	for_(i, 0, n) for_(j, 0, n) {
		for_(p, 0, k) if (cost[i][p][0] != -1 and cost[j][p][1] != -1) gain[i][j] = max(gain[i][j], cost[j][p][1]-cost[i][p][0]);
	}
	
	ll lo = 0, hi = 1e9+1, ans = 0;
	while (lo < hi) {
		ll mid = (lo+hi) / 2;
		for_(i, 0, n) for_(j, 0, n) {
			if (dist[i][j] != INF) aux[i][j] = mid * dist[i][j] - gain[i][j];
			else aux[i][j] = INF;
		}
		
		bool valid = false;
		for_(p, 0, n) for_(i, 0, n) for_(j, 0, n) aux[i][j] = min(aux[i][j], aux[i][p]+aux[p][j]);
		for_(i, 0, n) if (aux[i][i] <= 0) {
			valid = true;
			break;
		}
		
		//cout << mid << " " << valid << endl;
		if (valid) {
			lo = mid+1; ans = mid;
		} else hi = mid;
	}
	
	cout << ans << endl;
	

	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 80 ms 6136 KB Output is correct
2 Correct 38 ms 512 KB Output is correct
3 Correct 39 ms 512 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 8 ms 512 KB Output is correct
3 Correct 8 ms 640 KB Output is correct
4 Correct 6 ms 768 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 7 ms 640 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 7 ms 640 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 640 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 7 ms 640 KB Output is correct
20 Correct 7 ms 640 KB Output is correct
21 Correct 8 ms 640 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 7 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 46 ms 1152 KB Output is correct
2 Correct 114 ms 5532 KB Output is correct
3 Correct 41 ms 768 KB Output is correct
4 Correct 46 ms 1272 KB Output is correct
5 Correct 46 ms 1280 KB Output is correct
6 Correct 43 ms 896 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 7 ms 640 KB Output is correct
11 Correct 8 ms 640 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 8 ms 512 KB Output is correct
3 Correct 8 ms 640 KB Output is correct
4 Correct 6 ms 768 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 7 ms 640 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 7 ms 640 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 640 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 46 ms 1152 KB Output is correct
18 Correct 114 ms 5532 KB Output is correct
19 Correct 41 ms 768 KB Output is correct
20 Correct 46 ms 1272 KB Output is correct
21 Correct 46 ms 1280 KB Output is correct
22 Correct 43 ms 896 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 7 ms 640 KB Output is correct
26 Correct 7 ms 640 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 39 ms 640 KB Output is correct
31 Correct 44 ms 1152 KB Output is correct
32 Correct 82 ms 5624 KB Output is correct
33 Correct 42 ms 1152 KB Output is correct
34 Correct 42 ms 1152 KB Output is correct
35 Correct 42 ms 1152 KB Output is correct
36 Correct 112 ms 8184 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 39 ms 640 KB Output is correct
40 Correct 42 ms 768 KB Output is correct
41 Correct 42 ms 820 KB Output is correct
42 Correct 39 ms 792 KB Output is correct
43 Correct 39 ms 640 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 8 ms 896 KB Output is correct
46 Correct 9 ms 896 KB Output is correct
47 Correct 8 ms 896 KB Output is correct
48 Correct 112 ms 8184 KB Output is correct
49 Correct 117 ms 8312 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 80 ms 6136 KB Output is correct
52 Correct 38 ms 512 KB Output is correct
53 Correct 39 ms 512 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 6 ms 384 KB Output is correct
56 Correct 6 ms 384 KB Output is correct
57 Correct 6 ms 512 KB Output is correct
58 Correct 1 ms 308 KB Output is correct
59 Correct 6 ms 384 KB Output is correct
60 Correct 6 ms 384 KB Output is correct
61 Correct 6 ms 384 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 7 ms 512 KB Output is correct