oj.uz

답안 #692881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
692881 2023-02-02T06:48:06 Z penguin133 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 84 ms 5036 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif

int B[105][10005], S[105][10005], adj[105][105], prof[105][105], n, m, kk, adj2[105][105];
void solve(){
	cin >> n >> m >> kk;
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)adj[i][j] = 1e18, adj[i][i] = 0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=kk;j++)cin >> B[i][j] >> S[i][j];
	}
	while(m--){
		int x, y, z; cin >> x >> y >> z;
		adj[x][y] = min(adj[x][y], z);
	}
	for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){
		for(int k=1;k<=kk;k++)if(B[i][k] != -1 && S[j][k] != -1)prof[i][j] = max(prof[i][j], S[j][k] - B[i][k]);
	}
	int lo = 1, hi = 1e9, ans = 0;
	while(lo <= hi){
		int mid = (lo + hi) >> 1;
		for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)adj2[i][j] = 1e18;
		for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(i != j && adj[i][j] != 1e18)adj2[i][j] = min(adj2[i][j], mid * adj[i][j] - prof[i][j]);
		for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)adj2[i][j] = min(adj2[i][j], adj2[i][k] + adj2[k][j]);
		bool f = 0;
		for(int i=1;i<=n;i++)if(adj2[i][i] <= 0)f = 1;
		if(f)ans = mid, lo = mid + 1;
		else hi = mid - 1;
	}
	cout << ans;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

merchant.cpp:42:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main(){
      | ^~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 2812 KB Output is correct
2 Correct 32 ms 1312 KB Output is correct
3 Correct 32 ms 1236 KB Output is correct
4 Correct 5 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 7 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 5 ms 840 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 5 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 840 KB Output is correct
2 Correct 7 ms 852 KB Output is correct
3 Correct 0 ms 340 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 0 ms 340 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 848 KB Output is correct
10 Correct 5 ms 940 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 5 ms 864 KB Output is correct
13 Correct 8 ms 980 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 5 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 5 ms 844 KB Output is correct
18 Correct 7 ms 856 KB Output is correct
19 Correct 6 ms 848 KB Output is correct
20 Correct 6 ms 852 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 5 ms 828 KB Output is correct
23 Correct 8 ms 916 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 5 ms 848 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 5 ms 848 KB Output is correct
8 Correct 38 ms 1556 KB Output is correct
9 Correct 79 ms 2764 KB Output is correct
10 Correct 33 ms 1364 KB Output is correct
11 Correct 39 ms 1552 KB Output is correct
12 Correct 39 ms 1568 KB Output is correct
13 Correct 35 ms 1460 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 848 KB Output is correct
2 Correct 5 ms 940 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 5 ms 864 KB Output is correct
5 Correct 8 ms 980 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 844 KB Output is correct
10 Correct 7 ms 856 KB Output is correct
11 Correct 6 ms 848 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 5 ms 828 KB Output is correct
15 Correct 8 ms 916 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 38 ms 1556 KB Output is correct
18 Correct 79 ms 2764 KB Output is correct
19 Correct 33 ms 1364 KB Output is correct
20 Correct 39 ms 1552 KB Output is correct
21 Correct 39 ms 1568 KB Output is correct
22 Correct 35 ms 1460 KB Output is correct
23 Correct 5 ms 852 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 5 ms 848 KB Output is correct
30 Correct 52 ms 2812 KB Output is correct
31 Correct 32 ms 1312 KB Output is correct
32 Correct 32 ms 1236 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 6 ms 840 KB Output is correct
36 Correct 7 ms 852 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 5 ms 840 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 31 ms 1364 KB Output is correct
44 Correct 34 ms 1620 KB Output is correct
45 Correct 47 ms 3028 KB Output is correct
46 Correct 33 ms 1620 KB Output is correct
47 Correct 35 ms 1632 KB Output is correct
48 Correct 39 ms 1620 KB Output is correct
49 Correct 82 ms 4880 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 31 ms 1372 KB Output is correct
53 Correct 33 ms 1492 KB Output is correct
54 Correct 33 ms 1492 KB Output is correct
55 Correct 32 ms 1364 KB Output is correct
56 Correct 34 ms 1484 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 7 ms 980 KB Output is correct
59 Correct 6 ms 980 KB Output is correct
60 Correct 7 ms 980 KB Output is correct
61 Correct 83 ms 5032 KB Output is correct
62 Correct 84 ms 5036 KB Output is correct
63 Correct 1 ms 340 KB Output is correct