oj.uz

답안 #842171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
842171 2023-09-02T13:16:43 Z Tob 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 81 ms 4332 KB 
#include <bits/stdc++.h>

#define ll long long
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef pair <ll, ll> pii;

const int N = 107, K = 1007;
const ll inf = 1e18;

int n, m, k;
ll b[N][K], s[N][K], d[N][N], pr[N][N], dis[N][N];

void Min(ll& x, ll y) {x = min(x, y);}
void Max(ll& x, ll y) {x = max(x, y);}

int main () {
	FIO;
	cin >> n >> m >> k;
	
	for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) d[i][j] = inf;
	for (int i = 1; i <= n; i++) {
		d[i][i] = 0;
		for (int j = 1; j <= k; j++) {
			cin >> b[i][j] >> s[i][j];
		}
	}
	for (int i = 1; i <= m; i++) {
		ll x, y, w; cin >> x >> y >> w;
		d[x][y] = w;
	}
	for (int ii = 1; ii <= n; ii++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				Min(d[i][j], d[i][ii] + d[ii][j]);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (d[i][j] == inf) continue;
			pr[i][j] = 0;
			for (int ii = 1; ii <= k; ii++) {
				if (b[i][ii] != -1 && s[j][ii] != -1) Max(pr[i][j], s[j][ii] - b[i][ii]);
			}
		}
	}
	ll lo = 0, hi = 1e9;
	while (lo < hi) {
		ll mid = (lo + hi + 1) / 2;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				if (d[i][j] == inf || i == j) dis[i][j] = inf;
				else dis[i][j] = -pr[i][j] + d[i][j] * mid;
			}
		}
		for (int ii = 1; ii <= n; ii++) {
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= n; j++) {
					Min(dis[i][j], dis[i][ii] + dis[ii][j]);
				}
			}
		}
		int ok = 0;
		for (int i = 1; i <= n; i++) {
			ok |= (dis[i][i] <= 0);
		}
		if (ok) lo = mid;
		else hi = mid-1;
	}
	
	cout << lo << "\n";

	return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 2136 KB Output is correct
2 Correct 29 ms 1624 KB Output is correct
3 Correct 33 ms 1372 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 996 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 992 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 856 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 992 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 860 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 6 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 5 ms 1116 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 4 ms 860 KB Output is correct
19 Correct 4 ms 988 KB Output is correct
20 Correct 6 ms 860 KB Output is correct
21 Correct 5 ms 988 KB Output is correct
22 Correct 6 ms 1112 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 4 ms 1060 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 4 ms 952 KB Output is correct
28 Correct 5 ms 836 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 6 ms 860 KB Output is correct
31 Correct 6 ms 1012 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1060 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 4 ms 952 KB Output is correct
4 Correct 5 ms 836 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 6 ms 860 KB Output is correct
7 Correct 6 ms 1012 KB Output is correct
8 Correct 29 ms 1628 KB Output is correct
9 Correct 68 ms 2140 KB Output is correct
10 Correct 31 ms 1572 KB Output is correct
11 Correct 40 ms 1628 KB Output is correct
12 Correct 30 ms 1628 KB Output is correct
13 Correct 36 ms 1628 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 5 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 1116 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 5 ms 1116 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 4 ms 988 KB Output is correct
12 Correct 6 ms 860 KB Output is correct
13 Correct 5 ms 988 KB Output is correct
14 Correct 6 ms 1112 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 29 ms 1628 KB Output is correct
18 Correct 68 ms 2140 KB Output is correct
19 Correct 31 ms 1572 KB Output is correct
20 Correct 40 ms 1628 KB Output is correct
21 Correct 30 ms 1628 KB Output is correct
22 Correct 36 ms 1628 KB Output is correct
23 Correct 4 ms 1060 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 4 ms 952 KB Output is correct
26 Correct 5 ms 836 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 6 ms 860 KB Output is correct
29 Correct 6 ms 1012 KB Output is correct
30 Correct 45 ms 2136 KB Output is correct
31 Correct 29 ms 1624 KB Output is correct
32 Correct 33 ms 1372 KB Output is correct
33 Correct 4 ms 860 KB Output is correct
34 Correct 4 ms 996 KB Output is correct
35 Correct 4 ms 856 KB Output is correct
36 Correct 4 ms 860 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 992 KB Output is correct
39 Correct 5 ms 860 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 4 ms 860 KB Output is correct
43 Correct 28 ms 1372 KB Output is correct
44 Correct 32 ms 1568 KB Output is correct
45 Correct 46 ms 2676 KB Output is correct
46 Correct 30 ms 1628 KB Output is correct
47 Correct 36 ms 1628 KB Output is correct
48 Correct 29 ms 1628 KB Output is correct
49 Correct 71 ms 4068 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 31 ms 1540 KB Output is correct
53 Correct 34 ms 1884 KB Output is correct
54 Correct 36 ms 1372 KB Output is correct
55 Correct 28 ms 1372 KB Output is correct
56 Correct 29 ms 1372 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 5 ms 1116 KB Output is correct
59 Correct 5 ms 1100 KB Output is correct
60 Correct 5 ms 1116 KB Output is correct
61 Correct 81 ms 4280 KB Output is correct
62 Correct 77 ms 4332 KB Output is correct
63 Correct 1 ms 604 KB Output is correct