oj.uz

답안 #379960

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379960 2021-03-19T19:52:29 Z rainboy 여행하는 상인 (APIO17_merchant) C
100 / 100
 97 ms 3436 KB 
#include <stdio.h>
#include <string.h>

#define N	100
#define C	1000

int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

long long cc[N][N]; int n;

int bellman_ford() {
	static long long dd[N], dd_[N];
	static int kk[N], kk_[N];
	int r, i, j;

	memset(dd, 0, n * sizeof *dd), memset(kk, 0, n * sizeof *kk);
	for (r = 0; r < n; r++) {
		int upd;

		memcpy(dd_, dd, n * sizeof *dd), memcpy(kk_, kk, n * sizeof *kk);
		upd = 0;
		for (i = 0; i < n; i++)
			for (j = 0; j < n; j++)
				if (i != j) {
					long long d = dd[i] + cc[i][j];
					int k = kk[i] + 1;

					if (dd_[j] > d || dd_[j] == d && kk_[j] < k)
						dd_[j] = d, kk_[j] = k, upd = 1;
				}
		memcpy(dd, dd_, n * sizeof *dd_), memcpy(kk, kk_, n * sizeof *kk_);
		if (!upd)
			return 0;
	}
	return 1;
}

int main() {
	static int bb[N][C], ss[N][C], dd[N][N], pp[N][N];
	int m, c, h, i, j, k, lower, upper;

	scanf("%d%d%d", &n, &m, &c);
	for (i = 0; i < n; i++)
		for (h = 0; h < c; h++)
			scanf("%d%d", &bb[i][h], &ss[i][h]);
	for (i = 0; i < n; i++) {
		memset(dd[i], 0x3f, n * sizeof *dd[i]);
		dd[i][i] = 0;
	}
	while (m--) {
		int d;

		scanf("%d%d%d", &i, &j, &d), i--, j--;
		dd[i][j] = d;
	}
	for (k = 0; k < n; k++)
		for (i = 0; i < n; i++)
			for (j = 0; j < n; j++)
				dd[i][j] = min(dd[i][j], dd[i][k] + dd[k][j]);
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			for (h = 0; h < c; h++)
				if (bb[i][h] != -1 && ss[j][h] != -1)
					pp[i][j] = max(pp[i][j], ss[j][h] - bb[i][h]);
	lower = 0, upper = 1000000001;
	while (upper - lower > 1) {
		int c = (lower + upper) / 2;

		for (i = 0; i < n; i++)
			for (j = 0; j < n; j++)
				cc[i][j] = (long long) dd[i][j] * c - pp[i][j];
		if (bellman_ford())
			lower = c;
		else
			upper = c;
	}
	printf("%d\n", lower);
	return 0;
}

Compilation message

merchant.c: In function 'bellman_ford':
merchant.c:29:36: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   29 |      if (dd_[j] > d || dd_[j] == d && kk_[j] < k)
      |                        ~~~~~~~~~~~~^~~~~~~~~~~~~
