oj.uz

Submission #278662

# Submission time Handle Problem Language Result Execution time Memory
278662 2020-08-21T16:10:52 Z luciocf Travelling Merchant (APIO17_merchant) C++14
100 / 100
 137 ms 3448 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 110;
const int maxk = 1e3+10;
const ll inf = 1e18+10;

int n, m, k;
int b[maxn][maxk], s[maxn][maxk];

ll dist[maxn][maxn], g[maxn][maxn], p[maxn][maxn];

bool ok(int x)
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (j == i || dist[i][j] == inf) p[i][j] = -inf;
			else p[i][j] = g[i][j] - 1ll*x*dist[i][j];
		}
	}

	for (int l = 1; l <= n; l++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				p[i][j] = max(p[i][j], p[i][l]+p[l][j]);

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

	return false;
}

int main(void)
{
	scanf("%d %d %d", &n, &m, &k);

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= k; j++)
			scanf("%d %d", &b[i][j], &s[i][j]);

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

	for (int i = 1; i <= m; i++)
	{
		int u, v, w;
		scanf("%d %d %d", &u, &v, &w);

		dist[u][v] = min(dist[u][v], 1ll*w);
	}

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

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			for (int l = 1; l <= k; l++)
				if (b[i][l] != -1 && s[j][l] != -1)
					g[i][j] = max(g[i][j], 1ll*s[j][l]-1ll*b[i][l]);

	int ini = 1, fim = 1e9+10, ans = 0;

	while (ini <= fim)
	{
		int mid = (ini+fim)>>1;

		if (ok(mid)) ans = mid, ini = mid+1;
		else fim = mid-1;
	}

	printf("%d\n", ans);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:41:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   41 |  scanf("%d %d %d", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:45:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   45 |    scanf("%d %d", &b[i][j], &s[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   54 |   scanf("%d %d %d", &u, &v, &w);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 1280 KB Output is correct
2 Correct 37 ms 1280 KB Output is correct
3 Correct 41 ms 1280 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 6 ms 768 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 7 ms 768 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 6 ms 768 KB Output is correct
11 Correct 6 ms 768 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 9 ms 768 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 1408 KB Output is correct
2 Correct 114 ms 1400 KB Output is correct
3 Correct 47 ms 1528 KB Output is correct
4 Correct 53 ms 1408 KB Output is correct
5 Correct 51 ms 1420 KB Output is correct
6 Correct 42 ms 1420 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 20 ms 896 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 6 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 896 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 7 ms 896 KB Output is correct
4 Correct 9 ms 872 KB Output is correct
5 Correct 7 ms 896 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 6 ms 904 KB Output is correct
8 Correct 7 ms 896 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 7 ms 896 KB Output is correct
11 Correct 20 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 29 ms 896 KB Output is correct
15 Correct 8 ms 896 KB Output is correct
16 Correct 7 ms 768 KB Output is correct
17 Correct 52 ms 1408 KB Output is correct
18 Correct 114 ms 1400 KB Output is correct
19 Correct 47 ms 1528 KB Output is correct
20 Correct 53 ms 1408 KB Output is correct
21 Correct 51 ms 1420 KB Output is correct
22 Correct 42 ms 1420 KB Output is correct
23 Correct 9 ms 896 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 9 ms 896 KB Output is correct
26 Correct 9 ms 896 KB Output is correct
27 Correct 20 ms 896 KB Output is correct
28 Correct 7 ms 896 KB Output is correct
29 Correct 6 ms 896 KB Output is correct
30 Correct 39 ms 1408 KB Output is correct
31 Correct 43 ms 1408 KB Output is correct
32 Correct 71 ms 1924 KB Output is correct
33 Correct 63 ms 1408 KB Output is correct
34 Correct 80 ms 1408 KB Output is correct
35 Correct 42 ms 1408 KB Output is correct
36 Correct 118 ms 3324 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 49 ms 1408 KB Output is correct
40 Correct 101 ms 1408 KB Output is correct
41 Correct 47 ms 1408 KB Output is correct
42 Correct 51 ms 1528 KB Output is correct
43 Correct 40 ms 1280 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 9 ms 896 KB Output is correct
46 Correct 11 ms 1024 KB Output is correct
47 Correct 22 ms 896 KB Output is correct
48 Correct 137 ms 3448 KB Output is correct
49 Correct 117 ms 3448 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 76 ms 1280 KB Output is correct
52 Correct 37 ms 1280 KB Output is correct
53 Correct 41 ms 1280 KB Output is correct
54 Correct 7 ms 768 KB Output is correct
55 Correct 6 ms 768 KB Output is correct
56 Correct 6 ms 768 KB Output is correct
57 Correct 7 ms 768 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 6 ms 768 KB Output is correct
60 Correct 6 ms 768 KB Output is correct
61 Correct 6 ms 768 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 9 ms 768 KB Output is correct