oj.uz

Submission #53943

# Submission time Handle Problem Language Result Execution time Memory
53943 2018-07-02T03:13:11 Z MatheusLealV Travelling Merchant (APIO17_merchant) C++17
100 / 100
 102 ms 2552 KB 
#include <bits/stdc++.h>
#define N 105
#define M 1005
#define inf 1000000000000000000
using namespace std;
typedef long long ll;

int n, m, k;

ll opt[N][N], B[N][M], S[N][M], dist[N][N], dp[N][N];

inline bool check(ll x)
{
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= n; j++)
			if(dist[i][j] == inf) dp[i][j] = inf;
			else dp[i][j] = x*dist[i][j] - opt[i][j];
	}

	for(int k = 1; k <= n; k++)
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);

	for(int i = 1; i <= n; i++) if(dp[i][i] <= 0) return true;

	return false;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n>>m>>k;

	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= k; j++)
			cin>>B[i][j]>>S[i][j];

	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			dist[i][j] = inf;

	for(int i = 1, a, b, c; i <= m; i++)
	{
		cin>>a>>b>>c;

		dist[a][b] = c;
	}

	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			for(int q = 1; q <= k; q++)
			if(B[i][q] >= 0 and S[j][q] >= 0) opt[i][j] = max(opt[i][j], -B[i][q] + S[j][q]);

	for(int k = 1; k <= n; k++)
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);

	ll ini = 0, fim = 1e9 + 500, mid, best = 0;

	while(fim >= ini)
	{
		mid = (ini + fim)/2;

		if(check(mid)) best = mid, ini = mid + 1;

		else fim = mid - 1;
	}

	cout<<best<<"\n";
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 2040 KB Output is correct
2 Correct 43 ms 2040 KB Output is correct
3 Correct 43 ms 2040 KB Output is correct
4 Correct 8 ms 2040 KB Output is correct
5 Correct 7 ms 2040 KB Output is correct
6 Correct 7 ms 2040 KB Output is correct
7 Correct 8 ms 2040 KB Output is correct
8 Correct 2 ms 2040 KB Output is correct
9 Correct 7 ms 2040 KB Output is correct
10 Correct 8 ms 2040 KB Output is correct
11 Correct 7 ms 2040 KB Output is correct
12 Correct 2 ms 2040 KB Output is correct
13 Correct 9 ms 2040 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 2040 KB Output is correct
2 Correct 94 ms 2428 KB Output is correct
3 Correct 45 ms 2428 KB Output is correct
4 Correct 53 ms 2428 KB Output is correct
5 Correct 49 ms 2428 KB Output is correct
6 Correct 45 ms 2428 KB Output is correct
7 Correct 8 ms 2040 KB Output is correct
8 Correct 2 ms 2040 KB Output is correct
9 Correct 8 ms 2040 KB Output is correct
10 Correct 9 ms 2040 KB Output is correct
11 Correct 8 ms 2040 KB Output is correct
12 Correct 8 ms 2040 KB Output is correct
13 Correct 7 ms 2040 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2040 KB Output is correct
2 Correct 8 ms 2040 KB Output is correct
3 Correct 8 ms 2040 KB Output is correct
4 Correct 7 ms 2040 KB Output is correct
5 Correct 8 ms 2040 KB Output is correct
6 Correct 2 ms 2040 KB Output is correct
7 Correct 7 ms 2040 KB Output is correct
8 Correct 8 ms 2040 KB Output is correct
9 Correct 8 ms 2040 KB Output is correct
10 Correct 8 ms 2040 KB Output is correct
11 Correct 8 ms 2040 KB Output is correct
12 Correct 9 ms 2040 KB Output is correct
13 Correct 8 ms 2040 KB Output is correct
14 Correct 8 ms 2040 KB Output is correct
15 Correct 9 ms 2040 KB Output is correct
16 Correct 8 ms 2040 KB Output is correct
17 Correct 47 ms 2040 KB Output is correct
18 Correct 94 ms 2428 KB Output is correct
19 Correct 45 ms 2428 KB Output is correct
20 Correct 53 ms 2428 KB Output is correct
21 Correct 49 ms 2428 KB Output is correct
22 Correct 45 ms 2428 KB Output is correct
23 Correct 8 ms 2040 KB Output is correct
24 Correct 2 ms 2040 KB Output is correct
25 Correct 8 ms 2040 KB Output is correct
26 Correct 9 ms 2040 KB Output is correct
27 Correct 8 ms 2040 KB Output is correct
28 Correct 8 ms 2040 KB Output is correct
29 Correct 7 ms 2040 KB Output is correct
30 Correct 44 ms 2428 KB Output is correct
31 Correct 51 ms 2428 KB Output is correct
32 Correct 64 ms 2480 KB Output is correct
33 Correct 51 ms 2480 KB Output is correct
34 Correct 48 ms 2480 KB Output is correct
35 Correct 52 ms 2480 KB Output is correct
36 Correct 98 ms 2552 KB Output is correct
37 Correct 2 ms 2552 KB Output is correct
38 Correct 2 ms 2552 KB Output is correct
39 Correct 50 ms 2552 KB Output is correct
40 Correct 45 ms 2552 KB Output is correct
41 Correct 54 ms 2552 KB Output is correct
42 Correct 44 ms 2552 KB Output is correct
43 Correct 52 ms 2552 KB Output is correct
44 Correct 2 ms 2552 KB Output is correct
45 Correct 10 ms 2552 KB Output is correct
46 Correct 10 ms 2552 KB Output is correct
47 Correct 9 ms 2552 KB Output is correct
48 Correct 102 ms 2552 KB Output is correct
49 Correct 101 ms 2552 KB Output is correct
50 Correct 2 ms 2552 KB Output is correct
51 Correct 72 ms 2040 KB Output is correct
52 Correct 43 ms 2040 KB Output is correct
53 Correct 43 ms 2040 KB Output is correct
54 Correct 8 ms 2040 KB Output is correct
55 Correct 7 ms 2040 KB Output is correct
56 Correct 7 ms 2040 KB Output is correct
57 Correct 8 ms 2040 KB Output is correct
58 Correct 2 ms 2040 KB Output is correct
59 Correct 7 ms 2040 KB Output is correct
60 Correct 8 ms 2040 KB Output is correct
61 Correct 7 ms 2040 KB Output is correct
62 Correct 2 ms 2040 KB Output is correct
63 Correct 9 ms 2040 KB Output is correct