oj.uz

Submission #543279

# Submission time Handle Problem Language Result Execution time Memory
543279 2022-03-30T03:26:37 Z amunduzbaev Travelling Merchant (APIO17_merchant) C++17
100 / 100
 87 ms 4112 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
#define int long long
const long long inf = 1e18;
const int N = 105;
int d[N][N], s[N][N];
int tr[N][1005][2];
int t[N][N];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m, k; cin>>n>>m>>k;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) d[i][j] = inf;
	for(int i=1;i<=n;i++){
		for(int j=0;j<k;j++){
			cin>>tr[i][j][0]>>tr[i][j][1];
		}
	}
	
	for(int i=0;i<m;i++){
		int a, b, c; cin>>a>>b>>c;
		d[a][b] = min(d[a][b], c);
	}
	
	for(int k=1;k<=n;k++){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
			}
		}
	}
	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			for(int l=0;l<k;l++){
				if(~tr[i][l][0] && ~tr[j][l][1]){
					s[i][j] = max(s[i][j], tr[j][l][1] - tr[i][l][0]);
				}
			}
		}
	}
	
	auto check = [&](int f){
		for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) t[i][j] = -inf;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				if(i == j || d[i][j] == inf) continue;
				t[i][j] = max(t[i][j], s[i][j] - d[i][j] * f);
			}
		}
		for(int k=1;k<=n;k++){
			for(int i=1;i<=n;i++){
				for(int j=1;j<=n;j++){
					t[i][j] = max(t[i][j], t[i][k] + t[k][j]);
				}
			}
		}
		
		//~ for(int i=1;i<=n;i++){
			//~ for(int j=1;j<=n;j++){
				//~ cout<<t[i][j]<<" ";
			//~ } cout<<"\n";
		//~ } cout<<"\n";
		
		for(int i=1;i<=n;i++){
			if(t[i][i] >= 0) return true;
		} return false;
	};
	
	int l = 0, r = 1e9;
	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 53 ms 2144 KB Output is correct
2 Correct 32 ms 852 KB Output is correct
3 Correct 34 ms 844 KB Output is correct
4 Correct 5 ms 580 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 5 ms 592 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 5 ms 580 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 6 ms 596 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 596 KB Output is correct
2 Correct 5 ms 592 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 5 ms 580 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 5 ms 596 KB Output is correct
13 Correct 6 ms 716 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 5 ms 596 KB Output is correct
16 Correct 6 ms 596 KB Output is correct
17 Correct 5 ms 596 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 8 ms 692 KB Output is correct
20 Correct 6 ms 692 KB Output is correct
21 Correct 6 ms 660 KB Output is correct
22 Correct 5 ms 676 KB Output is correct
23 Correct 6 ms 688 KB Output is correct
24 Correct 5 ms 596 KB Output is correct
25 Correct 6 ms 596 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 6 ms 716 KB Output is correct
28 Correct 6 ms 724 KB Output is correct
29 Correct 6 ms 600 KB Output is correct
30 Correct 5 ms 596 KB Output is correct
31 Correct 5 ms 596 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 596 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 6 ms 716 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 5 ms 596 KB Output is correct
8 Correct 38 ms 1108 KB Output is correct
9 Correct 78 ms 2208 KB Output is correct
10 Correct 34 ms 1080 KB Output is correct
11 Correct 38 ms 1200 KB Output is correct
12 Correct 38 ms 1196 KB Output is correct
13 Correct 35 ms 1068 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 596 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 6 ms 596 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 5 ms 596 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 8 ms 692 KB Output is correct
12 Correct 6 ms 692 KB Output is correct
13 Correct 6 ms 660 KB Output is correct
14 Correct 5 ms 676 KB Output is correct
15 Correct 6 ms 688 KB Output is correct
16 Correct 5 ms 596 KB Output is correct
17 Correct 38 ms 1108 KB Output is correct
18 Correct 78 ms 2208 KB Output is correct
19 Correct 34 ms 1080 KB Output is correct
20 Correct 38 ms 1200 KB Output is correct
21 Correct 38 ms 1196 KB Output is correct
22 Correct 35 ms 1068 KB Output is correct
23 Correct 6 ms 596 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 6 ms 716 KB Output is correct
26 Correct 6 ms 724 KB Output is correct
27 Correct 6 ms 600 KB Output is correct
28 Correct 5 ms 596 KB Output is correct
29 Correct 5 ms 596 KB Output is correct
30 Correct 53 ms 2144 KB Output is correct
31 Correct 32 ms 852 KB Output is correct
32 Correct 34 ms 844 KB Output is correct
33 Correct 5 ms 580 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 596 KB Output is correct
36 Correct 5 ms 592 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 596 KB Output is correct
39 Correct 5 ms 596 KB Output is correct
40 Correct 5 ms 580 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 6 ms 596 KB Output is correct
43 Correct 34 ms 980 KB Output is correct
44 Correct 34 ms 1108 KB Output is correct
45 Correct 50 ms 2636 KB Output is correct
46 Correct 34 ms 1244 KB Output is correct
47 Correct 35 ms 1196 KB Output is correct
48 Correct 40 ms 1196 KB Output is correct
49 Correct 84 ms 4076 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 33 ms 980 KB Output is correct
53 Correct 34 ms 980 KB Output is correct
54 Correct 35 ms 1068 KB Output is correct
55 Correct 35 ms 980 KB Output is correct
56 Correct 32 ms 940 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 6 ms 724 KB Output is correct
59 Correct 7 ms 724 KB Output is correct
60 Correct 7 ms 724 KB Output is correct
61 Correct 84 ms 4092 KB Output is correct
62 Correct 87 ms 4112 KB Output is correct
63 Correct 1 ms 340 KB Output is correct