merchant.c: In function 'main':
merchant.c:43:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   43 |  scanf("%d%d%d", &n, &m, &c);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.c:46:4: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   46 |    scanf("%d%d", &bb[i][h], &ss[i][h]);
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.c:54:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   54 |   scanf("%d%d%d", &i, &j, &d), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 2540 KB Output is correct
2 Correct 8 ms 1260 KB Output is correct
3 Correct 76 ms 1260 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 7 ms 748 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 10 ms 748 KB Output is correct
10 Correct 5 ms 1004 KB Output is correct
11 Correct 4 ms 748 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 748 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 7 ms 748 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 10 ms 748 KB Output is correct
5 Correct 5 ms 1004 KB Output is correct
6 Correct 4 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 3 ms 748 KB Output is correct
10 Correct 4 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 3 ms 768 KB Output is correct
13 Correct 8 ms 876 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 3 ms 748 KB Output is correct
16 Correct 3 ms 748 KB Output is correct
17 Correct 5 ms 748 KB Output is correct
18 Correct 7 ms 748 KB Output is correct
19 Correct 7 ms 876 KB Output is correct
20 Correct 9 ms 876 KB Output is correct
21 Correct 5 ms 748 KB Output is correct
22 Correct 5 ms 748 KB Output is correct
23 Correct 6 ms 876 KB Output is correct
24 Correct 6 ms 748 KB Output is correct
25 Correct 6 ms 748 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 11 ms 1024 KB Output is correct
28 Correct 7 ms 876 KB Output is correct
29 Correct 6 ms 876 KB Output is correct
30 Correct 7 ms 748 KB Output is correct
31 Correct 5 ms 748 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 748 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 11 ms 1024 KB Output is correct
4 Correct 7 ms 876 KB Output is correct
5 Correct 6 ms 876 KB Output is correct
6 Correct 7 ms 748 KB Output is correct
7 Correct 5 ms 748 KB Output is correct
8 Correct 28 ms 1388 KB Output is correct
9 Correct 97 ms 3052 KB Output is correct
10 Correct 37 ms 1260 KB Output is correct
11 Correct 17 ms 1388 KB Output is correct
12 Correct 62 ms 1388 KB Output is correct
13 Correct 31 ms 1260 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 748 KB Output is correct
2 Correct 4 ms 748 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 8 ms 876 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 3 ms 748 KB Output is correct
8 Correct 3 ms 748 KB Output is correct
9 Correct 5 ms 748 KB Output is correct
10 Correct 7 ms 748 KB Output is correct
11 Correct 7 ms 876 KB Output is correct
12 Correct 9 ms 876 KB Output is correct
13 Correct 5 ms 748 KB Output is correct
14 Correct 5 ms 748 KB Output is correct
15 Correct 6 ms 876 KB Output is correct
16 Correct 6 ms 748 KB Output is correct
17 Correct 28 ms 1388 KB Output is correct
18 Correct 97 ms 3052 KB Output is correct
19 Correct 37 ms 1260 KB Output is correct
20 Correct 17 ms 1388 KB Output is correct
21 Correct 62 ms 1388 KB Output is correct
22 Correct 31 ms 1260 KB Output is correct
23 Correct 6 ms 748 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 11 ms 1024 KB Output is correct
26 Correct 7 ms 876 KB Output is correct
27 Correct 6 ms 876 KB Output is correct
28 Correct 7 ms 748 KB Output is correct
29 Correct 5 ms 748 KB Output is correct
30 Correct 37 ms 2540 KB Output is correct
31 Correct 8 ms 1260 KB Output is correct
32 Correct 76 ms 1260 KB Output is correct
33 Correct 2 ms 768 KB Output is correct
34 Correct 3 ms 748 KB Output is correct
35 Correct 1 ms 748 KB Output is correct
36 Correct 7 ms 748 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 10 ms 748 KB Output is correct
39 Correct 5 ms 1004 KB Output is correct
40 Correct 4 ms 748 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 2 ms 748 KB Output is correct
43 Correct 13 ms 1260 KB Output is correct
44 Correct 19 ms 1260 KB Output is correct
45 Correct 47 ms 1772 KB Output is correct
46 Correct 19 ms 1280 KB Output is correct
47 Correct 28 ms 1260 KB Output is correct
48 Correct 20 ms 1388 KB Output is correct
49 Correct 77 ms 3180 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 16 ms 1260 KB Output is correct
53 Correct 14 ms 1388 KB Output is correct
54 Correct 10 ms 1260 KB Output is correct
55 Correct 19 ms 1260 KB Output is correct
56 Correct 21 ms 1260 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 6 ms 876 KB Output is correct
59 Correct 6 ms 1004 KB Output is correct
60 Correct 6 ms 876 KB Output is correct
61 Correct 84 ms 3436 KB Output is correct
62 Correct 93 ms 3308 KB Output is correct
63 Correct 1 ms 364 KB Output is correct