oj.uz

Submission #549932

# Submission time Handle Problem Language Result Execution time Memory
549932 2022-04-16T21:14:19 Z Hanksburger Travelling Merchant (APIO17_merchant) C++17
100 / 100
 102 ms 4320 KB 
#include <bits/stdc++.h>
using namespace std; 
long long buy[105][1005], sell[105][1005], dist[105][105], dist2[105][105], profit[105][105];
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	long long n, m, o, l=0, r=1e9;
	cin >> n >> m >> o;
	for (long long i=1; i<=n; i++)
		for (long long j=1; j<=o; j++)
			cin >> buy[i][j] >> sell[i][j];
	for (long long i=1; i<=n; i++)
		for (long long j=1; j<=n; j++)
			dist[i][j]=2e9;
	for (long long i=1; i<=m; i++)
	{
		long long u, v, w;
		cin >> u >> v >> w;
		dist[u][v]=w;
	}
	for (long long i=1; i<=n; i++)
		for (long long j=1; j<=n; j++)
			for (long long k=1; k<=n; k++)
				dist[j][k]=min(dist[j][k], dist[j][i]+dist[i][k]);
	for (long long i=1; i<=n; i++)
		for (long long j=1; j<=n; j++)
			for (long long k=1; k<=o; k++)
				if (buy[i][k]!=-1 && sell[j][k]!=-1)
					profit[i][j]=max(profit[i][j], sell[j][k]-buy[i][k]);
	while (l<r)
	{
		long long mid=(l+r+1)/2;
		for (long long i=1; i<=n; i++)
			for (long long j=1; j<=n; j++)
				dist2[i][j]=dist[i][j]*mid-profit[i][j];
		for (long long i=1; i<=n; i++)
			for (long long j=1; j<=n; j++)
				for (long long k=1; k<=n; k++)
					dist2[j][k]=min(dist2[j][k], dist2[j][i]+dist2[i][k]);
		bool ok=0;
		for (long long i=1; i<=n; i++)
		{
			if (dist2[i][i]<=0)
			{
				ok=1;
				break;
			}
		}
		if (ok)
			l=mid;
		else
			r=mid-1;
	}
	cout << l;
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 3284 KB Output is correct
2 Correct 32 ms 1236 KB Output is correct
3 Correct 35 ms 1236 KB Output is correct
4 Correct 5 ms 708 KB Output is correct
5 Correct 6 ms 708 KB Output is correct
6 Correct 6 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 6 ms 816 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 5 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 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 6 ms 816 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 340 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 8 ms 852 KB Output is correct
12 Correct 5 ms 848 KB Output is correct
13 Correct 8 ms 936 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 8 ms 852 KB Output is correct
17 Correct 6 ms 864 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 6 ms 852 KB Output is correct
21 Correct 6 ms 788 KB Output is correct
22 Correct 6 ms 772 KB Output is correct
23 Correct 7 ms 852 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 6 ms 856 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 8 ms 852 KB Output is correct
30 Correct 6 ms 852 KB Output is correct
31 Correct 6 ms 832 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 324 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 8 ms 852 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 6 ms 832 KB Output is correct
8 Correct 42 ms 1668 KB Output is correct
9 Correct 87 ms 3792 KB Output is correct
10 Correct 38 ms 1512 KB Output is correct
11 Correct 40 ms 1748 KB Output is correct
12 Correct 41 ms 1732 KB Output is correct
13 Correct 38 ms 1516 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 5 ms 848 KB Output is correct
5 Correct 8 ms 936 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 8 ms 852 KB Output is correct
9 Correct 6 ms 864 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 6 ms 788 KB Output is correct
14 Correct 6 ms 772 KB Output is correct
15 Correct 7 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 42 ms 1668 KB Output is correct
18 Correct 87 ms 3792 KB Output is correct
19 Correct 38 ms 1512 KB Output is correct
20 Correct 40 ms 1748 KB Output is correct
21 Correct 41 ms 1732 KB Output is correct
22 Correct 38 ms 1516 KB Output is correct
23 Correct 6 ms 856 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 8 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 6 ms 832 KB Output is correct
30 Correct 56 ms 3284 KB Output is correct
31 Correct 32 ms 1236 KB Output is correct
32 Correct 35 ms 1236 KB Output is correct
33 Correct 5 ms 708 KB Output is correct
34 Correct 6 ms 708 KB Output is correct
35 Correct 6 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 6 ms 816 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 38 ms 1400 KB Output is correct
44 Correct 40 ms 1592 KB Output is correct
45 Correct 61 ms 2624 KB Output is correct
46 Correct 35 ms 1492 KB Output is correct
47 Correct 37 ms 1536 KB Output is correct
48 Correct 35 ms 1604 KB Output is correct
49 Correct 88 ms 4084 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 36 ms 1236 KB Output is correct
53 Correct 47 ms 1364 KB Output is correct
54 Correct 33 ms 1456 KB Output is correct
55 Correct 33 ms 1392 KB Output is correct
56 Correct 34 ms 1236 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 7 ms 980 KB Output is correct
59 Correct 7 ms 980 KB Output is correct
60 Correct 7 ms 980 KB Output is correct
61 Correct 92 ms 4320 KB Output is correct
62 Correct 102 ms 4188 KB Output is correct
63 Correct 1 ms 340 KB Output is correct