답안 #975498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975498 2024-05-05T10:35:28 Z colossal_pepe 여행하는 상인 (APIO17_merchant) C++17
100 / 100
84 ms 4228 KB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const ll INF = 1e9;

int n, m, o;
vector<vector<ll>> b, s, d, p;

void precalc() {
	for (int j = 0; j < n; j++) {
		for (int i = 0; i < n; i++) {
			for (int k = 0; k < n; k++) {
				if (i == k) continue;
				d[i][k] = min(d[i][k], d[i][j] + d[j][k]);
			}
		}
	}
	p.resize(n, vector<ll>(n, 0));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (d[i][j] == INF) continue;
			for (int k = 0; k < o; k++) {
				if (s[j][k] == -1 or b[i][k] == -1) continue;
				p[i][j] = max(p[i][j], s[j][k] - b[i][k]);
			}
		}
	}
}

ll solve() {
	ll lo = 0, hi = 1e9;
	auto ok = [](ll x) {
		vector<vector<ll>> dist(n, vector<ll>(n));
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				dist[i][j] = p[i][j] - d[i][j] * x;
			}
		}
		for (int j = 0; j < n; j++) {
			for (int i = 0; i < n; i++) {
				for (int k = 0; k < n; k++) {
					dist[i][k] = max(dist[i][k], dist[i][j] + dist[j][k]);
				}
			}
		}
		bool ret = 0;
		for (int i = 0; i < n; i++) {
			ret |= (dist[i][i] >= 0);
		}
		return ret;
	};
	while (hi - lo > 1) {
		ll mid = (lo + hi) / 2;
		if (ok(mid)) lo = mid;
		else hi = mid - 1;
	}
	if (ok(hi)) return hi;
	return lo;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m >> o;
	b.resize(n, vector<ll>(o)), s.resize(n, vector<ll>(o));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < o; j++) {
			cin >> b[i][j] >> s[i][j];
		}
	}
	d.resize(n, vector<ll>(n, INF));
	while (m--) {
		int u, v;
		ll w;
		cin >> u >> v >> w;
		d[u - 1][v - 1] = w;
	}
	precalc();
	cout << solve() << '\n';
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 3308 KB Output is correct
2 Correct 26 ms 600 KB Output is correct
3 Correct 28 ms 604 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 528 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 4 ms 468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 528 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 5 ms 568 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 5 ms 604 KB Output is correct
20 Correct 5 ms 604 KB Output is correct
21 Correct 4 ms 668 KB Output is correct
22 Correct 4 ms 496 KB Output is correct
23 Correct 5 ms 604 KB Output is correct
24 Correct 4 ms 348 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 604 KB Output is correct
28 Correct 4 ms 600 KB Output is correct
29 Correct 4 ms 604 KB Output is correct
30 Correct 4 ms 548 KB Output is correct
31 Correct 5 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 4 ms 600 KB Output is correct
5 Correct 4 ms 604 KB Output is correct
6 Correct 4 ms 548 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 37 ms 980 KB Output is correct
9 Correct 69 ms 3672 KB Output is correct
10 Correct 28 ms 600 KB Output is correct
11 Correct 33 ms 860 KB Output is correct
12 Correct 39 ms 860 KB Output is correct
13 Correct 30 ms 860 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 5 ms 568 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 5 ms 604 KB Output is correct
13 Correct 4 ms 668 KB Output is correct
14 Correct 4 ms 496 KB Output is correct
15 Correct 5 ms 604 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 37 ms 980 KB Output is correct
18 Correct 69 ms 3672 KB Output is correct
19 Correct 28 ms 600 KB Output is correct
20 Correct 33 ms 860 KB Output is correct
21 Correct 39 ms 860 KB Output is correct
22 Correct 30 ms 860 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 5 ms 604 KB Output is correct
26 Correct 4 ms 600 KB Output is correct
27 Correct 4 ms 604 KB Output is correct
28 Correct 4 ms 548 KB Output is correct
29 Correct 5 ms 348 KB Output is correct
30 Correct 48 ms 3308 KB Output is correct
31 Correct 26 ms 600 KB Output is correct
32 Correct 28 ms 604 KB Output is correct
33 Correct 4 ms 344 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 3 ms 492 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 4 ms 348 KB Output is correct
39 Correct 4 ms 348 KB Output is correct
40 Correct 4 ms 528 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 4 ms 468 KB Output is correct
43 Correct 33 ms 600 KB Output is correct
44 Correct 33 ms 920 KB Output is correct
45 Correct 44 ms 2396 KB Output is correct
46 Correct 29 ms 844 KB Output is correct
47 Correct 29 ms 860 KB Output is correct
48 Correct 33 ms 860 KB Output is correct
49 Correct 72 ms 4112 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 32 ms 724 KB Output is correct
53 Correct 31 ms 824 KB Output is correct
54 Correct 33 ms 604 KB Output is correct
55 Correct 28 ms 764 KB Output is correct
56 Correct 27 ms 720 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 5 ms 604 KB Output is correct
59 Correct 5 ms 604 KB Output is correct
60 Correct 5 ms 604 KB Output is correct
61 Correct 84 ms 4192 KB Output is correct
62 Correct 74 ms 4228 KB Output is correct
63 Correct 1 ms 504 KB Output is correct