oj.uz

Submission #104741

# Submission time Handle Problem Language Result Execution time Memory
104741 2019-04-09T03:58:01 Z puyu_liao Travelling Merchant (APIO17_merchant) C++14
54 / 100
 195 ms 2340 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 = 1e14;
const double eps = 1e-6;

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

bool chk(double mm){
	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]);
	}
	for(int i=1;i<=n;i++) if(dp[i][i] < 0) return true;
	return false;
}

int32_t main()
{
	IOS;
	int 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=eps,r = INF;
	for(int cnt=0;cnt<120;cnt++){
		double mm = (l+r)*0.5;
		if(chk(mm)) l = mm;
		else r = mm;
	}
	int ll = (floor(l));
	while(chk(ll+1-eps)) ll++;
	cout << ll << '\n';
  return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 2144 KB Output is correct
2 Incorrect 139 ms 1444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 944 KB Output is correct
2 Correct 21 ms 896 KB Output is correct
3 Correct 18 ms 896 KB Output is correct
4 Correct 17 ms 896 KB Output is correct
5 Correct 22 ms 1024 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 19 ms 1024 KB Output is correct
8 Correct 21 ms 964 KB Output is correct
9 Correct 19 ms 896 KB Output is correct
10 Correct 23 ms 984 KB Output is correct
11 Correct 22 ms 896 KB Output is correct
12 Correct 19 ms 968 KB Output is correct
13 Correct 26 ms 896 KB Output is correct
14 Correct 23 ms 940 KB Output is correct
15 Correct 27 ms 968 KB Output is correct
16 Correct 23 ms 932 KB Output is correct
17 Correct 25 ms 896 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 19 ms 896 KB Output is correct
20 Correct 18 ms 896 KB Output is correct
21 Correct 19 ms 1024 KB Output is correct
22 Correct 18 ms 896 KB Output is correct
23 Correct 18 ms 896 KB Output is correct
24 Correct 18 ms 896 KB Output is correct
25 Correct 20 ms 896 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 20 ms 896 KB Output is correct
28 Correct 20 ms 896 KB Output is correct
29 Correct 20 ms 896 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 20 ms 896 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 1616 KB Output is correct
2 Correct 178 ms 2340 KB Output is correct
3 Correct 126 ms 1408 KB Output is correct
4 Correct 121 ms 1608 KB Output is correct
5 Correct 120 ms 1612 KB Output is correct
6 Correct 186 ms 1536 KB Output is correct
7 Correct 25 ms 896 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 19 ms 896 KB Output is correct
10 Correct 18 ms 896 KB Output is correct
11 Correct 19 ms 1024 KB Output is correct
12 Correct 18 ms 896 KB Output is correct
13 Correct 18 ms 896 KB Output is correct

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 944 KB Output is correct
2 Correct 21 ms 896 KB Output is correct
3 Correct 18 ms 896 KB Output is correct
4 Correct 17 ms 896 KB Output is correct
5 Correct 22 ms 1024 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 19 ms 1024 KB Output is correct
8 Correct 21 ms 964 KB Output is correct
9 Correct 19 ms 896 KB Output is correct
10 Correct 23 ms 984 KB Output is correct
11 Correct 22 ms 896 KB Output is correct
12 Correct 19 ms 968 KB Output is correct
13 Correct 26 ms 896 KB Output is correct
14 Correct 23 ms 940 KB Output is correct
15 Correct 27 ms 968 KB Output is correct
16 Correct 23 ms 932 KB Output is correct
17 Correct 120 ms 1616 KB Output is correct
18 Correct 178 ms 2340 KB Output is correct
19 Correct 126 ms 1408 KB Output is correct
20 Correct 121 ms 1608 KB Output is correct
21 Correct 120 ms 1612 KB Output is correct
22 Correct 186 ms 1536 KB Output is correct
23 Correct 25 ms 896 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 19 ms 896 KB Output is correct
26 Correct 18 ms 896 KB Output is correct
27 Correct 19 ms 1024 KB Output is correct
28 Correct 18 ms 896 KB Output is correct
29 Correct 18 ms 896 KB Output is correct
30 Correct 120 ms 1508 KB Output is correct
31 Correct 146 ms 1656 KB Output is correct
32 Correct 152 ms 2296 KB Output is correct
33 Correct 132 ms 1576 KB Output is correct
34 Correct 127 ms 1536 KB Output is correct
35 Correct 132 ms 1628 KB Output is correct
36 Correct 195 ms 2216 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 3 ms 384 KB Output is correct
39 Correct 124 ms 1472 KB Output is correct
40 Correct 137 ms 1464 KB Output is correct
41 Correct 140 ms 1536 KB Output is correct
42 Correct 115 ms 1408 KB Output is correct
43 Correct 113 ms 1408 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 21 ms 1016 KB Output is correct
46 Correct 19 ms 1024 KB Output is correct
47 Correct 22 ms 896 KB Output is correct
48 Correct 169 ms 2224 KB Output is correct
49 Correct 187 ms 2168 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 146 ms 2144 KB Output is correct
52 Incorrect 139 ms 1444 KB Output isn't correct
53 Halted 0 ms 0 KB -