oj.uz

Submission #104731

# Submission time Handle Problem Language Result Execution time Memory
104731 2019-04-09T03:25:10 Z puyu_liao Travelling Merchant (APIO17_merchant) C++14
33 / 100
 189 ms 2172 KB 
#include<bits/stdc++.h>
#include<stdint.h>
using namespace std;
#define IOS {cin.tie(0);ios_base::sync_with_stdio(false);}
#define int int64_t
#define N 105
#define K 1005
const int INF = 1e17;
const double eps = 1e-1;

int bb[N][K],ss[N][K];
int w[N][N],dis[N][N];
double dp[N][N];

int32_t main()
{
	IOS;
	int n,m,k,a,b,t;
	cin >> n >> m >> k;
	for(int i=1;i<=n;i++) for(int j=1;j<=k;j++) cin >> bb[i][j] >> ss[i][j];
	
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) dis[i][j] = INF;
	for(int i=1;i<=n;i++) dis[i][i] = 0;
	for(int i=0;i<m;i++){
		cin >> a >> b >> t;
		dis[a][b] = t; 
	}
	for(int x=1;x<=n;x++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) 
			dis[i][j] = min(dis[i][j],dis[i][x] + dis[x][j]);

	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++){
		if(j != i && dis[i][j] != INF) {
			for(int x=1;x<=k;x++) if(ss[j][x] >= 0 && bb[i][x] >= 0) w[i][j] = max(w[i][j],ss[j][x] - bb[i][x]);
		}
		else w[i][j] = 0;
	}

	double l=0,r = 1e14;
	for(int cnt=0;cnt<120;cnt++){
		double mm = (l+r)*0.5;
		for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) {
			dp[i][j] = mm*dis[i][j] - w[i][j];
		}
		for(int x=1;x<=n;x++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) {
			dp[i][j] = min(dp[i][j],dp[i][x] + dp[x][j]);
		}
		bool gg = false;
		for(int i=1;i<=n;i++) if(dp[i][i] < 0) gg = true;
		if(gg) l = mm;
		else r = mm;
	}
	cout << (int)(floor(l+eps)+0.5) << '\n';
  return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 2168 KB Output is correct
2 Incorrect 116 ms 1408 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 916 KB Output is correct
2 Correct 26 ms 896 KB Output is correct
3 Correct 23 ms 896 KB Output is correct
4 Correct 20 ms 896 KB Output is correct
5 Correct 22 ms 976 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 21 ms 896 KB Output is correct
8 Correct 19 ms 896 KB Output is correct
9 Correct 27 ms 896 KB Output is correct
10 Correct 19 ms 896 KB Output is correct
11 Correct 24 ms 996 KB Output is correct
12 Correct 19 ms 896 KB Output is correct
13 Correct 21 ms 1024 KB Output is correct
14 Correct 20 ms 1016 KB Output is correct
15 Correct 30 ms 896 KB Output is correct
16 Correct 18 ms 896 KB Output is correct
17 Correct 28 ms 896 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 24 ms 896 KB Output is correct
20 Correct 21 ms 896 KB Output is correct
21 Correct 22 ms 896 KB Output is correct
22 Correct 21 ms 896 KB Output is correct
23 Correct 20 ms 896 KB Output is correct
24 Correct 21 ms 896 KB Output is correct
25 Correct 19 ms 896 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Incorrect 20 ms 896 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 1608 KB Output is correct
2 Correct 189 ms 2172 KB Output is correct
3 Correct 151 ms 1408 KB Output is correct
4 Correct 153 ms 1656 KB Output is correct
5 Correct 146 ms 1644 KB Output is correct
6 Correct 135 ms 1536 KB Output is correct
7 Correct 28 ms 896 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 24 ms 896 KB Output is correct
10 Correct 21 ms 896 KB Output is correct
11 Correct 22 ms 896 KB Output is correct
12 Correct 21 ms 896 KB Output is correct
13 Correct 20 ms 896 KB Output is correct

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 916 KB Output is correct
2 Correct 26 ms 896 KB Output is correct
3 Correct 23 ms 896 KB Output is correct
4 Correct 20 ms 896 KB Output is correct
5 Correct 22 ms 976 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 21 ms 896 KB Output is correct
8 Correct 19 ms 896 KB Output is correct
9 Correct 27 ms 896 KB Output is correct
10 Correct 19 ms 896 KB Output is correct
11 Correct 24 ms 996 KB Output is correct
12 Correct 19 ms 896 KB Output is correct
13 Correct 21 ms 1024 KB Output is correct
14 Correct 20 ms 1016 KB Output is correct
15 Correct 30 ms 896 KB Output is correct
16 Correct 18 ms 896 KB Output is correct
17 Correct 143 ms 1608 KB Output is correct
18 Correct 189 ms 2172 KB Output is correct
19 Correct 151 ms 1408 KB Output is correct
20 Correct 153 ms 1656 KB Output is correct
21 Correct 146 ms 1644 KB Output is correct
22 Correct 135 ms 1536 KB Output is correct
23 Correct 28 ms 896 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 24 ms 896 KB Output is correct
26 Correct 21 ms 896 KB Output is correct
27 Correct 22 ms 896 KB Output is correct
28 Correct 21 ms 896 KB Output is correct
29 Correct 20 ms 896 KB Output is correct
30 Incorrect 129 ms 1528 KB Output isn't correct
31 Halted 0 ms 0 KB -