답안 #104746

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104746	2019-04-09T04:10:14 Z	puyu_liao	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	123 ms	2304 KB

merchant

#include<bits/stdc++.h>
#include<stdint.h>
using namespace std;
#define IOS {cin.tie(0);ios_base::sync_with_stdio(false);}
#define int int64_t
#define __int128 int64_t
#define N 105
#define K 1005
const int INF = 1e9+7;

int bb[N][K],ss[N][K];
int w[N][N],dis[N][N];
__int128 dp[N][N];

int32_t main()
{
	IOS;
	int n,m,k,a,b,t;
	cin >> n >> m >> k;
	for(int i=1;i<=n;i++) for(int j=1;j<=k;j++) cin >> bb[i][j] >> ss[i][j];
	
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) dis[i][j] = INF;
	//for(int i=1;i<=n;i++) dis[i][i] = 0; evil!!!!!!!!!!!!!!!!!!
	for(int i=0;i<m;i++){
		cin >> a >> b >> t;
		dis[a][b] = t; 
	}
	for(int x=1;x<=n;x++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) 
			dis[i][j] = min(dis[i][j],dis[i][x] + dis[x][j]);

	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++){
		if(j != i && dis[i][j] != INF) {
			for(int x=1;x<=k;x++) if(ss[j][x] >= 0 && bb[i][x] >= 0) w[i][j] = max(w[i][j],ss[j][x] - bb[i][x]);
		}
		else w[i][j] = 0;
	}

	int l=0,r = INF;
	while(l!=r){
		int mm = (l+r+1) >> 1;
		for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) {
			dp[i][j] = (__int128)mm*dis[i][j] - w[i][j];
		}
		for(int x=1;x<=n;x++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) {
			dp[i][j] = min(dp[i][j],dp[i][x] + dp[x][j]);
		}
		bool gg = false;	
		for(int i=1;i<=n;i++) 
			if(dp[i][i] <= 0) gg = true;
		if(gg) l = mm;
		else r = mm-1;
	}
	cout << l << '\n';
  return 0;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	67 ms	2304 KB	Output is correct
2	Correct	42 ms	1408 KB	Output is correct
3	Correct	47 ms	1500 KB	Output is correct
4	Correct	8 ms	896 KB	Output is correct
5	Correct	9 ms	896 KB	Output is correct
6	Correct	9 ms	896 KB	Output is correct
7	Correct	8 ms	896 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	8 ms	896 KB	Output is correct
10	Correct	8 ms	896 KB	Output is correct
11	Correct	10 ms	896 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	8 ms	896 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	52 ms	1648 KB	Output is correct
2	Correct	90 ms	2280 KB	Output is correct
3	Correct	55 ms	1536 KB	Output is correct
4	Correct	50 ms	1536 KB	Output is correct
5	Correct	48 ms	1536 KB	Output is correct
6	Correct	51 ms	1408 KB	Output is correct
7	Correct	9 ms	896 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	10 ms	1024 KB	Output is correct
10	Correct	9 ms	896 KB	Output is correct
11	Correct	9 ms	896 KB	Output is correct
12	Correct	12 ms	896 KB	Output is correct
13	Correct	9 ms	896 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	896 KB	Output is correct
2	Correct	11 ms	896 KB	Output is correct
3	Correct	9 ms	896 KB	Output is correct
4	Correct	8 ms	896 KB	Output is correct
5	Correct	9 ms	896 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	8 ms	896 KB	Output is correct
8	Correct	8 ms	896 KB	Output is correct
9	Correct	8 ms	896 KB	Output is correct
10	Correct	9 ms	896 KB	Output is correct
11	Correct	8 ms	896 KB	Output is correct
12	Correct	8 ms	896 KB	Output is correct
13	Correct	9 ms	896 KB	Output is correct
14	Correct	10 ms	896 KB	Output is correct
15	Correct	9 ms	896 KB	Output is correct
16	Correct	8 ms	896 KB	Output is correct
17	Correct	52 ms	1648 KB	Output is correct
18	Correct	90 ms	2280 KB	Output is correct
19	Correct	55 ms	1536 KB	Output is correct
20	Correct	50 ms	1536 KB	Output is correct
21	Correct	48 ms	1536 KB	Output is correct
22	Correct	51 ms	1408 KB	Output is correct
23	Correct	9 ms	896 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	10 ms	1024 KB	Output is correct
26	Correct	9 ms	896 KB	Output is correct
27	Correct	9 ms	896 KB	Output is correct
28	Correct	12 ms	896 KB	Output is correct
29	Correct	9 ms	896 KB	Output is correct
30	Correct	41 ms	1480 KB	Output is correct
31	Correct	57 ms	1628 KB	Output is correct
32	Correct	63 ms	2176 KB	Output is correct
33	Correct	44 ms	1536 KB	Output is correct
34	Correct	40 ms	1664 KB	Output is correct
35	Correct	42 ms	1536 KB	Output is correct
36	Correct	102 ms	2168 KB	Output is correct
37	Correct	3 ms	512 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	45 ms	1408 KB	Output is correct
40	Correct	44 ms	1408 KB	Output is correct
41	Correct	42 ms	1536 KB	Output is correct
42	Correct	42 ms	1408 KB	Output is correct
43	Correct	57 ms	1408 KB	Output is correct
44	Correct	3 ms	384 KB	Output is correct
45	Correct	10 ms	896 KB	Output is correct
46	Correct	10 ms	1024 KB	Output is correct
47	Correct	11 ms	1024 KB	Output is correct
48	Correct	123 ms	2296 KB	Output is correct
49	Correct	102 ms	2172 KB	Output is correct
50	Correct	2 ms	384 KB	Output is correct
51	Correct	67 ms	2304 KB	Output is correct
52	Correct	42 ms	1408 KB	Output is correct
53	Correct	47 ms	1500 KB	Output is correct
54	Correct	8 ms	896 KB	Output is correct
55	Correct	9 ms	896 KB	Output is correct
56	Correct	9 ms	896 KB	Output is correct
57	Correct	8 ms	896 KB	Output is correct
58	Correct	2 ms	384 KB	Output is correct
59	Correct	8 ms	896 KB	Output is correct
60	Correct	8 ms	896 KB	Output is correct
61	Correct	10 ms	896 KB	Output is correct
62	Correct	3 ms	384 KB	Output is correct
63	Correct	8 ms	896 KB	Output is correct

답안 #104746

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0