oj.uz

답안 #409552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
409552 2021-05-21T04:38:03 Z CursedCode 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 121 ms 4208 KB 
#include <bits/stdc++.h>
using namespace std;
 
long long n,m,k;
long long buy[105][1005],sell[105][1005];
long long adj[105][105],efficent[105][105];
long long profit[105][105];
const long long inf=2e9;
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 <= k;j++) cin >> buy[i][j] >> sell[i][j];
	}
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= n;j++) adj[i][j] = inf;
	}
	for(int i = 1;i <= m;i++){
		long long u,v,w;
		cin >> u >> v >> w;
		adj[u][v] = w;
	}
	for(int l = 1;l <= n;l++){
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= n;j++){
				adj[i][j] = min(adj[i][j] , adj[i][l] + adj[l][j]);
			}
		}
	}
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= n;j++){
			if(adj[i][j] >= inf){
				profit[i][j] = -inf;
				continue;
			}
			for(int cnt = 1;cnt <= k;cnt++){
				if(sell[j][cnt] == -1 || buy[i][cnt] == -1) continue;
				profit[i][j] = max(profit[i][j] , sell[j][cnt] - buy[i][cnt]);
			}
		}
	}
	long long lower = 0,higher = inf;
	while(lower<higher){
		long long mid = (lower + higher + 1) / 2;
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= n;j++){
				if(adj[i][j] >= inf) efficent[i][j] = -inf;
				else efficent[i][j] = profit[i][j] - mid * adj[i][j];
			}
		}
		for(int l=1;l<=n;l++){
			for(int i = 1;i <= n;i++){
				for(int j = 1;j <= n;j++){
					if(adj[i][l] >= inf || adj[j][l] >= inf) continue;
					efficent[i][j] = max(efficent[i][j] , efficent[i][l] + efficent[l][j]);
				}
			}
		}
		bool check = false;
		for(int i = 1;i <= n;i++){
			if(efficent[i][i] >= 0){
				check = true;
				break;
			}
		}
		if(check) lower=mid;
		else higher=mid-1;
	}
	cout << lower << '\n';
 	return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 3272 KB Output is correct
2 Correct 49 ms 1228 KB Output is correct
3 Correct 51 ms 1228 KB Output is correct
4 Correct 8 ms 808 KB Output is correct
5 Correct 8 ms 716 KB Output is correct
6 Correct 8 ms 716 KB Output is correct
7 Correct 9 ms 872 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 8 ms 716 KB Output is correct
10 Correct 8 ms 704 KB Output is correct
11 Correct 8 ms 716 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 8 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 716 KB Output is correct
2 Correct 9 ms 872 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 8 ms 716 KB Output is correct
5 Correct 8 ms 704 KB Output is correct
6 Correct 8 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 8 ms 844 KB Output is correct
9 Correct 8 ms 844 KB Output is correct
10 Correct 8 ms 716 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 11 ms 872 KB Output is correct
13 Correct 10 ms 844 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 9 ms 836 KB Output is correct
16 Correct 7 ms 844 KB Output is correct
17 Correct 7 ms 844 KB Output is correct
18 Correct 7 ms 844 KB Output is correct
19 Correct 9 ms 936 KB Output is correct
20 Correct 10 ms 936 KB Output is correct
21 Correct 8 ms 872 KB Output is correct
22 Correct 8 ms 844 KB Output is correct
23 Correct 11 ms 844 KB Output is correct
24 Correct 8 ms 836 KB Output is correct
25 Correct 11 ms 844 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 10 ms 904 KB Output is correct
28 Correct 9 ms 848 KB Output is correct
29 Correct 8 ms 844 KB Output is correct
30 Correct 9 ms 876 KB Output is correct
31 Correct 7 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 844 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 10 ms 904 KB Output is correct
4 Correct 9 ms 848 KB Output is correct
5 Correct 8 ms 844 KB Output is correct
6 Correct 9 ms 876 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 58 ms 1612 KB Output is correct
9 Correct 107 ms 3588 KB Output is correct
10 Correct 56 ms 1484 KB Output is correct
11 Correct 58 ms 1740 KB Output is correct
12 Correct 58 ms 1736 KB Output is correct
13 Correct 56 ms 1504 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 844 KB Output is correct
2 Correct 8 ms 716 KB Output is correct
3 Correct 8 ms 896 KB Output is correct
4 Correct 11 ms 872 KB Output is correct
5 Correct 10 ms 844 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 9 ms 836 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 7 ms 844 KB Output is correct
10 Correct 7 ms 844 KB Output is correct
11 Correct 9 ms 936 KB Output is correct
12 Correct 10 ms 936 KB Output is correct
13 Correct 8 ms 872 KB Output is correct
14 Correct 8 ms 844 KB Output is correct
15 Correct 11 ms 844 KB Output is correct
16 Correct 8 ms 836 KB Output is correct
17 Correct 58 ms 1612 KB Output is correct
18 Correct 107 ms 3588 KB Output is correct
19 Correct 56 ms 1484 KB Output is correct
20 Correct 58 ms 1740 KB Output is correct
21 Correct 58 ms 1736 KB Output is correct
22 Correct 56 ms 1504 KB Output is correct
23 Correct 11 ms 844 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 10 ms 904 KB Output is correct
26 Correct 9 ms 848 KB Output is correct
27 Correct 8 ms 844 KB Output is correct
28 Correct 9 ms 876 KB Output is correct
29 Correct 7 ms 844 KB Output is correct
30 Correct 81 ms 3272 KB Output is correct
31 Correct 49 ms 1228 KB Output is correct
32 Correct 51 ms 1228 KB Output is correct
33 Correct 8 ms 808 KB Output is correct
34 Correct 8 ms 716 KB Output is correct
35 Correct 8 ms 716 KB Output is correct
36 Correct 9 ms 872 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 8 ms 716 KB Output is correct
39 Correct 8 ms 704 KB Output is correct
40 Correct 8 ms 716 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 8 ms 844 KB Output is correct
43 Correct 55 ms 1392 KB Output is correct
44 Correct 54 ms 1588 KB Output is correct
45 Correct 75 ms 2516 KB Output is correct
46 Correct 59 ms 1576 KB Output is correct
47 Correct 59 ms 1588 KB Output is correct
48 Correct 54 ms 1600 KB Output is correct
49 Correct 112 ms 4052 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 52 ms 1356 KB Output is correct
53 Correct 54 ms 1356 KB Output is correct
54 Correct 61 ms 1356 KB Output is correct
55 Correct 49 ms 1420 KB Output is correct
56 Correct 57 ms 1228 KB Output is correct
57 Correct 1 ms 316 KB Output is correct
58 Correct 9 ms 1020 KB Output is correct
59 Correct 9 ms 972 KB Output is correct
60 Correct 8 ms 972 KB Output is correct
61 Correct 121 ms 4208 KB Output is correct
62 Correct 116 ms 4164 KB Output is correct
63 Correct 1 ms 332 KB Output is correct