Submission #732892

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
732892	2023-04-29T11:31:07 Z	1ne	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	97 ms	4256 KB

merchant

/*
*  author : Apiram                  
*  created: 29.04.2023 02:41:46
*/

#include<bits/stdc++.h>
using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n,m,k;cin>>n>>m>>k;
	vector<vector<long long>>b(n),s(n);
	for (int i = 0;i<n;++i){
		for (int j = 0;j<k;++j){
			long long x,y;cin>>x>>y;
			b[i].push_back(x);
			s[i].push_back(y);
		}
	}
	vector<vector<long long>>mxprofit(n,vector<long long>(n,0));                                         
	vector<vector<long long>>dist(n,vector<long long>(n,1e16));
	for (int i = 0;i<m;++i){
		long long x,y,cost;
		cin>>x>>y>>cost;
		--x;--y;
		dist[x][y] = min(dist[x][y],cost);	
	}
	for (int i = 0;i<n;++i){
		for (int j = 0;j<n;++j){
			for (int p = 0;p<k;++p){
				if (b[i][p] == -1 || s[j][p] == -1)continue;
				mxprofit[i][j] = max(mxprofit[i][j],(s[j][p] - b[i][p]));
			}
		}
	}
	for (int i = 0;i<n;++i){
		for (int j = 0;j<n;++j){
			for (int p = 0;p<n;++p){
				dist[j][p] = min(dist[j][p],dist[j][i] + dist[i][p]);
			}
		}
	}
	long long ans = 0;
	long long left = 0,right = 1e9;
	while(left<=right){
		long long mid = (left + right)>>1;
		//profit / time >= mid
		//profit >= mid * time
		//-profit + mid * time <= 0
		vector<vector<long long>>cost(n,vector<long long>(n,1e16));
		for (int i = 0;i<n;++i){
			for (int j = 0;j<n;++j){
				if (dist[i][j] == 1e16)continue;
				cost[i][j] = mid * dist[i][j] - mxprofit[i][j];
			}
		}
		for (int i = 0;i<n;++i){
			for (int j = 0;j<n;++j){
				for (int p = 0;p<n;++p){
					cost[j][p] = min(cost[j][i] + cost[i][p],cost[j][p]);
				}
			}
		}
		bool ok = false;
		for (int i = 0;i<n;++i){
			if (cost[i][i] <= 0){
				ok = true;
			}
		}
		if (ok){
			left = mid + 1;
			ans = mid;
		} 
		else{
			right = mid - 1;
		}
	}	
	cout<<ans<<'\n';		
	return 0;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	71 ms	2080 KB	Output is correct
