oj.uz

Submission #258046

# Submission time Handle Problem Language Result Execution time Memory
258046 2020-08-05T09:10:27 Z mohammad Travelling Merchant (APIO17_merchant) C++14
100 / 100
 104 ms 4216 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define endl "\n"
#define OR |
typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
const int N = 10000010  ;

ll b[101][1010] , s[101][1010] , d[101][101] , pro[101][101];
ll ans[101][101];
int n , m , k ;

bool cn(ll md){
	for(int i = 1 ; i <= n ; ++i) 
		for(int j = 1 ; j <= n ; ++j) ans[i][j] = md * d[i][j] - pro[i][j] ;
	for(int x = 1 ; x <= n ; ++x)
		for(int i = 1 ; i <= n ; ++i)
			for(int j = 1 ; j <= n ; ++j){
				ans[i][j] = min(ans[i][j] , ans[i][x] + ans[x][j]);
			}
	for(int i = 1 ; i <= n; ++i) 
		if(ans[i][i] <= 0) return 1;
	return 0 ;
}

int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	// #ifndef ONLINE_JUDGE
	// 	freopen("input" , "r" , stdin );
	// 	freopen("output" , "w" , stdout );
	// #endif
	cin >> n >> m >> k;
	for(int i = 1 ; i <= n ; ++i)
		for(int j = 0 ; j < k ; ++j){
			cin >> b[i][j] >> s[i][j];
		}
	for(int i = 1;  i <= n; ++i)
		for(int j = 1;  j <= n; ++j) d[i][j] = oo;
	for(int i = 0 ; i < m ; ++i){
		int x , y , z;
		cin >> x >> y >> z;
		d[x][y] = z;
	}
	for(int x = 1 ; x <= n ; ++x)
		for(int i = 1 ; i <= n ; ++i)
			for(int j = 1 ; j <= n ; ++j){
				d[i][j] = min(d[i][j] , d[i][x] + d[x][j]);
			}
	for(int i = 1 ; i <= n ; ++i)
		for(int j = 1 ; j <= n ; ++j){
			if(i != j && d[i][j] != oo)
				for(int x = 0 ; x < k ; ++x){
					if(b[i][x] > 0 && s[j][x] > 0) pro[i][j] = max(pro[i][j] , s[j][x] - b[i][x]);
				}
		}
	ll lo = 0 , hi = oo , best = 0;
	while(lo <= hi){
		ll md = (lo + hi) / 2;
		if(cn(md)) lo = md + 1 , best = md ;
		else hi = md - 1;
	}
	cout << best << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 2168 KB Output is correct
2 Correct 40 ms 1280 KB Output is correct
3 Correct 37 ms 1280 KB Output is correct
4 Correct 5 ms 768 KB Output is correct
5 Correct 6 ms 768 KB Output is correct
6 Correct 5 ms 896 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 6 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 7 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 896 KB Output is correct
2 Correct 5 ms 896 KB Output is correct
3 Correct 6 ms 896 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 7 ms 896 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 6 ms 896 KB Output is correct
9 Correct 6 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 7 ms 896 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 6 ms 896 KB Output is correct
15 Correct 8 ms 896 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 7 ms 896 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 7 ms 1024 KB Output is correct
20 Correct 6 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 6 ms 896 KB Output is correct
24 Correct 5 ms 896 KB Output is correct
25 Correct 6 ms 896 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 6 ms 768 KB Output is correct
28 Correct 6 ms 896 KB Output is correct
29 Correct 5 ms 896 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 7 ms 896 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 1536 KB Output is correct
2 Correct 97 ms 3960 KB Output is correct
3 Correct 39 ms 1536 KB Output is correct
4 Correct 48 ms 1664 KB Output is correct
5 Correct 42 ms 1784 KB Output is correct
6 Correct 39 ms 1536 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 7 ms 1024 KB Output is correct
10 Correct 6 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 6 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 896 KB Output is correct
2 Correct 5 ms 896 KB Output is correct
3 Correct 6 ms 896 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 7 ms 896 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 6 ms 896 KB Output is correct
9 Correct 6 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 7 ms 896 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 6 ms 896 KB Output is correct
15 Correct 8 ms 896 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 42 ms 1536 KB Output is correct
18 Correct 97 ms 3960 KB Output is correct
19 Correct 39 ms 1536 KB Output is correct
20 Correct 48 ms 1664 KB Output is correct
21 Correct 42 ms 1784 KB Output is correct
22 Correct 39 ms 1536 KB Output is correct
23 Correct 7 ms 896 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 7 ms 1024 KB Output is correct
26 Correct 6 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 6 ms 896 KB Output is correct
30 Correct 39 ms 1408 KB Output is correct
31 Correct 40 ms 1536 KB Output is correct
32 Correct 63 ms 2680 KB Output is correct
33 Correct 39 ms 1536 KB Output is correct
34 Correct 41 ms 1536 KB Output is correct
35 Correct 39 ms 1536 KB Output is correct
36 Correct 98 ms 4040 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 37 ms 1408 KB Output is correct
40 Correct 43 ms 1656 KB Output is correct
41 Correct 38 ms 1408 KB Output is correct
42 Correct 41 ms 1408 KB Output is correct
43 Correct 37 ms 1400 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 8 ms 1024 KB Output is correct
46 Correct 8 ms 1024 KB Output is correct
47 Correct 8 ms 1024 KB Output is correct
48 Correct 104 ms 4216 KB Output is correct
49 Correct 102 ms 4216 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 70 ms 2168 KB Output is correct
52 Correct 40 ms 1280 KB Output is correct
53 Correct 37 ms 1280 KB Output is correct
54 Correct 5 ms 768 KB Output is correct
55 Correct 6 ms 768 KB Output is correct
56 Correct 5 ms 896 KB Output is correct
57 Correct 6 ms 896 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 6 ms 768 KB Output is correct
60 Correct 6 ms 896 KB Output is correct
61 Correct 5 ms 896 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 7 ms 896 KB Output is correct