oj.uz

답안 #745308

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745308 2023-05-19T19:44:15 Z gnu 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 90 ms 4556 KB 
#include <iostream>
#include <vector>
using namespace std;

// APIO 2017 Merchant
vector<vector<long long>> d, max_delta, d1;
struct node {
	long long v, w;
};
vector<vector<node>> gp;
vector<vector<long long>> b, s;
int main()
{
	ios_base::sync_with_stdio(false); cin.tie(nullptr);
	int n, m, k; cin >> n >> m >> k;
	gp = vector<vector<node>>(n);
	d = vector<vector<long long>>(n, vector<long long> (n, 1e18));
	b = s = vector<vector<long long>>(n, vector<long long>(k));
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < k; ++j) {
			cin >> b[i][j] >> s[i][j];
		}
	}
	vector<pair<int, int>> edges;
	for (int i = 0; i < m; ++i) {
		int u, v, w; cin >> u >> v >> w;
		--u, --v;
		gp[u].push_back({ v, w });
		d[u][v] = w;
		edges.push_back({ u, v });
	}
	//return 0;
	for (int k = 0; k < n; ++k) {
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				 d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
			}
		}
	}
	max_delta = vector<vector<long long>>(n, vector<long long>(n));
	for (int p = 0; p < k; ++p) {
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				if (s[j][p] == -1 || b[i][p] == -1) continue;
				max_delta[i][j] = max(max_delta[i][j], s[j][p] - b[i][p]);
			}
		}
	}
	// p/t >= m
	//p >= t*m;
	// p - t*m >= 0
	d1 = vector<vector<long long>> (n, vector<long long>(n, -1e18));
	long long l = 0, r = 1e11;
	while (l + 1 < r) {
		long long m = (l + r) / 2;
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				int u = i;
				int v = j;
				long long p = 1e18 / m;
				d1[u][v] = max_delta[u][v] - m * min(p, d[u][v]);
			}
		}
		for (int k = 0; k < n; ++k) {
			for (int i = 0; i < n; ++i) {
				for (int j = 0; j < n; ++j) {
					d1[i][j] = max(d1[i][j], d1[i][k] + d1[k][j]);
				}
			}
		}
		bool f = 0;
		for (int i = 0; i < n; ++i) if (d1[i][i] >= 0) f = 1;
		d1 = vector<vector<long long>>(n, vector<long long>(n, -1e18));
		if (f) l = m;
		else r = m;
	}
	cout << l << '\n';
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 3472 KB Output is correct
2 Correct 35 ms 664 KB Output is correct
3 Correct 39 ms 596 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 6 ms 328 KB Output is correct
10 Correct 8 ms 340 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 5 ms 468 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 6 ms 468 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 6 ms 328 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 7 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 6 ms 340 KB Output is correct
10 Correct 5 ms 352 KB Output is correct
11 Correct 7 ms 480 KB Output is correct
12 Correct 5 ms 472 KB Output is correct
13 Correct 6 ms 456 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 6 ms 436 KB Output is correct
16 Correct 6 ms 468 KB Output is correct
17 Correct 5 ms 352 KB Output is correct
18 Correct 6 ms 472 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 468 KB Output is correct
21 Correct 6 ms 468 KB Output is correct
22 Correct 6 ms 472 KB Output is correct
23 Correct 7 ms 608 KB Output is correct
24 Correct 6 ms 436 KB Output is correct
25 Correct 6 ms 424 KB Output is correct
26 Correct 1 ms 224 KB Output is correct
27 Correct 7 ms 468 KB Output is correct
28 Correct 7 ms 472 KB Output is correct
29 Correct 7 ms 444 KB Output is correct
30 Correct 6 ms 468 KB Output is correct
31 Correct 6 ms 416 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 424 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 7 ms 468 KB Output is correct
4 Correct 7 ms 472 KB Output is correct
5 Correct 7 ms 444 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Correct 6 ms 416 KB Output is correct
8 Correct 42 ms 864 KB Output is correct
9 Correct 81 ms 3800 KB Output is correct
10 Correct 43 ms 724 KB Output is correct
11 Correct 43 ms 1040 KB Output is correct
12 Correct 42 ms 1032 KB Output is correct
13 Correct 39 ms 824 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 5 ms 352 KB Output is correct
3 Correct 7 ms 480 KB Output is correct
4 Correct 5 ms 472 KB Output is correct
5 Correct 6 ms 456 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 6 ms 436 KB Output is correct
8 Correct 6 ms 468 KB Output is correct
9 Correct 5 ms 352 KB Output is correct
10 Correct 6 ms 472 KB Output is correct
11 Correct 6 ms 468 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 6 ms 468 KB Output is correct
14 Correct 6 ms 472 KB Output is correct
15 Correct 7 ms 608 KB Output is correct
16 Correct 6 ms 436 KB Output is correct
17 Correct 42 ms 864 KB Output is correct
18 Correct 81 ms 3800 KB Output is correct
19 Correct 43 ms 724 KB Output is correct
20 Correct 43 ms 1040 KB Output is correct
21 Correct 42 ms 1032 KB Output is correct
22 Correct 39 ms 824 KB Output is correct
23 Correct 6 ms 424 KB Output is correct
24 Correct 1 ms 224 KB Output is correct
25 Correct 7 ms 468 KB Output is correct
26 Correct 7 ms 472 KB Output is correct
27 Correct 7 ms 444 KB Output is correct
28 Correct 6 ms 468 KB Output is correct
29 Correct 6 ms 416 KB Output is correct
30 Correct 59 ms 3472 KB Output is correct
31 Correct 35 ms 664 KB Output is correct
32 Correct 39 ms 596 KB Output is correct
33 Correct 6 ms 340 KB Output is correct
34 Correct 5 ms 340 KB Output is correct
35 Correct 5 ms 340 KB Output is correct
36 Correct 6 ms 468 KB Output is correct
37 Correct 1 ms 316 KB Output is correct
38 Correct 6 ms 328 KB Output is correct
39 Correct 8 ms 340 KB Output is correct
40 Correct 7 ms 340 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 5 ms 468 KB Output is correct
43 Correct 42 ms 596 KB Output is correct
44 Correct 40 ms 852 KB Output is correct
45 Correct 53 ms 2392 KB Output is correct
46 Correct 38 ms 864 KB Output is correct
47 Correct 38 ms 852 KB Output is correct
48 Correct 44 ms 852 KB Output is correct
49 Correct 88 ms 4128 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 320 KB Output is correct
52 Correct 37 ms 724 KB Output is correct
53 Correct 42 ms 1104 KB Output is correct
54 Correct 38 ms 720 KB Output is correct
55 Correct 37 ms 692 KB Output is correct
56 Correct 38 ms 708 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 7 ms 468 KB Output is correct
59 Correct 7 ms 588 KB Output is correct
60 Correct 7 ms 596 KB Output is correct
61 Correct 89 ms 4556 KB Output is correct
62 Correct 90 ms 4520 KB Output is correct
63 Correct 0 ms 212 KB Output is correct