2	Correct	30 ms	552 KB	Output is correct
3	Correct	32 ms	560 KB	Output is correct
4	Correct	4 ms	388 KB	Output is correct
5	Correct	5 ms	340 KB	Output is correct
6	Correct	7 ms	388 KB	Output is correct
7	Correct	5 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	5 ms	340 KB	Output is correct
10	Correct	5 ms	340 KB	Output is correct
11	Correct	7 ms	396 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	7 ms	468 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	388 KB	Output is correct
2	Correct	5 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	5 ms	340 KB	Output is correct
5	Correct	5 ms	340 KB	Output is correct
6	Correct	7 ms	396 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	7 ms	468 KB	Output is correct
9	Correct	6 ms	340 KB	Output is correct
10	Correct	5 ms	400 KB	Output is correct
11	Correct	5 ms	340 KB	Output is correct
12	Correct	5 ms	340 KB	Output is correct
13	Correct	6 ms	340 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	5 ms	340 KB	Output is correct
16	Correct	6 ms	460 KB	Output is correct
17	Correct	5 ms	320 KB	Output is correct
18	Correct	6 ms	328 KB	Output is correct
19	Correct	6 ms	468 KB	Output is correct
20	Correct	6 ms	492 KB	Output is correct
21	Correct	6 ms	332 KB	Output is correct
22	Correct	6 ms	340 KB	Output is correct
23	Correct	7 ms	468 KB	Output is correct
24	Correct	7 ms	404 KB	Output is correct
25	Correct	6 ms	340 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	7 ms	464 KB	Output is correct
28	Correct	6 ms	492 KB	Output is correct
29	Correct	6 ms	468 KB	Output is correct
30	Correct	8 ms	340 KB	Output is correct
31	Correct	8 ms	396 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	7 ms	464 KB	Output is correct
4	Correct	6 ms	492 KB	Output is correct
5	Correct	6 ms	468 KB	Output is correct
6	Correct	8 ms	340 KB	Output is correct
7	Correct	8 ms	396 KB	Output is correct
8	Correct	39 ms	752 KB	Output is correct
9	Correct	81 ms	2076 KB	Output is correct
10	Correct	33 ms	596 KB	Output is correct
11	Correct	38 ms	696 KB	Output is correct
12	Correct	36 ms	700 KB	Output is correct
13	Correct	40 ms	652 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	340 KB	Output is correct
2	Correct	5 ms	400 KB	Output is correct
3	Correct	5 ms	340 KB	Output is correct
4	Correct	5 ms	340 KB	Output is correct
5	Correct	6 ms	340 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	5 ms	340 KB	Output is correct
8	Correct	6 ms	460 KB	Output is correct
9	Correct	5 ms	320 KB	Output is correct
10	Correct	6 ms	328 KB	Output is correct
11	Correct	6 ms	468 KB	Output is correct
12	Correct	6 ms	492 KB	Output is correct
13	Correct	6 ms	332 KB	Output is correct
14	Correct	6 ms	340 KB	Output is correct
15	Correct	7 ms	468 KB	Output is correct
16	Correct	7 ms	404 KB	Output is correct
17	Correct	39 ms	752 KB	Output is correct
18	Correct	81 ms	2076 KB	Output is correct
19	Correct	33 ms	596 KB	Output is correct
20	Correct	38 ms	696 KB	Output is correct
21	Correct	36 ms	700 KB	Output is correct
22	Correct	40 ms	652 KB	Output is correct
23	Correct	6 ms	340 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	7 ms	464 KB	Output is correct
26	Correct	6 ms	492 KB	Output is correct
27	Correct	6 ms	468 KB	Output is correct
28	Correct	8 ms	340 KB	Output is correct
29	Correct	8 ms	396 KB	Output is correct
30	Correct	71 ms	2080 KB	Output is correct
31	Correct	30 ms	552 KB	Output is correct
32	Correct	32 ms	560 KB	Output is correct
33	Correct	4 ms	388 KB	Output is correct
34	Correct	5 ms	340 KB	Output is correct
35	Correct	7 ms	388 KB	Output is correct
36	Correct	5 ms	340 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	5 ms	340 KB	Output is correct
39	Correct	5 ms	340 KB	Output is correct
40	Correct	7 ms	396 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	7 ms	468 KB	Output is correct
43	Correct	31 ms	596 KB	Output is correct
44	Correct	33 ms	724 KB	Output is correct
45	Correct	50 ms	2636 KB	Output is correct
46	Correct	38 ms	820 KB	Output is correct
47	Correct	33 ms	724 KB	Output is correct
48	Correct	38 ms	852 KB	Output is correct
49	Correct	93 ms	4044 KB	Output is correct
50	Correct	0 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	30 ms	612 KB	Output is correct
53	Correct	34 ms	716 KB	Output is correct
54	Correct	32 ms	696 KB	Output is correct
55	Correct	39 ms	632 KB	Output is correct
56	Correct	35 ms	724 KB	Output is correct
57	Correct	1 ms	212 KB	Output is correct
58	Correct	7 ms	596 KB	Output is correct
59	Correct	7 ms	468 KB	Output is correct
60	Correct	6 ms	588 KB	Output is correct
61	Correct	88 ms	4236 KB	Output is correct
62	Correct	97 ms	4256 KB	Output is correct
63	Correct	1 ms	212 KB	Output is correct

Submission #732892

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