oj.uz

Submission #373673

# Submission time Handle Problem Language Result Execution time Memory
373673 2021-03-05T11:48:05 Z abra_stone Travelling Merchant (APIO17_merchant) C++14
100 / 100
 169 ms 2432 KB 
#include <iostream>
#include <cstdio>
#define N 105
#define K 1005
using namespace std;

typedef long long ll;
ll n, eg, m, b[N][K], s[N][K], d[N][N], mx[N][N], mn[N][N];

bool f(ll p) {
	ll i, j, k;
	for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) mn[i][j] = p * d[i][j] - mx[i][j];
	for (k = 1; k <= n; k++) {
		for (i = 1; i <= n; i++) {
			for (j = 1; j <= n; j++) {
				if (mn[i][k] + mn[k][j] < mn[i][j]) mn[i][j] = mn[i][k] + mn[k][j];
			}
		}
	}
	for (i = 1; i <= n; i++) if (mn[i][i] <= 0) return 1;
	return 0;
}

int main()
{
	ll i, j, k, t1, t2, t3;
	cin >> n >> eg >> m;
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= m; j++) {
			scanf("%lld %lld", &b[i][j], &s[i][j]);
//			if (b[i][j] == -1) b[i][j] = 1e18;
//			if (s[i][j] == -1) s[i][j] = -1e18;
		}
	}
	for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) d[i][j] = 1e9;
	while (eg--) {
		scanf("%lld %lld %lld", &t1, &t2, &t3);
		d[t1][t2] = t3;
	}
	for (k = 1; k <= n; k++) {
		for (i = 1; i <= n; i++) {
			for (j = 1; j <= n; j++) {
				if (d[i][k] + d[k][j] < d[i][j]) d[i][j] = d[i][k] + d[k][j];
			}
		}
	}
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= n; j++) {
			for (k = 1; k <= m; k++) {
				if (s[j][k] != -1 && b[i][k] != -1) mx[i][j] = max(mx[i][j], s[j][k] - b[i][k]);
			}
		}
	}
	ll l = 1, r = 1e9;
//	while (l < r) {
//		ll md = (l + r + 1) / 2;
//		if (f(md)) l = md;
//		else r = md - 1;
//	}
//	cout << l << endl;
	ll ans = 0;
	while (l <= r) {
		ll md = (l + r) / 2;
		if (f(md)) ans = md, l = md + 1;
		else r = md - 1;
	}
    cout << ans << endl;
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:30:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |    scanf("%lld %lld", &b[i][j], &s[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |   scanf("%lld %lld %lld", &t1, &t2, &t3);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 2304 KB Output is correct
2 Correct 35 ms 1260 KB Output is correct
3 Correct 36 ms 1260 KB Output is correct
4 Correct 6 ms 748 KB Output is correct
5 Correct 6 ms 748 KB Output is correct
6 Correct 6 ms 748 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 8 ms 876 KB Output is correct
10 Correct 9 ms 1004 KB Output is correct
11 Correct 8 ms 748 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 10 ms 1024 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 748 KB Output is correct
2 Correct 7 ms 876 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 8 ms 876 KB Output is correct
5 Correct 9 ms 1004 KB Output is correct
6 Correct 8 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 10 ms 1024 KB Output is correct
9 Correct 7 ms 876 KB Output is correct
10 Correct 6 ms 1024 KB Output is correct
11 Correct 9 ms 952 KB Output is correct
12 Correct 9 ms 876 KB Output is correct
13 Correct 12 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 9 ms 876 KB Output is correct
17 Correct 6 ms 1012 KB Output is correct
18 Correct 10 ms 876 KB Output is correct
19 Correct 9 ms 876 KB Output is correct
20 Correct 11 ms 876 KB Output is correct
21 Correct 9 ms 876 KB Output is correct
22 Correct 9 ms 876 KB Output is correct
23 Correct 9 ms 876 KB Output is correct
24 Correct 6 ms 876 KB Output is correct
25 Correct 15 ms 876 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 14 ms 876 KB Output is correct
28 Correct 12 ms 876 KB Output is correct
29 Correct 10 ms 876 KB Output is correct
30 Correct 7 ms 876 KB Output is correct
31 Correct 10 ms 876 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 876 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 14 ms 876 KB Output is correct
4 Correct 12 ms 876 KB Output is correct
5 Correct 10 ms 876 KB Output is correct
6 Correct 7 ms 876 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 98 ms 1516 KB Output is correct
9 Correct 169 ms 2212 KB Output is correct
10 Correct 91 ms 1388 KB Output is correct
11 Correct 102 ms 1592 KB Output is correct
12 Correct 100 ms 1516 KB Output is correct
13 Correct 55 ms 1388 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 6 ms 1024 KB Output is correct
3 Correct 9 ms 952 KB Output is correct
4 Correct 9 ms 876 KB Output is correct
5 Correct 12 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 9 ms 876 KB Output is correct
9 Correct 6 ms 1012 KB Output is correct
10 Correct 10 ms 876 KB Output is correct
11 Correct 9 ms 876 KB Output is correct
12 Correct 11 ms 876 KB Output is correct
13 Correct 9 ms 876 KB Output is correct
14 Correct 9 ms 876 KB Output is correct
15 Correct 9 ms 876 KB Output is correct
16 Correct 6 ms 876 KB Output is correct
17 Correct 98 ms 1516 KB Output is correct
18 Correct 169 ms 2212 KB Output is correct
19 Correct 91 ms 1388 KB Output is correct
20 Correct 102 ms 1592 KB Output is correct
21 Correct 100 ms 1516 KB Output is correct
22 Correct 55 ms 1388 KB Output is correct
23 Correct 15 ms 876 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 14 ms 876 KB Output is correct
26 Correct 12 ms 876 KB Output is correct
27 Correct 10 ms 876 KB Output is correct
28 Correct 7 ms 876 KB Output is correct
29 Correct 10 ms 876 KB Output is correct
30 Correct 68 ms 2304 KB Output is correct
31 Correct 35 ms 1260 KB Output is correct
32 Correct 36 ms 1260 KB Output is correct
33 Correct 6 ms 748 KB Output is correct
34 Correct 6 ms 748 KB Output is correct
35 Correct 6 ms 748 KB Output is correct
36 Correct 7 ms 876 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 8 ms 876 KB Output is correct
39 Correct 9 ms 1004 KB Output is correct
40 Correct 8 ms 748 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 10 ms 1024 KB Output is correct
43 Correct 41 ms 1388 KB Output is correct
44 Correct 60 ms 1772 KB Output is correct
45 Correct 59 ms 2284 KB Output is correct
46 Correct 57 ms 1776 KB Output is correct
47 Correct 39 ms 1644 KB Output is correct
48 Correct 42 ms 1644 KB Output is correct
49 Correct 129 ms 2432 KB Output is correct
50 Correct 1 ms 504 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 39 ms 1388 KB Output is correct
53 Correct 38 ms 1516 KB Output is correct
54 Correct 39 ms 1516 KB Output is correct
55 Correct 40 ms 1388 KB Output is correct
56 Correct 37 ms 1388 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 10 ms 1004 KB Output is correct
59 Correct 10 ms 1004 KB Output is correct
60 Correct 10 ms 1004 KB Output is correct
61 Correct 124 ms 2284 KB Output is correct
62 Correct 122 ms 2284 KB Output is correct
63 Correct 1 ms 364 KB Output is correct