Submission #408991

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
408991	2021-05-20T02:34:11 Z	amunduzbaev	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	197 ms	4268 KB

merchant

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

#define int long long
template<class T> bool umin(T& a, const T b) { if(a > b) { a = b; return 1; } return 0; }
template<class T> bool umax(T& a, const T b) { if(a < b) { a = b; return 1; } return 0; }
const int N = 105;
const int mod = 1e9+7;
const long long inf = 1e18+7;
int n, m, k, a[N][N];
int gg[N][N], b[N][1005], s[N][1005], prof[N][N];

bool check(int m){
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) a[i][j] = -inf;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(gg[i][j] == inf) continue;
			umax(a[i][j], prof[i][j] - gg[i][j] * m);
		}
	}
	for(int k=1;k<=n;k++){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				umax(a[i][j], a[i][k] + a[k][j]);
			}
		}
	} for(int i=1;i<=n;i++) if(a[i][i] >= 0) return 1;
	return 0;
}

/*

4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1

*/

signed main(){
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) gg[i][j] = inf;
	for(int i=1;i<=n;i++){
		for(int j=0;j<k;j++){
			cin>>b[i][j]>>s[i][j];
		}
	} for(int i=0;i<m;i++){
		int a, b, c; cin>>a>>b>>c;
		umin(gg[a][b], c);
	} for(int k=1;k<=n;k++){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				umin(gg[i][j], gg[i][k] + gg[k][j]);
			}
		}
	} for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			for(int l=0;l<k;l++){
				if(~b[i][l] && ~s[j][l]) umax(prof[i][j], - b[i][l] + s[j][l]);
			}
		}
	}
	
	int l = 0, r = mod;
	while(l < r){
		int m = (l + r + 1)>>1;
		if(check(m)) l = m;
		else r = m - 1;
	} cout<<l<<"\n";
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	126 ms	3268 KB	Output is correct
2	Correct	52 ms	1228 KB	Output is correct
3	Correct	51 ms	1228 KB	Output is correct
4	Correct	8 ms	716 KB	Output is correct
5	Correct	8 ms	688 KB	Output is correct
6	Correct	8 ms	792 KB	Output is correct
7	Correct	10 ms	816 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	8 ms	716 KB	Output is correct
10	Correct	9 ms	716 KB	Output is correct
11	Correct	8 ms	716 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	9 ms	824 KB	Output is correct

Subtask #2

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	792 KB	Output is correct
2	Correct	10 ms	816 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	8 ms	716 KB	Output is correct
5	Correct	9 ms	716 KB	Output is correct
6	Correct	8 ms	716 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	9 ms	824 KB	Output is correct
9	Correct	9 ms	848 KB	Output is correct
10	Correct	8 ms	716 KB	Output is correct
11	Correct	9 ms	844 KB	Output is correct
12	Correct	8 ms	852 KB	Output is correct
13	Correct	15 ms	900 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	8 ms	716 KB	Output is correct
16	Correct	9 ms	844 KB	Output is correct
17	Correct	9 ms	716 KB	Output is correct
18	Correct	9 ms	848 KB	Output is correct
19	Correct	12 ms	844 KB	Output is correct
20	Correct	11 ms	844 KB	Output is correct
21	Correct	9 ms	716 KB	Output is correct
22	Correct	10 ms	844 KB	Output is correct
23	Correct	13 ms	824 KB	Output is correct
24	Correct	8 ms	716 KB	Output is correct
25	Correct	17 ms	880 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	17 ms	844 KB	Output is correct
28	Correct	13 ms	844 KB	Output is correct
29	Correct	12 ms	812 KB	Output is correct
30	Correct	9 ms	844 KB	Output is correct
31	Correct	9 ms	716 KB	Output is correct

Subtask #3

33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	880 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	17 ms	844 KB	Output is correct
4	Correct	13 ms	844 KB	Output is correct
5	Correct	12 ms	812 KB	Output is correct
6	Correct	9 ms	844 KB	Output is correct
7	Correct	9 ms	716 KB	Output is correct
8	Correct	106 ms	1724 KB	Output is correct
9	Correct	197 ms	3868 KB	Output is correct
10	Correct	91 ms	1484 KB	Output is correct
11	Correct	114 ms	1696 KB	Output is correct
12	Correct	113 ms	1612 KB	Output is correct
13	Correct	67 ms	1484 KB	Output is correct

Subtask #4

34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	848 KB	Output is correct
2	Correct	8 ms	716 KB	Output is correct
3	Correct	9 ms	844 KB	Output is correct
4	Correct	8 ms	852 KB	Output is correct
5	Correct	15 ms	900 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	8 ms	716 KB	Output is correct
8	Correct	9 ms	844 KB	Output is correct
9	Correct	9 ms	716 KB	Output is correct
10	Correct	9 ms	848 KB	Output is correct
11	Correct	12 ms	844 KB	Output is correct
12	Correct	11 ms	844 KB	Output is correct
13	Correct	9 ms	716 KB	Output is correct
14	Correct	10 ms	844 KB	Output is correct
15	Correct	13 ms	824 KB	Output is correct
16	Correct	8 ms	716 KB	Output is correct
17	Correct	106 ms	1724 KB	Output is correct
18	Correct	197 ms	3868 KB	Output is correct
19	Correct	91 ms	1484 KB	Output is correct
20	Correct	114 ms	1696 KB	Output is correct
21	Correct	113 ms	1612 KB	Output is correct
22	Correct	67 ms	1484 KB	Output is correct
23	Correct	17 ms	880 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	17 ms	844 KB	Output is correct
26	Correct	13 ms	844 KB	Output is correct
27	Correct	12 ms	812 KB	Output is correct
28	Correct	9 ms	844 KB	Output is correct
29	Correct	9 ms	716 KB	Output is correct
30	Correct	126 ms	3268 KB	Output is correct
31	Correct	52 ms	1228 KB	Output is correct
32	Correct	51 ms	1228 KB	Output is correct
33	Correct	8 ms	716 KB	Output is correct
34	Correct	8 ms	688 KB	Output is correct
35	Correct	8 ms	792 KB	Output is correct
36	Correct	10 ms	816 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	8 ms	716 KB	Output is correct
39	Correct	9 ms	716 KB	Output is correct
40	Correct	8 ms	716 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	9 ms	824 KB	Output is correct
43	Correct	60 ms	1356 KB	Output is correct
44	Correct	60 ms	1576 KB	Output is correct
45	Correct	100 ms	2676 KB	Output is correct
46	Correct	57 ms	1436 KB	Output is correct
47	Correct	58 ms	1552 KB	Output is correct
48	Correct	58 ms	1556 KB	Output is correct
49	Correct	171 ms	4064 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	54 ms	1228 KB	Output is correct
53	Correct	59 ms	1304 KB	Output is correct
54	Correct	56 ms	1400 KB	Output is correct
55	Correct	54 ms	1340 KB	Output is correct
56	Correct	53 ms	1228 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	15 ms	924 KB	Output is correct
59	Correct	14 ms	972 KB	Output is correct
60	Correct	15 ms	912 KB	Output is correct
61	Correct	163 ms	4268 KB	Output is correct
62	Correct	163 ms	4164 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct