Submission #960301

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
960301	2024-04-10T07:47:14 Z	LCJLY	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	142 ms	4372 KB

merchant

#include <bits/stdc++.h>
using namespace std;	
 
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,int>pii;
//typedef pair<pii,pii>pi2;
typedef array<int,6>pi2;

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

void solve(){
	int n,m,k;
	cin >> n >> m >> k;
	
	int arr[n+5][k][2]; //buy sell
	for(int x=1;x<=n;x++){
		for(int y=0;y<k;y++){
			cin >> arr[x][y][0] >> arr[x][y][1];
		}
	}
	
	int adj[n+5][n+5];
	memset(adj,-1,sizeof(adj));
	for(int x=1;x<=n;x++) adj[x][x]=0;
	int temp,temp2,temp3;
	for(int x=0;x<m;x++){
		cin >> temp >> temp2 >> temp3;
		if(adj[temp][temp2]==-1)adj[temp][temp2]=temp3;
		else adj[temp][temp2]=min(adj[temp][temp2],temp3);
	}
	
	for(int i=1;i<=n;i++){
		for(int x=1;x<=n;x++){
			for(int y=1;y<=n;y++){
				if(adj[x][i]==-1||adj[i][y]==-1) continue;
				if(adj[x][y]!=-1&&adj[x][y]<=adj[x][i]+adj[i][y]) continue;
				adj[x][y]=adj[x][i]+adj[i][y];
			}
		}
	}
	
	int add[n+5][n+5];
	memset(add,0,sizeof(add));
	for(int x=1;x<=n;x++){
		for(int y=1;y<=n;y++){
			for(int i=0;i<k;i++){
				if(arr[y][i][1]==-1||arr[x][i][0]==-1) continue;
				add[x][y]=max(add[x][y],arr[y][i][1]-arr[x][i][0]);
			}
			//show3(x,x,y,y,add[x][y],add[x][y]);
		}
	}
	
	int l=1;
	int r=1e13;
	int mid;
	int best=0;
	while(l<=r){
		mid=(l+r)/2;
		int adj2[n+5][n+5];
		for(int x=1;x<=n;x++){
			for(int y=1;y<=n;y++){
				if(x==y||adj[x][y]==-1) adj2[x][y]=-1e13;
				else{
					adj2[x][y]=add[x][y]-mid*min(adj[x][y],(int)1e18/mid);
				}
			}
		}
		
		for(int i=1;i<=n;i++){
			for(int x=1;x<=n;x++){
				for(int y=1;y<=n;y++){
					if(adj2[x][y]>=adj2[x][i]+adj2[i][y]) continue;
					adj2[x][y]=adj2[x][i]+adj2[i][y];
				}
			}
		}
		
		bool amos=false;
		for(int x=1;x<=n;x++){
			if(adj2[x][x]>=0) amos=true;
		}
		
		if(amos){
			best=mid;
			l=mid+1;
		}
		else r=mid-1;
	}
	cout << best;
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	56 ms	2136 KB	Output is correct
2	Correct	42 ms	604 KB	Output is correct
3	Correct	38 ms	600 KB	Output is correct
4	Correct	6 ms	348 KB	Output is correct
5	Correct	6 ms	348 KB	Output is correct
6	Correct	6 ms	348 KB	Output is correct
7	Correct	7 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	6 ms	348 KB	Output is correct
10	Correct	7 ms	348 KB	Output is correct
11	Correct	6 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	6 ms	476 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	348 KB	Output is correct
2	Correct	7 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	6 ms	348 KB	Output is correct
5	Correct	7 ms	348 KB	Output is correct
6	Correct	6 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	6 ms	476 KB	Output is correct
9	Correct	7 ms	344 KB	Output is correct
10	Correct	6 ms	344 KB	Output is correct
11	Correct	7 ms	348 KB	Output is correct
12	Correct	6 ms	348 KB	Output is correct
13	Correct	12 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	5 ms	532 KB	Output is correct
16	Correct	6 ms	348 KB	Output is correct
17	Correct	6 ms	348 KB	Output is correct
18	Correct	6 ms	348 KB	Output is correct
19	Correct	9 ms	348 KB	Output is correct
20	Correct	7 ms	568 KB	Output is correct
21	Correct	6 ms	348 KB	Output is correct
22	Correct	8 ms	536 KB	Output is correct
23	Correct	8 ms	600 KB	Output is correct
24	Correct	6 ms	344 KB	Output is correct
25	Correct	16 ms	568 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	15 ms	564 KB	Output is correct
28	Correct	10 ms	348 KB	Output is correct
29	Correct	11 ms	348 KB	Output is correct
30	Correct	6 ms	348 KB	Output is correct
31	Correct	7 ms	528 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	568 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	15 ms	564 KB	Output is correct
4	Correct	10 ms	348 KB	Output is correct
5	Correct	11 ms	348 KB	Output is correct
6	Correct	6 ms	348 KB	Output is correct
7	Correct	7 ms	528 KB	Output is correct
8	Correct	106 ms	1112 KB	Output is correct
9	Correct	142 ms	2172 KB	Output is correct
10	Correct	86 ms	756 KB	Output is correct
11	Correct	90 ms	856 KB	Output is correct
12	Correct	109 ms	856 KB	Output is correct
13	Correct	51 ms	600 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	344 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	7 ms	348 KB	Output is correct
4	Correct	6 ms	348 KB	Output is correct
5	Correct	12 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	5 ms	532 KB	Output is correct
8	Correct	6 ms	348 KB	Output is correct
9	Correct	6 ms	348 KB	Output is correct
10	Correct	6 ms	348 KB	Output is correct
11	Correct	9 ms	348 KB	Output is correct
12	Correct	7 ms	568 KB	Output is correct
13	Correct	6 ms	348 KB	Output is correct
14	Correct	8 ms	536 KB	Output is correct
15	Correct	8 ms	600 KB	Output is correct
16	Correct	6 ms	344 KB	Output is correct
17	Correct	106 ms	1112 KB	Output is correct
18	Correct	142 ms	2172 KB	Output is correct
19	Correct	86 ms	756 KB	Output is correct
20	Correct	90 ms	856 KB	Output is correct
21	Correct	109 ms	856 KB	Output is correct
22	Correct	51 ms	600 KB	Output is correct
23	Correct	16 ms	568 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	15 ms	564 KB	Output is correct
26	Correct	10 ms	348 KB	Output is correct
27	Correct	11 ms	348 KB	Output is correct
28	Correct	6 ms	348 KB	Output is correct
29	Correct	7 ms	528 KB	Output is correct
30	Correct	56 ms	2136 KB	Output is correct
31	Correct	42 ms	604 KB	Output is correct
32	Correct	38 ms	600 KB	Output is correct
33	Correct	6 ms	348 KB	Output is correct
34	Correct	6 ms	348 KB	Output is correct
35	Correct	6 ms	348 KB	Output is correct
36	Correct	7 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	6 ms	348 KB	Output is correct
39	Correct	7 ms	348 KB	Output is correct
40	Correct	6 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	6 ms	476 KB	Output is correct
43	Correct	47 ms	856 KB	Output is correct
44	Correct	42 ms	860 KB	Output is correct
45	Correct	72 ms	2492 KB	Output is correct
46	Correct	39 ms	936 KB	Output is correct
47	Correct	42 ms	860 KB	Output is correct
48	Correct	39 ms	860 KB	Output is correct
49	Correct	92 ms	4256 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	41 ms	604 KB	Output is correct
53	Correct	39 ms	832 KB	Output is correct
54	Correct	42 ms	600 KB	Output is correct
55	Correct	41 ms	760 KB	Output is correct
56	Correct	38 ms	604 KB	Output is correct
57	Correct	1 ms	344 KB	Output is correct
58	Correct	8 ms	604 KB	Output is correct
59	Correct	8 ms	604 KB	Output is correct
60	Correct	7 ms	604 KB	Output is correct
61	Correct	95 ms	4372 KB	Output is correct
62	Correct	81 ms	4176 KB	Output is correct
63	Correct	1 ms	344 KB	Output is correct

Submission #960301

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