oj.uz

Submission #203000

# Submission time Handle Problem Language Result Execution time Memory
203000 2020-02-18T23:52:53 Z AQT Travelling Merchant (APIO17_merchant) C++14
100 / 100
 151 ms 6648 KB 
#include <bits/stdc++.h>

using namespace std;

int N, M, K;
long long mx[1005][1005];
long long dis[1005][1005];
long long buy[1005][10005];
long long sell[1005][10005];
long long tmp[1005][1005];
long long a, b, c;

bool solve(long long k){
	for(int i =1 ; i<=N; i++){
		for(int j = 1; j<=M; j++){
			tmp[i][j] = mx[i][j] - k*dis[i][j];
		}
	}
	for(int k = 1; k<=N; k++){
		for(int i = 1; i<=N; i++){
			for(int j = 1; j<=N; j++){
				if(i == j){
					if(k != i && tmp[i][k] + tmp[k][j] >= 0){
						return 1;
					}	
				}
				tmp[i][j] = max(tmp[i][j], tmp[i][k] + tmp[k][j]);
			}
		}
	}
	return 0;
}

int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N >> M >> K;
	for(int i =1 ; i<=N; i++){
		for(int k = 1; k<=K; k++){
			cin >> buy[i][k] >> sell[i][k];
		}
	}
	for(int i = 1; i<=N; i++){
		for(int j = 1; j<=N; j++){
			for(int k = 1; k<=K; k++){
				if(sell[j][k]+1 && buy[i][k]+1){
					mx[i][j] = max(mx[i][j], sell[j][k] - buy[i][k]);
				}
			}
		}
	}
	for(int i = 1; i<=N; i++){
		for(int j = 1; j<=N; j++){
			dis[i][j] = 2000000000;
			if(i == j){
				dis[i][j] = 0;
			}
		}
	}
	for(int i = 1; i<=M; i++){
		cin >> a >> b >> c;
		dis[a][b] = min(dis[a][b], c);
	}
	for(int k = 1; k<=N; k++){
		for(int i = 1; i<=N; i++){
			for(int j = 1; j<=N; j++){
				dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
			}
		}
	}
	int l = 1,r = 1000000000, ans = 0;
	while(l <= r){
		int mid = l + r>> 1;
		if(solve(mid)){
			l = mid + 1;
			ans = mid;
		}
		else{
			r =mid - 1;
		}
	}
	cout << ans << endl;
}

