답안 #132207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
132207	2019-07-18T13:15:46 Z	baluteshih	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	102 ms	4344 KB

merchant

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define ALL(v) v.begin(),v.end()
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const ll INF=2e9;
pll buy[105][1005];
ll dis[105][105],earn[105][105],dp[105][105];

int main()
{jizz
	ll n,m,k,a,b,w,l=0,r=1e9;
	cin >> n >> m >> k;
	for(int i=1;i<=n;++i)
		for(int j=0;j<k;++j)
			cin >> buy[i][j].F >> buy[i][j].S;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			dis[i][j]=INF;
	while(m--)
		cin >> a >> b >> w,dis[a][b]=min(w,dis[a][b]);
	for(int k=1;k<=n;++k)
		for(int i=1;i<=n;++i)
			for(int j=1;j<=n;++j)
				dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			if(i!=j)
				for(int t=0;t<k;++t)
					if(~buy[i][t].F&&~buy[j][t].S)
						earn[i][j]=max(earn[i][j],buy[j][t].S-buy[i][t].F);
	while(l<r)
	{
		ll mid=(l+r)/2+1,tmp=-INF;
		for(int i=1;i<=n;++i)
			for(int j=1;j<=n;++j)
				dp[i][j]=earn[i][j]-dis[i][j]*mid;
		for(int k=1;k<=n;++k)
			for(int i=1;i<=n;++i)
				for(int j=1;j<=n;++j)
					dp[i][j]=max(dp[i][j],dp[i][k]+dp[k][j]);
		for(int i=1;i<=n;++i)
			tmp=max(tmp,dp[i][i]);
		if(tmp>=0) l=mid;
		else r=mid-1;
	}
	cout << l << "\n";
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	71 ms	2168 KB	Output is correct
2	Correct	40 ms	1016 KB	Output is correct
3	Correct	40 ms	888 KB	Output is correct
4	Correct	7 ms	636 KB	Output is correct
5	Correct	7 ms	632 KB	Output is correct
6	Correct	7 ms	632 KB	Output is correct
7	Correct	8 ms	636 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	7 ms	632 KB	Output is correct
10	Correct	7 ms	632 KB	Output is correct
11	Correct	7 ms	632 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	8 ms	632 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	45 ms	1196 KB	Output is correct
2	Correct	95 ms	2140 KB	Output is correct
3	Correct	42 ms	1016 KB	Output is correct
4	Correct	46 ms	1144 KB	Output is correct
5	Correct	46 ms	1148 KB	Output is correct
6	Correct	41 ms	1016 KB	Output is correct
7	Correct	8 ms	632 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	8 ms	760 KB	Output is correct
10	Correct	8 ms	632 KB	Output is correct
11	Correct	8 ms	760 KB	Output is correct
12	Correct	8 ms	760 KB	Output is correct
13	Correct	7 ms	632 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	892 KB	Output is correct
2	Correct	7 ms	632 KB	Output is correct
3	Correct	8 ms	760 KB	Output is correct
4	Correct	7 ms	760 KB	Output is correct
5	Correct	8 ms	632 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	8 ms	632 KB	Output is correct
8	Correct	8 ms	764 KB	Output is correct
9	Correct	8 ms	632 KB	Output is correct
10	Correct	8 ms	632 KB	Output is correct
11	Correct	9 ms	892 KB	Output is correct
12	Correct	8 ms	760 KB	Output is correct
13	Correct	8 ms	760 KB	Output is correct
14	Correct	8 ms	632 KB	Output is correct
15	Correct	10 ms	764 KB	Output is correct
16	Correct	8 ms	632 KB	Output is correct
17	Correct	45 ms	1196 KB	Output is correct
18	Correct	95 ms	2140 KB	Output is correct
19	Correct	42 ms	1016 KB	Output is correct
20	Correct	46 ms	1144 KB	Output is correct
21	Correct	46 ms	1148 KB	Output is correct
22	Correct	41 ms	1016 KB	Output is correct
23	Correct	8 ms	632 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	8 ms	760 KB	Output is correct
26	Correct	8 ms	632 KB	Output is correct
27	Correct	8 ms	760 KB	Output is correct
28	Correct	8 ms	760 KB	Output is correct
29	Correct	7 ms	632 KB	Output is correct
30	Correct	41 ms	1020 KB	Output is correct
31	Correct	43 ms	1272 KB	Output is correct
32	Correct	63 ms	2680 KB	Output is correct
33	Correct	43 ms	1272 KB	Output is correct
34	Correct	43 ms	1272 KB	Output is correct
35	Correct	43 ms	1144 KB	Output is correct
36	Correct	102 ms	4164 KB	Output is correct
37	Correct	3 ms	376 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Correct	55 ms	1144 KB	Output is correct
40	Correct	43 ms	1152 KB	Output is correct
41	Correct	41 ms	1016 KB	Output is correct
42	Correct	41 ms	1016 KB	Output is correct
43	Correct	41 ms	888 KB	Output is correct
44	Correct	2 ms	376 KB	Output is correct
45	Correct	10 ms	888 KB	Output is correct
46	Correct	10 ms	888 KB	Output is correct
47	Correct	10 ms	888 KB	Output is correct
48	Correct	102 ms	4216 KB	Output is correct
49	Correct	101 ms	4344 KB	Output is correct
50	Correct	2 ms	376 KB	Output is correct
51	Correct	71 ms	2168 KB	Output is correct
52	Correct	40 ms	1016 KB	Output is correct
53	Correct	40 ms	888 KB	Output is correct
54	Correct	7 ms	636 KB	Output is correct
55	Correct	7 ms	632 KB	Output is correct
56	Correct	7 ms	632 KB	Output is correct
57	Correct	8 ms	636 KB	Output is correct
58	Correct	2 ms	376 KB	Output is correct
59	Correct	7 ms	632 KB	Output is correct
60	Correct	7 ms	632 KB	Output is correct
61	Correct	7 ms	632 KB	Output is correct
62	Correct	2 ms	376 KB	Output is correct
63	Correct	8 ms	632 KB	Output is correct

답안 #132207

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