oj.uz

답안 #561678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561678 2022-05-13T10:52:36 Z Garguy22 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 150 ms 4204 KB 
#include <iostream>
using namespace std;

typedef long long ll;

const int MAXN = 107;
const ll INF = 1e18 + 7;

int n, m, kk;
ll b[MAXN][1007], s[MAXN][1007];
ll graph[MAXN][MAXN], adj[MAXN][MAXN], profit[MAXN][MAXN];

void shortest_path(ll dis[MAXN][MAXN]){
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			for(int k = 1; k <= n; k++)
				dis[j][k] = min(dis[j][k], dis[j][i] + dis[i][k]);
		}
	}
}

int main(){
	cin >> n >> m >> kk;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= kk; j++)
			cin >> b[i][j] >> s[i][j];
	}
	for(int i = 1; i <= n; i++){
	    for(int j = 1; j <= n; j++)
	        graph[i][j] = INF;
	}
	for(int i = 1; i <= m; i++){
		int x, y, z;
		cin >> x >> y >> z;
		graph[x][y] = z;
	}
	shortest_path(graph);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			for(int k = 1; k <= kk; k++){
				if(s[j][k] != -1 && b[i][k] != -1){
					profit[i][j] = max(profit[i][j], s[j][k] - b[i][k]);
				}
			}
		}
	}
	ll lef = 1, rig = 1e9;
	while(lef <= rig){
		ll mid = (lef + rig)/2;
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++)
				adj[i][j] = mid*min(graph[i][j], INF/mid) - profit[i][j];
		}
		shortest_path(adj);
		bool check = 0;
		for(int i = 1; i <= n; i++){
			if(adj[i][i] <= 0)
				check = 1;
		}
		if(check) 
			lef = mid + 1;
		else
			rig = mid - 1;
	}
	cout << rig << endl;

	return 0;	
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 3216 KB Output is correct
2 Correct 29 ms 1236 KB Output is correct
3 Correct 33 ms 1236 KB Output is correct
4 Correct 5 ms 824 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 7 ms 828 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 8 ms 760 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 7 ms 828 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 6 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 8 ms 760 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 6 ms 884 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 10 ms 916 KB Output is correct
14 Correct 1 ms 276 KB Output is correct
15 Correct 6 ms 840 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 6 ms 848 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 11 ms 904 KB Output is correct
20 Correct 7 ms 852 KB Output is correct
21 Correct 6 ms 832 KB Output is correct
22 Correct 6 ms 872 KB Output is correct
23 Correct 8 ms 852 KB Output is correct
24 Correct 6 ms 724 KB Output is correct
25 Correct 7 ms 896 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 7 ms 920 KB Output is correct
28 Correct 9 ms 832 KB Output is correct
29 Correct 8 ms 832 KB Output is correct
30 Correct 6 ms 868 KB Output is correct
31 Correct 5 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 896 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 7 ms 920 KB Output is correct
4 Correct 9 ms 832 KB Output is correct
5 Correct 8 ms 832 KB Output is correct
6 Correct 6 ms 868 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 39 ms 1620 KB Output is correct
9 Correct 132 ms 3880 KB Output is correct
10 Correct 35 ms 1492 KB Output is correct
11 Correct 41 ms 1620 KB Output is correct
12 Correct 44 ms 1620 KB Output is correct
13 Correct 37 ms 1492 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 6 ms 724 KB Output is correct
3 Correct 6 ms 884 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 10 ms 916 KB Output is correct
6 Correct 1 ms 276 KB Output is correct
7 Correct 6 ms 840 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 6 ms 848 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 11 ms 904 KB Output is correct
12 Correct 7 ms 852 KB Output is correct
13 Correct 6 ms 832 KB Output is correct
14 Correct 6 ms 872 KB Output is correct
15 Correct 8 ms 852 KB Output is correct
16 Correct 6 ms 724 KB Output is correct
17 Correct 39 ms 1620 KB Output is correct
18 Correct 132 ms 3880 KB Output is correct
19 Correct 35 ms 1492 KB Output is correct
20 Correct 41 ms 1620 KB Output is correct
21 Correct 44 ms 1620 KB Output is correct
22 Correct 37 ms 1492 KB Output is correct
23 Correct 7 ms 896 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 7 ms 920 KB Output is correct
26 Correct 9 ms 832 KB Output is correct
27 Correct 8 ms 832 KB Output is correct
28 Correct 6 ms 868 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 99 ms 3216 KB Output is correct
31 Correct 29 ms 1236 KB Output is correct
32 Correct 33 ms 1236 KB Output is correct
33 Correct 5 ms 824 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 7 ms 828 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 6 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 8 ms 760 KB Output is correct
43 Correct 32 ms 1492 KB Output is correct
44 Correct 38 ms 1492 KB Output is correct
45 Correct 66 ms 2616 KB Output is correct
46 Correct 34 ms 1492 KB Output is correct
47 Correct 40 ms 1492 KB Output is correct
48 Correct 36 ms 1472 KB Output is correct
49 Correct 150 ms 3976 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 30 ms 1364 KB Output is correct
53 Correct 37 ms 1456 KB Output is correct
54 Correct 32 ms 1364 KB Output is correct
55 Correct 36 ms 1468 KB Output is correct
56 Correct 41 ms 1236 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 9 ms 960 KB Output is correct
59 Correct 9 ms 980 KB Output is correct
60 Correct 10 ms 960 KB Output is correct
61 Correct 143 ms 4204 KB Output is correct
62 Correct 141 ms 4172 KB Output is correct
63 Correct 1 ms 340 KB Output is correct