Compilation message

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

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 3704 KB Output is correct
2 Correct 53 ms 2180 KB Output is correct
3 Correct 35 ms 2168 KB Output is correct
4 Correct 11 ms 1144 KB Output is correct
5 Correct 10 ms 1272 KB Output is correct
6 Correct 12 ms 1272 KB Output is correct
7 Correct 10 ms 1272 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 9 ms 1144 KB Output is correct
10 Correct 9 ms 1272 KB Output is correct
11 Correct 10 ms 1272 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 13 ms 1272 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1400 KB Output is correct
2 Correct 11 ms 1272 KB Output is correct
3 Correct 12 ms 1400 KB Output is correct
4 Correct 12 ms 1400 KB Output is correct
5 Correct 13 ms 1400 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 11 ms 1272 KB Output is correct
8 Correct 15 ms 1528 KB Output is correct
9 Correct 9 ms 1272 KB Output is correct
10 Correct 11 ms 1272 KB Output is correct
11 Correct 12 ms 1528 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Correct 13 ms 1656 KB Output is correct
14 Correct 11 ms 1532 KB Output is correct
15 Correct 14 ms 1656 KB Output is correct
16 Correct 11 ms 1272 KB Output is correct
17 Correct 13 ms 1400 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 13 ms 1528 KB Output is correct
20 Correct 12 ms 1528 KB Output is correct
21 Correct 13 ms 1528 KB Output is correct
22 Correct 13 ms 1656 KB Output is correct
23 Correct 11 ms 1400 KB Output is correct
24 Correct 12 ms 1272 KB Output is correct
25 Correct 10 ms 1272 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 9 ms 1144 KB Output is correct
28 Correct 9 ms 1272 KB Output is correct
29 Correct 10 ms 1272 KB Output is correct
30 Correct 5 ms 504 KB Output is correct
31 Correct 13 ms 1272 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 2808 KB Output is correct
2 Correct 116 ms 4344 KB Output is correct
3 Correct 60 ms 2936 KB Output is correct
4 Correct 62 ms 2680 KB Output is correct
5 Correct 61 ms 2808 KB Output is correct
6 Correct 54 ms 2936 KB Output is correct
7 Correct 13 ms 1400 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 13 ms 1528 KB Output is correct
10 Correct 12 ms 1528 KB Output is correct
11 Correct 13 ms 1528 KB Output is correct
12 Correct 13 ms 1656 KB Output is correct
13 Correct 11 ms 1400 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1400 KB Output is correct
2 Correct 11 ms 1272 KB Output is correct
3 Correct 12 ms 1400 KB Output is correct
4 Correct 12 ms 1400 KB Output is correct
5 Correct 13 ms 1400 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 11 ms 1272 KB Output is correct
8 Correct 15 ms 1528 KB Output is correct
9 Correct 9 ms 1272 KB Output is correct
10 Correct 11 ms 1272 KB Output is correct
11 Correct 12 ms 1528 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Correct 13 ms 1656 KB Output is correct
14 Correct 11 ms 1532 KB Output is correct
15 Correct 14 ms 1656 KB Output is correct
16 Correct 11 ms 1272 KB Output is correct
17 Correct 56 ms 2808 KB Output is correct
18 Correct 116 ms 4344 KB Output is correct
19 Correct 60 ms 2936 KB Output is correct
20 Correct 62 ms 2680 KB Output is correct
21 Correct 61 ms 2808 KB Output is correct
22 Correct 54 ms 2936 KB Output is correct
23 Correct 13 ms 1400 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 13 ms 1528 KB Output is correct
26 Correct 12 ms 1528 KB Output is correct
27 Correct 13 ms 1528 KB Output is correct
28 Correct 13 ms 1656 KB Output is correct
29 Correct 11 ms 1400 KB Output is correct
30 Correct 51 ms 2296 KB Output is correct
31 Correct 52 ms 2680 KB Output is correct
32 Correct 64 ms 3832 KB Output is correct
33 Correct 56 ms 2680 KB Output is correct
34 Correct 57 ms 3064 KB Output is correct
35 Correct 59 ms 3192 KB Output is correct
36 Correct 117 ms 4344 KB Output is correct
37 Correct 5 ms 504 KB Output is correct
38 Correct 5 ms 504 KB Output is correct
39 Correct 52 ms 2552 KB Output is correct
40 Correct 91 ms 2680 KB Output is correct
41 Correct 52 ms 2556 KB Output is correct
42 Correct 48 ms 2424 KB Output is correct
43 Correct 56 ms 2552 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 14 ms 1656 KB Output is correct
46 Correct 13 ms 1656 KB Output is correct
47 Correct 14 ms 1656 KB Output is correct
48 Correct 151 ms 6648 KB Output is correct
49 Correct 147 ms 6648 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 89 ms 3704 KB Output is correct
52 Correct 53 ms 2180 KB Output is correct
53 Correct 35 ms 2168 KB Output is correct
54 Correct 11 ms 1144 KB Output is correct
55 Correct 10 ms 1272 KB Output is correct
56 Correct 12 ms 1272 KB Output is correct
57 Correct 10 ms 1272 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 9 ms 1144 KB Output is correct
60 Correct 9 ms 1272 KB Output is correct
61 Correct 10 ms 1272 KB Output is correct
62 Correct 5 ms 504 KB Output is correct
63 Correct 13 ms 1272 KB Output is correct