oj.uz

Submission #594857

# Submission time Handle Problem Language Result Execution time Memory
594857 2022-07-13T04:57:40 Z penguinhacker Travelling Merchant (APIO17_merchant) C++17
100 / 100
 96 ms 3356 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const ll INF=1e18;
int n, m, k, b[100][1000], s[100][1000], profit[100][100];
ll d[100][100], dp[100][100];

bool ok(int x) {
	for (int i=0; i<n; ++i)
		for (int j=0; j<n; ++j)
			dp[i][j]=i==j||d[i][j]>=INF?-INF:profit[i][j]-x*d[i][j];
	for (int l=0; l<n; ++l)
		for (int i=0; i<n; ++i)
			for (int j=0; j<n; ++j)
				dp[i][j]=max(dp[i][j], min(INF, dp[i][l]+dp[l][j]));
	for (int i=0; i<n; ++i)
		if (dp[i][i]>=0)
			return 1;
	return 0;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m >> k;
	for (int i=0; i<n; ++i)
		for (int j=0; j<k; ++j)
			cin >> b[i][j] >> s[i][j];
	memset(d, 0x3f, sizeof(d));
	for (int i=0; i<n; ++i)
		d[i][i]=0;
	for (int i=0; i<m; ++i) {
		int u, v, w;
		cin >> u >> v >> w, --u, --v;
		d[u][v]=w;
	}
	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)
					profit[i][j]=max(profit[i][j], s[j][l]-b[i][l]);
	for (int l=0; l<n; ++l)
		for (int i=0; i<n; ++i)
			for (int j=0; j<n; ++j)
				d[i][j]=min(d[i][j], d[i][l]+d[l][j]);
	int lb=0, rb=1e9;
	while(lb<rb) {
		int mid=(lb+rb+1)/2;
		if (ok(mid))
			lb=mid;
		else
			rb=mid-1;
	}
	cout << lb;
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 1228 KB Output is correct
2 Correct 42 ms 1236 KB Output is correct
3 Correct 44 ms 1244 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 6 ms 724 KB Output is correct
6 Correct 7 ms 724 KB Output is correct
7 Correct 6 ms 724 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 6 ms 724 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 6 ms 840 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 7 ms 840 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 852 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 7 ms 852 KB Output is correct
4 Correct 7 ms 852 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 8 ms 888 KB Output is correct
7 Correct 7 ms 852 KB Output is correct
8 Correct 50 ms 1236 KB Output is correct
9 Correct 88 ms 1212 KB Output is correct
10 Correct 47 ms 1276 KB Output is correct
11 Correct 50 ms 1344 KB Output is correct
12 Correct 47 ms 1280 KB Output is correct
13 Correct 44 ms 1280 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 6 ms 872 KB Output is correct
3 Correct 6 ms 884 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 7 ms 848 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 8 ms 852 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 7 ms 852 KB Output is correct
11 Correct 8 ms 916 KB Output is correct
12 Correct 7 ms 852 KB Output is correct
13 Correct 7 ms 880 KB Output is correct
14 Correct 7 ms 852 KB Output is correct
15 Correct 8 ms 852 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 50 ms 1236 KB Output is correct
18 Correct 88 ms 1212 KB Output is correct
19 Correct 47 ms 1276 KB Output is correct
20 Correct 50 ms 1344 KB Output is correct
21 Correct 47 ms 1280 KB Output is correct
22 Correct 44 ms 1280 KB Output is correct
23 Correct 7 ms 852 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 7 ms 852 KB Output is correct
26 Correct 7 ms 852 KB Output is correct
27 Correct 7 ms 852 KB Output is correct
28 Correct 8 ms 888 KB Output is correct
29 Correct 7 ms 852 KB Output is correct
30 Correct 63 ms 1228 KB Output is correct
31 Correct 42 ms 1236 KB Output is correct
32 Correct 44 ms 1244 KB Output is correct
33 Correct 6 ms 724 KB Output is correct
34 Correct 6 ms 724 KB Output is correct
35 Correct 7 ms 724 KB Output is correct
36 Correct 6 ms 724 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 6 ms 724 KB Output is correct
39 Correct 6 ms 724 KB Output is correct
40 Correct 6 ms 840 KB Output is correct
41 Correct 0 ms 468 KB Output is correct
42 Correct 7 ms 840 KB Output is correct
43 Correct 43 ms 1236 KB Output is correct
44 Correct 47 ms 1364 KB Output is correct
45 Correct 59 ms 1692 KB Output is correct
46 Correct 49 ms 1348 KB Output is correct
47 Correct 44 ms 1364 KB Output is correct
48 Correct 44 ms 1360 KB Output is correct
49 Correct 94 ms 3124 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 45 ms 1236 KB Output is correct
53 Correct 44 ms 1396 KB Output is correct
54 Correct 46 ms 1236 KB Output is correct
55 Correct 43 ms 1236 KB Output is correct
56 Correct 42 ms 1236 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 8 ms 960 KB Output is correct
59 Correct 8 ms 852 KB Output is correct
60 Correct 8 ms 964 KB Output is correct
61 Correct 96 ms 3356 KB Output is correct
62 Correct 95 ms 3276 KB Output is correct
63 Correct 1 ms 324 KB Output is correct