oj.uz

답안 #654100

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
654100 2022-10-29T23:54:18 Z thiago_bastos 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 76 ms 3388 KB 
#include "bits/stdc++.h"

using namespace std;

#define INF 1000000000
#define INFLL 1000000000000000000ll
#define EPS 1e-9
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define fi first
#define sc second
 
using i64 = long long;
using u64 = unsigned long long;
using ld = long double;
using ii = pair<int, int>;	

const int N = 100, M = 1000;

i64 tms[N][N], cost[N][N], d[N][N];
int buy[N][M], sell[N][M];
int n, m, k;

void solve() {
	cin >> n >> m >> k;

	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < n; ++j) tms[i][j] = i == j ? 0 : INFLL;
		for(int j = 0; j < k; ++j) cin >> buy[i][j] >> sell[i][j];
	}

	for(int i = 0; i < m; ++i) {
		int u, v, t;
		cin >> u >> v >> t;	
		--u, --v;
		tms[u][v] = t;
	}

	for(int k = 0; k < n; ++k)
	for(int i = 0; i < n; ++i)
	for(int j = 0; j < n; ++j)
		tms[i][j] = min(tms[i][j], tms[i][k] + tms[k][j]);
	
	int l = 0, r = 1e9 + 1;

	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < n; ++j) {
			for(int l = 0; l < k; ++l) {
				i64 X = min(sell[j][l], buy[i][l]) >= 0 ? max(0, sell[j][l] - buy[i][l]) : 0;
				d[i][j] = max(X, d[i][j]);				
			}
		}
	}

	while(l < r) {
		int m = (l + r) / 2;

		for(int i = 0; i < n; ++i)
		for(int j = 0; j < n; ++j)
			cost[i][j] = i != j && tms[i][j] != INFLL ? d[i][j] - m * tms[i][j] : -INFLL;

		for(int k = 0; k < n; ++k)
		for(int i = 0; i < n; ++i)
		for(int j = 0; j < n; ++j)
			cost[i][j] = max(cost[i][j], cost[i][k] + cost[k][j]);

		bool ok = false;

		for(int i = 0; i < n; ++i) ok = ok || cost[i][i] >= 0;

		if(!ok) r = m;
		else l = m + 1;
	}

	cout << max(0, r - 1) << '\n';
}	

int main() {
	ios_base :: sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
 //	cin >> t;
	while(t--) solve();
	return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 1316 KB Output is correct
2 Correct 45 ms 1336 KB Output is correct
3 Correct 46 ms 1320 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 840 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 5 ms 724 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 6 ms 844 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 5 ms 724 KB Output is correct
9 Correct 6 ms 724 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 6 ms 724 KB Output is correct
12 Correct 6 ms 724 KB Output is correct
13 Correct 6 ms 836 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 5 ms 724 KB Output is correct
16 Correct 6 ms 840 KB Output is correct
17 Correct 5 ms 724 KB Output is correct
18 Correct 8 ms 724 KB Output is correct
19 Correct 5 ms 836 KB Output is correct
20 Correct 8 ms 724 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 5 ms 724 KB Output is correct
23 Correct 6 ms 840 KB Output is correct
24 Correct 5 ms 724 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 6 ms 724 KB Output is correct
28 Correct 6 ms 724 KB Output is correct
29 Correct 5 ms 724 KB Output is correct
30 Correct 6 ms 840 KB Output is correct
31 Correct 5 ms 724 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 6 ms 724 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 6 ms 840 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 37 ms 1236 KB Output is correct
9 Correct 68 ms 1320 KB Output is correct
10 Correct 33 ms 1336 KB Output is correct
11 Correct 48 ms 1316 KB Output is correct
12 Correct 39 ms 1316 KB Output is correct
13 Correct 43 ms 1320 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 724 KB Output is correct
2 Correct 6 ms 724 KB Output is correct
3 Correct 6 ms 724 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 6 ms 836 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 6 ms 840 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 8 ms 724 KB Output is correct
11 Correct 5 ms 836 KB Output is correct
12 Correct 8 ms 724 KB Output is correct
13 Correct 5 ms 844 KB Output is correct
14 Correct 5 ms 724 KB Output is correct
15 Correct 6 ms 840 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 37 ms 1236 KB Output is correct
18 Correct 68 ms 1320 KB Output is correct
19 Correct 33 ms 1336 KB Output is correct
20 Correct 48 ms 1316 KB Output is correct
21 Correct 39 ms 1316 KB Output is correct
22 Correct 43 ms 1320 KB Output is correct
23 Correct 7 ms 844 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 6 ms 724 KB Output is correct
26 Correct 6 ms 724 KB Output is correct
27 Correct 5 ms 724 KB Output is correct
28 Correct 6 ms 840 KB Output is correct
29 Correct 5 ms 724 KB Output is correct
30 Correct 58 ms 1316 KB Output is correct
31 Correct 45 ms 1336 KB Output is correct
32 Correct 46 ms 1320 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 840 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 844 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 6 ms 852 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 5 ms 724 KB Output is correct
43 Correct 32 ms 1236 KB Output is correct
44 Correct 35 ms 1332 KB Output is correct
45 Correct 53 ms 1696 KB Output is correct
46 Correct 36 ms 1364 KB Output is correct
47 Correct 38 ms 1364 KB Output is correct
48 Correct 34 ms 1400 KB Output is correct
49 Correct 63 ms 3180 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 32 ms 1340 KB Output is correct
53 Correct 36 ms 1364 KB Output is correct
54 Correct 46 ms 1364 KB Output is correct
55 Correct 33 ms 1236 KB Output is correct
56 Correct 31 ms 1232 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 7 ms 940 KB Output is correct
59 Correct 7 ms 852 KB Output is correct
60 Correct 6 ms 856 KB Output is correct
61 Correct 69 ms 3388 KB Output is correct
62 Correct 76 ms 3360 KB Output is correct
63 Correct 1 ms 340 KB Output is correct