oj.uz

Submission #541631

# Submission time Handle Problem Language Result Execution time Memory
541631 2022-03-23T23:02:06 Z LucaDantas Travelling Merchant (APIO17_merchant) C++17
100 / 100
 87 ms 3312 KB 
#pragma GCC optmize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 110, maxk = 1010, inf = 0x3f3f3f3f;

int valor[maxn][maxn]; // grafo completo final
int dist[maxn][maxn]; // floyd warshall

int b[maxn][maxk], s[maxn][maxk];

long long dp[maxn][maxn];

int main() {
	int n, m, k; scanf("%d %d %d", &n, &m, &k);
	memset(dist, 0x3f, sizeof dist);
	
	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 = 0; i < m; i++) {
		int a, b, w; scanf("%d %d %d", &a, &b, &w);
		dist[a][b] = w;
	}

	for(int l = 1; l <= n; l++)
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				if(dist[i][l] < inf && dist[l][j] < inf)
					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)
					valor[i][j] = max(valor[i][j], -b[i][l] +s[j][l]); // compro 'l' em 'i' e vendo em 'j'

	int ans = 0;

	int l = 0, r = inf;
	// int l = 0, r = 5;
	while(l <= r) {
		int x = (l+r) >> 1;
		
		memset(dp, 0x3f, sizeof dp);

		// sum_valor / sum_dist <= x ==> sum_valor - x * sum_dist <= 0 ==> quero achar o maior ciclo assim
		// sum_dist * x - sum_valor >= 0 ==> agora o menor ciclo tem que ser maior que 0 (igual ao maior ciclo anterior ser menor que 0)

		long long mn = 1;
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				if(dist[i][j] != inf) dp[i][j] = 1ll * dist[i][j] * x - valor[i][j];
		
		for(int l = 1; l <= n; l++)
			for(int i = 1; i <= n; i++)
				for(int j = 1; j <= n; j++)
					dp[i][j] = min(dp[i][j], dp[i][l] + dp[l][j]);

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

		// printf("%d %lld\n", x, mn);

		if(mn <= 0) {
			ans = x;
			l = x+1;
		} else {
			r = x-1;
		}
	}

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

Compilation message

merchant.cpp:1: warning: ignoring '#pragma GCC optmize' [-Wunknown-pragmas]
    1 | #pragma GCC optmize("O3")
      | 
merchant.cpp: In function 'int main()':
merchant.cpp:16:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  int n, m, k; scanf("%d %d %d", &n, &m, &k);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:21:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |    scanf("%d %d", &b[i][j], &s[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:24:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   int a, b, w; scanf("%d %d %d", &a, &b, &w);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1236 KB Output is correct
2 Correct 28 ms 1236 KB Output is correct
3 Correct 29 ms 1236 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 7 ms 824 KB Output is correct
7 Correct 8 ms 836 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 1 ms 468 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 7 ms 824 KB Output is correct
2 Correct 8 ms 836 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 4 ms 848 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 4 ms 828 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 5 ms 872 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 5 ms 824 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 8 ms 896 KB Output is correct
26 Correct 1 ms 440 KB Output is correct
27 Correct 8 ms 892 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 5 ms 828 KB Output is correct
31 Correct 5 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 896 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 8 ms 892 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 828 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 35 ms 1236 KB Output is correct
9 Correct 79 ms 3036 KB Output is correct
10 Correct 29 ms 1364 KB Output is correct
11 Correct 34 ms 1600 KB Output is correct
12 Correct 34 ms 1492 KB Output is correct
13 Correct 29 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 4 ms 828 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 872 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 824 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 35 ms 1236 KB Output is correct
18 Correct 79 ms 3036 KB Output is correct
19 Correct 29 ms 1364 KB Output is correct
20 Correct 34 ms 1600 KB Output is correct
21 Correct 34 ms 1492 KB Output is correct
22 Correct 29 ms 1364 KB Output is correct
23 Correct 8 ms 896 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 8 ms 892 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 5 ms 828 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 50 ms 1236 KB Output is correct
31 Correct 28 ms 1236 KB Output is correct
32 Correct 29 ms 1236 KB Output is correct
33 Correct 5 ms 852 KB Output is correct
34 Correct 5 ms 852 KB Output is correct
35 Correct 7 ms 824 KB Output is correct
36 Correct 8 ms 836 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 5 ms 852 KB Output is correct
39 Correct 5 ms 852 KB Output is correct
40 Correct 4 ms 848 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 28 ms 1236 KB Output is correct
44 Correct 30 ms 1236 KB Output is correct
45 Correct 45 ms 1732 KB Output is correct
46 Correct 29 ms 1352 KB Output is correct
47 Correct 33 ms 1356 KB Output is correct
48 Correct 31 ms 1236 KB Output is correct
49 Correct 85 ms 3224 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 28 ms 1236 KB Output is correct
53 Correct 30 ms 1364 KB Output is correct
54 Correct 29 ms 1236 KB Output is correct
55 Correct 30 ms 1236 KB Output is correct
56 Correct 28 ms 1236 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 6 ms 896 KB Output is correct
59 Correct 6 ms 968 KB Output is correct
60 Correct 6 ms 972 KB Output is correct
61 Correct 84 ms 3312 KB Output is correct
62 Correct 87 ms 3304 KB Output is correct
63 Correct 1 ms 468 KB Output is correct