답안 #541635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
541635	2022-03-23T23:21:44 Z	LucaDantas	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	94 ms	1244 KB

merchant

#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 101, maxk = 1001, inf = 0x3f3f3f3f;

int valor[maxn][maxn];
int dist[maxn][maxn];

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;
	while(l <= r) {
		int x = (l+r) >> 1;
		
		memset(dp, 0x3f, sizeof dp);

		// quero achar o menor x tal que {media < x}, então a resposta é x-1

		// sum_valor / sum_dist < x ==> sum_valor - x * sum_dist < 0 ==>
		// sum_dist * x - sum_valor > 0 ==> agora o menor ciclo tem que ser maior 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]);

		if(mn > 0) {
			ans = x-1; // resposta invalida, então a ultima valida é x-1 (assumindo que x já é o valor final)
			r = x-1;
		} else {
			l = x+1;
		}
	}

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

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:14:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  int n, m, k; scanf("%d %d %d", &n, &m, &k);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:19:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |    scanf("%d %d", &b[i][j], &s[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:22:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |   int a, b, w; scanf("%d %d %d", &a, &b, &w);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	61 ms	1192 KB	Output is correct
2	Correct	32 ms	1208 KB	Output is correct
3	Correct	32 ms	1108 KB	Output is correct
4	Correct	5 ms	820 KB	Output is correct
5	Correct	6 ms	724 KB	Output is correct
6	Correct	5 ms	724 KB	Output is correct
7	Correct	6 ms	724 KB	Output is correct
8	Correct	1 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	5 ms	724 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	6 ms	724 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	724 KB	Output is correct
2	Correct	6 ms	724 KB	Output is correct
3	Correct	1 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	5 ms	724 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	6 ms	724 KB	Output is correct
9	Correct	6 ms	724 KB	Output is correct
10	Correct	5 ms	724 KB	Output is correct
11	Correct	6 ms	840 KB	Output is correct
12	Correct	5 ms	828 KB	Output is correct
13	Correct	7 ms	724 KB	Output is correct
14	Correct	1 ms	424 KB	Output is correct
15	Correct	5 ms	724 KB	Output is correct
16	Correct	6 ms	724 KB	Output is correct
17	Correct	5 ms	724 KB	Output is correct
18	Correct	5 ms	724 KB	Output is correct
19	Correct	9 ms	852 KB	Output is correct
20	Correct	6 ms	836 KB	Output is correct
21	Correct	7 ms	724 KB	Output is correct
22	Correct	6 ms	724 KB	Output is correct
23	Correct	6 ms	724 KB	Output is correct
24	Correct	5 ms	840 KB	Output is correct
25	Correct	8 ms	844 KB	Output is correct
26	Correct	0 ms	468 KB	Output is correct
27	Correct	6 ms	724 KB	Output is correct
28	Correct	6 ms	724 KB	Output is correct
29	Correct	6 ms	840 KB	Output is correct
30	Correct	5 ms	724 KB	Output is correct
31	Correct	5 ms	724 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	844 KB	Output is correct
2	Correct	0 ms	468 KB	Output is correct
3	Correct	6 ms	724 KB	Output is correct
4	Correct	6 ms	724 KB	Output is correct
5	Correct	6 ms	840 KB	Output is correct
6	Correct	5 ms	724 KB	Output is correct
7	Correct	5 ms	724 KB	Output is correct
8	Correct	42 ms	1236 KB	Output is correct
9	Correct	94 ms	1244 KB	Output is correct
10	Correct	35 ms	1236 KB	Output is correct
11	Correct	37 ms	1236 KB	Output is correct
12	Correct	38 ms	1176 KB	Output is correct
13	Correct	37 ms	1236 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	724 KB	Output is correct
2	Correct	5 ms	724 KB	Output is correct
3	Correct	6 ms	840 KB	Output is correct
4	Correct	5 ms	828 KB	Output is correct
5	Correct	7 ms	724 KB	Output is correct
6	Correct	1 ms	424 KB	Output is correct
7	Correct	5 ms	724 KB	Output is correct
8	Correct	6 ms	724 KB	Output is correct
9	Correct	5 ms	724 KB	Output is correct
10	Correct	5 ms	724 KB	Output is correct
11	Correct	9 ms	852 KB	Output is correct
12	Correct	6 ms	836 KB	Output is correct
13	Correct	7 ms	724 KB	Output is correct
14	Correct	6 ms	724 KB	Output is correct
15	Correct	6 ms	724 KB	Output is correct
16	Correct	5 ms	840 KB	Output is correct
17	Correct	42 ms	1236 KB	Output is correct
18	Correct	94 ms	1244 KB	Output is correct
19	Correct	35 ms	1236 KB	Output is correct
20	Correct	37 ms	1236 KB	Output is correct
21	Correct	38 ms	1176 KB	Output is correct
22	Correct	37 ms	1236 KB	Output is correct
23	Correct	8 ms	844 KB	Output is correct
24	Correct	0 ms	468 KB	Output is correct
25	Correct	6 ms	724 KB	Output is correct
26	Correct	6 ms	724 KB	Output is correct
27	Correct	6 ms	840 KB	Output is correct
28	Correct	5 ms	724 KB	Output is correct
29	Correct	5 ms	724 KB	Output is correct
30	Correct	61 ms	1192 KB	Output is correct
31	Correct	32 ms	1208 KB	Output is correct
32	Correct	32 ms	1108 KB	Output is correct
33	Correct	5 ms	820 KB	Output is correct
34	Correct	6 ms	724 KB	Output is correct
35	Correct	5 ms	724 KB	Output is correct
36	Correct	6 ms	724 KB	Output is correct
37	Correct	1 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	5 ms	724 KB	Output is correct
41	Correct	1 ms	468 KB	Output is correct
42	Correct	6 ms	724 KB	Output is correct
43	Correct	35 ms	1244 KB	Output is correct
44	Correct	37 ms	1236 KB	Output is correct
45	Correct	57 ms	1224 KB	Output is correct
46	Correct	41 ms	1236 KB	Output is correct
47	Correct	37 ms	1236 KB	Output is correct
48	Correct	37 ms	1140 KB	Output is correct
49	Correct	85 ms	1232 KB	Output is correct
50	Correct	1 ms	468 KB	Output is correct
51	Correct	1 ms	468 KB	Output is correct
52	Correct	33 ms	1244 KB	Output is correct
53	Correct	38 ms	1236 KB	Output is correct
54	Correct	42 ms	1236 KB	Output is correct
55	Correct	41 ms	1236 KB	Output is correct
56	Correct	32 ms	1236 KB	Output is correct
57	Correct	1 ms	468 KB	Output is correct
58	Correct	6 ms	724 KB	Output is correct
59	Correct	9 ms	724 KB	Output is correct
60	Correct	7 ms	724 KB	Output is correct
61	Correct	91 ms	1128 KB	Output is correct
62	Correct	91 ms	1144 KB	Output is correct
63	Correct	0 ms	340 KB	Output is correct

답안 #541635

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0