oj.uz

답안 #466343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466343 2021-08-18T19:02:01 Z nonsensenonsense1 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 87 ms 2268 KB 
#include <cstdio>
#include <cstring>
#include <utility>
#include <algorithm>

const int N = 100;
const int K = 1000;

int n, m, k, dist[N][N], val[N][N], b[N][K][2];
long long to[N];
bool prev[N], cur[N];

bool test(int x) 
{
	memset(to, 0xcf, N << 3);
	memset(cur, 0, N);
	cur[0] = 1;
	to[0] = 0;
	for (int i = 0; i <= n; ++i) {
		std::swap(cur, prev);
		memset(cur, 0, N);
		for (int j = 0; j < n; ++j) if (prev[j]) for (int k = 0; k < n; ++k) {
			long long d = to[j] + val[j][k] - (long long)dist[j][k] * x;
			if (d >= to[k]) {
				cur[k] = true;
				to[k] = d;
			}
		}
	}
	for (int i = 0; i < 2 * n; ++i) if (cur[i]) return true;
	return false;
}

int main() 
{
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 0; i < n; ++i) for (int j = 0; j < k; ++j) scanf("%d%d", b[i][j], b[i][j] + 1);
	memset(*dist, 0x3f, N * N << 2);
	for (int i = 0; i < m; ++i) {
		int v, w, t;
		scanf("%d%d%d", &v, &w, &t);
		dist[v - 1][w - 1] = t;
	}
	for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) for (int k = 0; k < n; ++k) dist[j][k] = std::min(dist[j][k], dist[j][i] + dist[i][k]);
	for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) for (int l = 0; l < k; ++l) if (b[i][l][0] != -1 && b[j][l][1] != -1) val[i][j] = std::max(val[i][j], b[j][l][1] - b[i][l][0]);
	int l = 0, r = 1000000000, ans;
	while (l <= r) {
		int m = l + r >> 1;
		if (test(m)) {
			ans = m;
			l = m + 1;
		}
		else r = m - 1;
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:48:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   48 |   int m = l + r >> 1;
      |           ~~^~~
merchant.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |  scanf("%d%d%d", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:37:63: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  for (int i = 0; i < n; ++i) for (int j = 0; j < k; ++j) scanf("%d%d", b[i][j], b[i][j] + 1);
      |                                                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |   scanf("%d%d%d", &v, &w, &t);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 972 KB Output is correct
2 Correct 44 ms 588 KB Output is correct
3 Correct 63 ms 692 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 6 ms 460 KB Output is correct
7 Correct 6 ms 460 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 9 ms 516 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 3 ms 460 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 460 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 9 ms 516 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 5 ms 536 KB Output is correct
10 Correct 6 ms 460 KB Output is correct
11 Correct 7 ms 460 KB Output is correct
12 Correct 6 ms 460 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 5 ms 576 KB Output is correct
20 Correct 4 ms 588 KB Output is correct
21 Correct 4 ms 460 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 5 ms 716 KB Output is correct
24 Correct 5 ms 460 KB Output is correct
25 Correct 6 ms 548 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 7 ms 716 KB Output is correct
28 Correct 4 ms 588 KB Output is correct
29 Correct 4 ms 588 KB Output is correct
30 Correct 4 ms 460 KB Output is correct
31 Correct 3 ms 532 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 548 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 7 ms 716 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 3 ms 532 KB Output is correct
8 Correct 42 ms 832 KB Output is correct
9 Correct 87 ms 2264 KB Output is correct
10 Correct 26 ms 864 KB Output is correct
11 Correct 36 ms 972 KB Output is correct
12 Correct 43 ms 972 KB Output is correct
13 Correct 21 ms 844 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 536 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 7 ms 460 KB Output is correct
4 Correct 6 ms 460 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 5 ms 576 KB Output is correct
12 Correct 4 ms 588 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 3 ms 460 KB Output is correct
15 Correct 5 ms 716 KB Output is correct
16 Correct 5 ms 460 KB Output is correct
17 Correct 42 ms 832 KB Output is correct
18 Correct 87 ms 2264 KB Output is correct
19 Correct 26 ms 864 KB Output is correct
20 Correct 36 ms 972 KB Output is correct
21 Correct 43 ms 972 KB Output is correct
22 Correct 21 ms 844 KB Output is correct
23 Correct 6 ms 548 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 7 ms 716 KB Output is correct
26 Correct 4 ms 588 KB Output is correct
27 Correct 4 ms 588 KB Output is correct
28 Correct 4 ms 460 KB Output is correct
29 Correct 3 ms 532 KB Output is correct
30 Correct 52 ms 972 KB Output is correct
31 Correct 44 ms 588 KB Output is correct
32 Correct 63 ms 692 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 4 ms 460 KB Output is correct
35 Correct 6 ms 460 KB Output is correct
36 Correct 6 ms 460 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 9 ms 516 KB Output is correct
39 Correct 3 ms 460 KB Output is correct
40 Correct 4 ms 460 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 40 ms 756 KB Output is correct
44 Correct 46 ms 892 KB Output is correct
45 Correct 72 ms 1688 KB Output is correct
46 Correct 43 ms 876 KB Output is correct
47 Correct 44 ms 808 KB Output is correct
48 Correct 30 ms 892 KB Output is correct
49 Correct 79 ms 2268 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 15 ms 768 KB Output is correct
53 Correct 9 ms 828 KB Output is correct
54 Correct 9 ms 764 KB Output is correct
55 Correct 18 ms 792 KB Output is correct
56 Correct 18 ms 752 KB Output is correct
57 Correct 0 ms 332 KB Output is correct
58 Correct 5 ms 588 KB Output is correct
59 Correct 5 ms 588 KB Output is correct
60 Correct 4 ms 588 KB Output is correct
61 Correct 74 ms 2160 KB Output is correct
62 Correct 78 ms 2172 KB Output is correct
63 Correct 1 ms 280 KB Output is correct