oj.uz

Submission #366438

# Submission time Handle Problem Language Result Execution time Memory
366438 2021-02-14T08:02:31 Z alireza_kaviani Travelling Merchant (APIO17_merchant) C++11
100 / 100
 110 ms 4332 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define all(x)						(x).begin(),(x).end()
#define X							first
#define Y							second
#define sep							' '
#define endl						'\n'
#define SZ(x)						ll(x.size())

const ll MAXN = 100 + 10;
const ll MAXK = 1000 + 10;
const ll LOG = 22;
const ll INF = 2e18;
const ll MOD = 1e9 + 7; //998244353; //1e9 + 9;

ll n , m , k , adj[2][MAXN][MAXN] , cost[MAXN][MAXN] , sell[MAXN][MAXK] , buy[MAXN][MAXK];

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

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

	cin >> n >> m >> k;
	for(int i = 0 ; i < n ; i++){
		for(int j = 0 ; j < k ; j++){
			cin >> buy[i][j] >> sell[i][j];
		}
		fill(adj[0][i] , adj[0][i] + MAXN , INF);
		//adj[0][i][i] = 0;
	}
	for(int i = 0 ; i < m ; i++){
		int v , u , w;
		cin >> v >> u >> w;	v--; u--;
		adj[0][v][u] = w;
	}
	for(int i = 0 ; i < n ; i++){
		for(int j = 0 ; j < n ; j++){
			cost[i][j] = 0;
			for(int l = 0 ; l < k ; l++){
				if(buy[i][l] == -1 || sell[j][l] == -1)	continue;
				cost[i][j] = min(cost[i][j] , buy[i][l] - sell[j][l]);
			}
//			cout << i << sep << j << sep << cost[i][j] << endl;
		}
	}
	floyd(0);
	ll l = 0 , r = 1e11 + 10;
	while(r - l > 1){
		ll mid = l + r >> 1;
//		cout << mid << endl;
		for(int i = 0 ; i < n ; i++){
			for(int j = 0 ; j < n ; j++){
				if(adj[0][i][j] >= INF / mid){
					adj[1][i][j] = INF;
					continue;
				}
				adj[1][i][j] = min(INF , adj[0][i][j] * mid + cost[i][j]);
//				cout << i << sep << j << sep << adj[0][i][j] << sep << adj[1][i][j] << endl;
			}
		}
//		cout << "==============" << endl;
		floyd(1);
		int flag = 0;
		for(int i = 0 ; i < n ; i++)	if(adj[1][i][i] <= 0)	flag = 1;
		if(flag)	l = mid;
		else	r = mid;
	}
	cout << l << endl;


    return 0;
}
/*

*/

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:62:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |   ll mid = l + r >> 1;
      |            ~~^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 2156 KB Output is correct
2 Correct 46 ms 1388 KB Output is correct
3 Correct 52 ms 1516 KB Output is correct
4 Correct 7 ms 876 KB Output is correct
5 Correct 7 ms 876 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 8 ms 876 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 7 ms 876 KB Output is correct
10 Correct 7 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 8 ms 876 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 896 KB Output is correct
2 Correct 8 ms 876 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 7 ms 876 KB Output is correct
5 Correct 7 ms 876 KB Output is correct
6 Correct 7 ms 876 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 8 ms 876 KB Output is correct
9 Correct 7 ms 876 KB Output is correct
10 Correct 7 ms 876 KB Output is correct
11 Correct 8 ms 876 KB Output is correct
12 Correct 7 ms 876 KB Output is correct
13 Correct 8 ms 876 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 7 ms 876 KB Output is correct
16 Correct 8 ms 876 KB Output is correct
17 Correct 7 ms 876 KB Output is correct
18 Correct 7 ms 876 KB Output is correct
19 Correct 8 ms 876 KB Output is correct
20 Correct 8 ms 876 KB Output is correct
21 Correct 7 ms 876 KB Output is correct
22 Correct 8 ms 876 KB Output is correct
23 Correct 9 ms 876 KB Output is correct
24 Correct 7 ms 876 KB Output is correct
25 Correct 8 ms 876 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 8 ms 876 KB Output is correct
28 Correct 8 ms 876 KB Output is correct
29 Correct 8 ms 876 KB Output is correct
30 Correct 8 ms 876 KB Output is correct
31 Correct 7 ms 876 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 876 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 8 ms 876 KB Output is correct
4 Correct 8 ms 876 KB Output is correct
5 Correct 8 ms 876 KB Output is correct
6 Correct 8 ms 876 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 54 ms 1516 KB Output is correct
9 Correct 100 ms 2156 KB Output is correct
10 Correct 50 ms 1516 KB Output is correct
11 Correct 53 ms 1516 KB Output is correct
12 Correct 55 ms 1772 KB Output is correct
13 Correct 50 ms 1536 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 876 KB Output is correct
2 Correct 7 ms 876 KB Output is correct
3 Correct 8 ms 876 KB Output is correct
4 Correct 7 ms 876 KB Output is correct
5 Correct 8 ms 876 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 8 ms 876 KB Output is correct
9 Correct 7 ms 876 KB Output is correct
10 Correct 7 ms 876 KB Output is correct
11 Correct 8 ms 876 KB Output is correct
12 Correct 8 ms 876 KB Output is correct
13 Correct 7 ms 876 KB Output is correct
14 Correct 8 ms 876 KB Output is correct
15 Correct 9 ms 876 KB Output is correct
16 Correct 7 ms 876 KB Output is correct
17 Correct 54 ms 1516 KB Output is correct
18 Correct 100 ms 2156 KB Output is correct
19 Correct 50 ms 1516 KB Output is correct
20 Correct 53 ms 1516 KB Output is correct
21 Correct 55 ms 1772 KB Output is correct
22 Correct 50 ms 1536 KB Output is correct
23 Correct 8 ms 876 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 8 ms 876 KB Output is correct
26 Correct 8 ms 876 KB Output is correct
27 Correct 8 ms 876 KB Output is correct
28 Correct 8 ms 876 KB Output is correct
29 Correct 7 ms 876 KB Output is correct
30 Correct 73 ms 2156 KB Output is correct
31 Correct 46 ms 1388 KB Output is correct
32 Correct 52 ms 1516 KB Output is correct
33 Correct 7 ms 876 KB Output is correct
34 Correct 7 ms 876 KB Output is correct
35 Correct 7 ms 896 KB Output is correct
36 Correct 8 ms 876 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 7 ms 876 KB Output is correct
39 Correct 7 ms 876 KB Output is correct
40 Correct 7 ms 876 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 8 ms 876 KB Output is correct
43 Correct 47 ms 1388 KB Output is correct
44 Correct 49 ms 1664 KB Output is correct
45 Correct 68 ms 2668 KB Output is correct
46 Correct 50 ms 1644 KB Output is correct
47 Correct 49 ms 1644 KB Output is correct
48 Correct 50 ms 1644 KB Output is correct
49 Correct 106 ms 4076 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 50 ms 1516 KB Output is correct
53 Correct 49 ms 1516 KB Output is correct
54 Correct 48 ms 1516 KB Output is correct
55 Correct 48 ms 1516 KB Output is correct
56 Correct 47 ms 1388 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 9 ms 1004 KB Output is correct
59 Correct 9 ms 1004 KB Output is correct
60 Correct 9 ms 1004 KB Output is correct
61 Correct 110 ms 4332 KB Output is correct
62 Correct 109 ms 4216 KB Output is correct
63 Correct 1 ms 364 KB Output is correct