Submission #329188

# Submission time Handle Problem Language Result Execution time Memory
329188 2020-11-19T16:32:22 Z faresbasbs Travelling Merchant (APIO17_merchant) C++17
100 / 100
98 ms 4204 KB
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
long long n,m,kk,buy[101][1001],sell[101][1001],graph[101][101],graph2[101][101],profit[101][101];

void floyd(long long adj[101][101]){
	for(int k = 1 ; k <= n ; k += 1){
		for(int i = 1 ; i <= n ; i += 1){
			for(int j = 1 ; j <= n ; j += 1){
				adj[i][j] = min(adj[i][j],adj[i][k]+adj[k][j]);
			}
		}
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cout.tie(NULL);
	cin.tie(NULL);
	cin >> n >> m >> kk;
	for(int i = 1 ; i <= n ; i += 1){
		for(int j = 1 ; j <= n ; j += 1){
			graph[i][j] = INF;
		}
		for(int j = 1 ; j <= kk ; j += 1){
			cin >> buy[i][j] >> sell[i][j];
		}
	}
	for(int i = 0 ; i < m ; i += 1){
		int a,b,c;
		cin >> a >> b >> c;
		graph[a][b] = c;
	}
	floyd(graph);
	for(int i = 1 ; i <= n ; i += 1){
		for(int j = 1 ; j <= n ; j += 1){
			for(int k = 1 ; k <= kk ; k += 1){
				if(sell[j][k] != -1 && buy[i][k] != -1){
					profit[i][j] = max(profit[i][j],sell[j][k]-buy[i][k]);
				}
			}
		}
	}
	long long first = 0 , last = INF;
	while(last-first > 1){
		long long mid = (first+last)/2;
		for(int i = 1 ; i <= n ; i += 1){
			for(int j = 1 ; j <= n ; j += 1){
				graph2[i][j] = mid*graph[i][j] - profit[i][j];
			}
		}
		floyd(graph2);
		bool good = false;
		for(int i = 1 ; i <= n ; i += 1){
			if(graph2[i][i] <= 0){
				good = true;
				break;
			}
		}
		if(good){
			first = mid;
		}else{
			last = mid;
		}
	}
	cout << first << endl;
}
# Verdict Execution time Memory Grader output
1 Correct 69 ms 3308 KB Output is correct
2 Correct 34 ms 1260 KB Output is correct
3 Correct 35 ms 1260 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 6 ms 876 KB Output is correct
6 Correct 7 ms 876 KB Output is correct
7 Correct 6 ms 876 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 7 ms 876 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 876 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 6 ms 876 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 7 ms 1004 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 6 ms 876 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 7 ms 1004 KB Output is correct
12 Correct 7 ms 1004 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
14 Correct 6 ms 876 KB Output is correct
15 Correct 9 ms 1004 KB Output is correct
16 Correct 6 ms 876 KB Output is correct
17 Correct 8 ms 1004 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 7 ms 1004 KB Output is correct
20 Correct 7 ms 1004 KB Output is correct
21 Correct 7 ms 1004 KB Output is correct
22 Correct 6 ms 876 KB Output is correct
23 Correct 6 ms 876 KB Output is correct
24 Correct 7 ms 876 KB Output is correct
25 Correct 6 ms 876 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 6 ms 876 KB Output is correct
28 Correct 6 ms 876 KB Output is correct
29 Correct 7 ms 876 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 6 ms 876 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 43 ms 1644 KB Output is correct
2 Correct 89 ms 3948 KB Output is correct
3 Correct 39 ms 1644 KB Output is correct
4 Correct 44 ms 1772 KB Output is correct
5 Correct 42 ms 1772 KB Output is correct
6 Correct 38 ms 1516 KB Output is correct
7 Correct 8 ms 1004 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 7 ms 1004 KB Output is correct
10 Correct 7 ms 1004 KB Output is correct
11 Correct 7 ms 1004 KB Output is correct
12 Correct 6 ms 876 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 876 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 6 ms 876 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 7 ms 1004 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 6 ms 876 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 7 ms 1004 KB Output is correct
12 Correct 7 ms 1004 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
14 Correct 6 ms 876 KB Output is correct
15 Correct 9 ms 1004 KB Output is correct
16 Correct 6 ms 876 KB Output is correct
17 Correct 43 ms 1644 KB Output is correct
18 Correct 89 ms 3948 KB Output is correct
19 Correct 39 ms 1644 KB Output is correct
20 Correct 44 ms 1772 KB Output is correct
21 Correct 42 ms 1772 KB Output is correct
22 Correct 38 ms 1516 KB Output is correct
23 Correct 8 ms 1004 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 7 ms 1004 KB Output is correct
26 Correct 7 ms 1004 KB Output is correct
27 Correct 7 ms 1004 KB Output is correct
28 Correct 6 ms 876 KB Output is correct
29 Correct 6 ms 876 KB Output is correct
30 Correct 36 ms 1388 KB Output is correct
31 Correct 39 ms 1664 KB Output is correct
32 Correct 55 ms 2668 KB Output is correct
33 Correct 38 ms 1644 KB Output is correct
34 Correct 38 ms 1644 KB Output is correct
35 Correct 38 ms 1644 KB Output is correct
36 Correct 95 ms 4076 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 35 ms 1388 KB Output is correct
40 Correct 47 ms 1516 KB Output is correct
41 Correct 37 ms 1516 KB Output is correct
42 Correct 36 ms 1388 KB Output is correct
43 Correct 36 ms 1388 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 8 ms 1004 KB Output is correct
46 Correct 8 ms 1004 KB Output is correct
47 Correct 8 ms 1004 KB Output is correct
48 Correct 98 ms 4204 KB Output is correct
49 Correct 98 ms 4204 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 69 ms 3308 KB Output is correct
52 Correct 34 ms 1260 KB Output is correct
53 Correct 35 ms 1260 KB Output is correct
54 Correct 6 ms 876 KB Output is correct
55 Correct 6 ms 876 KB Output is correct
56 Correct 7 ms 876 KB Output is correct
57 Correct 6 ms 876 KB Output is correct
58 Correct 1 ms 492 KB Output is correct
59 Correct 6 ms 876 KB Output is correct
60 Correct 6 ms 876 KB Output is correct
61 Correct 7 ms 876 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 6 ms 876 KB Output is correct