oj.uz

Submission #741547

# Submission time Handle Problem Language Result Execution time Memory
741547 2023-05-14T10:18:21 Z 406 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 95 ms 2920 KB 
#include "bits/stdc++.h"
#define int long long
using namespace std;
const long long INF = 1ll << 30;
const long long INF2 = 1ll << 60;
const int N = 100 + 5;
const int M = 1e4 + 5;
const int K = 1000 + 5;
int d[N][N], n, k, U[M], V[M], W[M], B[N][K], S[N][K], P[N][N], e, D[N][N];

void floyd(int d[N][N]) {
	for (int k = 0; k < n; k++) for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) 
		d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
bool check(int O) {
	for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) d[i][j] = O * min(D[i][j], INF2 / O) - P[i][j];
	floyd(d);
	for (int i = 0; i < n; i++) if (d[i][i] <= 0) return true;
	return false;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> e >> k;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < k; j++)
			cin >> B[i][j] >> S[i][j];
	}
	for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) D[i][j] = INF2;
	for (int i = 0; i < e; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		u--, v--;
		D[u][v] = w;
	}
	floyd(D);
	
	for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) for (int l = 0; l < k; l++) if (B[i][l] != -1 && S[j][l] != -1)
		P[i][j] = max(P[i][j], -B[i][l] +S[j][l]);

	int l = 0, r = INF;
	while (r - l > 1) {
		int m = l + r >> 1;
		if (check(m)) l = m;
		else r = m;
	}
	cout << l;
	return 0;
}

Compilation message

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

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 2552 KB Output is correct
2 Correct 29 ms 1308 KB Output is correct
3 Correct 31 ms 1308 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 5 ms 900 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 5 ms 900 KB Output is correct
9 Correct 7 ms 848 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 8 ms 852 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 6 ms 856 KB Output is correct
21 Correct 5 ms 800 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 6 ms 976 KB Output is correct
24 Correct 6 ms 852 KB Output is correct
25 Correct 6 ms 856 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 7 ms 852 KB Output is correct
30 Correct 6 ms 852 KB Output is correct
31 Correct 5 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 856 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 35 ms 1748 KB Output is correct
9 Correct 76 ms 2920 KB Output is correct
10 Correct 35 ms 1532 KB Output is correct
11 Correct 35 ms 1748 KB Output is correct
12 Correct 37 ms 1748 KB Output is correct
13 Correct 35 ms 1516 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 848 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 8 ms 852 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 6 ms 856 KB Output is correct
13 Correct 5 ms 800 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 6 ms 976 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 35 ms 1748 KB Output is correct
18 Correct 76 ms 2920 KB Output is correct
19 Correct 35 ms 1532 KB Output is correct
20 Correct 35 ms 1748 KB Output is correct
21 Correct 37 ms 1748 KB Output is correct
22 Correct 35 ms 1516 KB Output is correct
23 Correct 6 ms 856 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 7 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 69 ms 2552 KB Output is correct
31 Correct 29 ms 1308 KB Output is correct
32 Correct 31 ms 1308 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 5 ms 900 KB Output is correct
43 Correct 31 ms 1364 KB Output is correct
44 Correct 32 ms 1600 KB Output is correct
45 Correct 46 ms 2644 KB Output is correct
46 Correct 32 ms 1492 KB Output is correct
47 Correct 33 ms 1620 KB Output is correct
48 Correct 36 ms 1620 KB Output is correct
49 Correct 95 ms 2908 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 33 ms 1388 KB Output is correct
53 Correct 38 ms 1516 KB Output is correct
54 Correct 32 ms 1484 KB Output is correct
55 Correct 30 ms 1440 KB Output is correct
56 Correct 33 ms 1364 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 6 ms 980 KB Output is correct
59 Correct 8 ms 980 KB Output is correct
60 Correct 6 ms 1044 KB Output is correct
61 Correct 81 ms 2912 KB Output is correct
62 Correct 83 ms 2880 KB Output is correct
63 Correct 0 ms 340 KB Output is correct