답안 #256455

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
256455 2020-08-02T17:38:50 Z maximath_1 여행하는 상인 (APIO17_merchant) C++11
100 / 100
119 ms 4220 KB
#include <iostream>
using namespace std;

#define ll long long
int n, m, k;
const ll inf = 1e18 + 69;
ll dist[105][105], profit[105][105];
ll res[105][105];
ll buy[105][1005], sell[105][1005];

bool check(ll penalty){
	for(int u = 1; u <= n; u ++) for(int v = 1; v <= n; v ++){
		if(dist[u][v] == inf) res[u][v] = -inf;
		else res[u][v] = max((ll)profit[u][v] - dist[u][v] * 1ll * penalty, -inf);
	}
	for(int u = 1; u <= n; u ++) res[u][u] = -inf;
	ll ans = -inf;
	for(int z = 1; z <= n; z ++){
		for(int x = 1; x <= n; x ++) for(int y = 1; y <= n; y ++){
			res[x][y] = max(res[x][z] + res[z][y], res[x][y]);
			ans = max(ans, res[x][x]);
		}
	}
	if(ans >= 0ll) return true;
	return false;
}

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	cin >> n >> m >> k;
	for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++){
		if(i != j) dist[i][j] = inf;
		else dist[i][j] = 0;
	}
	for(int i = 1; i <= n; i ++)
		for(int j = 1; j <= k; j ++)
			cin >> buy[i][j] >> sell[i][j];
	for(int u, v, wt, i = 1; i <= m; i ++){
		cin >> u >> v >> wt;
		dist[u][v] = wt;
	}

	for(int z = 1; z <= n; z ++)
		for(int x = 1; x <= n; x ++)
			for(int y = 1; y <= n; y ++)
				dist[x][y] = min(dist[x][y], dist[x][z] + dist[z][y]);

	for(int x = 1; x <= n; x ++)
		for(int y = 1; y <= n; y ++){
			profit[x][y] = 0ll;
			if(x != y)
				for(int z = 1; z <= k; z ++){
					if(buy[x][z] == -1 || sell[y][z] == -1) continue;
					profit[x][y] = max(profit[x][y], sell[y][z] - buy[x][z]);
				}
		}

	ll lf = 1, rg = 1000000007ll, res = 0ll;
	for(int md; lf <= rg;){
		md = (lf + rg) / 2;
		if(check(md)){
			res = md;
			lf = md + 1;
		}else{
			rg = md - 1;
		}
	}

	cout << res << endl;
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 3448 KB Output is correct
2 Correct 47 ms 1408 KB Output is correct
3 Correct 49 ms 1408 KB Output is correct
4 Correct 10 ms 1024 KB Output is correct
5 Correct 7 ms 896 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 8 ms 928 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 896 KB Output is correct
2 Correct 8 ms 896 KB Output is correct
3 Correct 8 ms 896 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 8 ms 896 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 7 ms 896 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 9 ms 896 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 9 ms 896 KB Output is correct
16 Correct 7 ms 896 KB Output is correct
17 Correct 8 ms 896 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 9 ms 896 KB Output is correct
20 Correct 9 ms 896 KB Output is correct
21 Correct 8 ms 896 KB Output is correct
22 Correct 7 ms 896 KB Output is correct
23 Correct 7 ms 896 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 8 ms 928 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 10 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 7 ms 896 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 8 ms 896 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 1664 KB Output is correct
2 Correct 107 ms 3960 KB Output is correct
3 Correct 52 ms 1536 KB Output is correct
4 Correct 55 ms 1792 KB Output is correct
5 Correct 55 ms 1792 KB Output is correct
6 Correct 50 ms 1536 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 896 KB Output is correct
2 Correct 8 ms 896 KB Output is correct
3 Correct 8 ms 896 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 8 ms 896 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 7 ms 896 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 9 ms 896 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 9 ms 896 KB Output is correct
16 Correct 7 ms 896 KB Output is correct
17 Correct 54 ms 1664 KB Output is correct
18 Correct 107 ms 3960 KB Output is correct
19 Correct 52 ms 1536 KB Output is correct
20 Correct 55 ms 1792 KB Output is correct
21 Correct 55 ms 1792 KB Output is correct
22 Correct 50 ms 1536 KB Output is correct
23 Correct 8 ms 896 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 9 ms 896 KB Output is correct
26 Correct 9 ms 896 KB Output is correct
27 Correct 8 ms 896 KB Output is correct
28 Correct 7 ms 896 KB Output is correct
29 Correct 7 ms 896 KB Output is correct
30 Correct 51 ms 1484 KB Output is correct
31 Correct 51 ms 1536 KB Output is correct
32 Correct 71 ms 2680 KB Output is correct
33 Correct 51 ms 1536 KB Output is correct
34 Correct 53 ms 1536 KB Output is correct
35 Correct 53 ms 1536 KB Output is correct
36 Correct 119 ms 4076 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 53 ms 1408 KB Output is correct
40 Correct 51 ms 1536 KB Output is correct
41 Correct 61 ms 1536 KB Output is correct
42 Correct 61 ms 1408 KB Output is correct
43 Correct 49 ms 1460 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 16 ms 1024 KB Output is correct
46 Correct 16 ms 1024 KB Output is correct
47 Correct 10 ms 1024 KB Output is correct
48 Correct 113 ms 4220 KB Output is correct
49 Correct 117 ms 4216 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 75 ms 3448 KB Output is correct
52 Correct 47 ms 1408 KB Output is correct
53 Correct 49 ms 1408 KB Output is correct
54 Correct 10 ms 1024 KB Output is correct
55 Correct 7 ms 896 KB Output is correct
56 Correct 7 ms 896 KB Output is correct
57 Correct 8 ms 928 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 10 ms 896 KB Output is correct
60 Correct 11 ms 896 KB Output is correct
61 Correct 7 ms 896 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 8 ms 896 KB Output is correct