oj.uz

Submission #263139

# Submission time Handle Problem Language Result Execution time Memory
263139 2020-08-13T13:30:23 Z Saboon Travelling Merchant (APIO17_merchant) C++14
100 / 100
 375 ms 4472 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 105;
const int maxk = 1005;
const int maxm = 10005;
const ld eps = 0.0000001;
const ll inf = (ll)1e19;
ll b[maxn][maxk],s[maxn][maxk];
int n,m;
pair<pair<int,int>,ll> e[maxm], E[maxn*maxn];
ll dp[maxn][maxn];
ll c[maxn][maxn];
ld sp[maxn][maxn];
 
bool check(ll x){
	memset(dp, 63, sizeof dp);
	for (int i = 1; i <= n; i++)
		dp[i][i] = 0;
	for (int i = 1; i <= m; i++){
		int v = e[i].first.first, u = e[i].first.second;
		ll w = e[i].second;
		dp[v][u] = x*w;
	}
	for (int k = 1; k <= n; k++)
		for (int v = 1; v <= n; v++)
			for (int u = 1; u <= n; u++)
				dp[v][u] = min(dp[v][u], dp[v][k] + dp[k][u]);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (i != j)
			    sp[i][j] = dp[i][j] - c[i][j] - eps;
	for(int i = 1; i <= n; i++)
	    sp[i][i] = 0;
	for(int k = 1; k <= n; k++)
	    for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				sp[i][j] = min(sp[i][j], sp[i][k] + sp[k][j]);
	for (int i = 1; i <= n; i++)
		if (sp[i][i] < 0)
			return true;
	return false;		
}
 
int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int k;
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= k; j++)
			cin >> b[i][j] >> s[i][j];
	for (int i = 1; i <= m; i++){
		int v, u, w;
		cin >> v >> u >> w;
		e[i] = {{v, u}, w};
	}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			for (int x = 1; x <= k; x++)
				if (b[i][x] != -1 and s[j][x] != -1)
					c[i][j] = max(c[i][j], s[j][x] - b[i][x]);
	ll lo = 0, hi = 1000 * 1000 * 1000 + 1;
	while (hi - lo > 1){
		ll mid = (lo + hi) >> 1;
		if (check(mid))
			lo = mid;
		else
			hi = mid;
	}
	cout << lo << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 2296 KB Output is correct
2 Correct 263 ms 1408 KB Output is correct
3 Correct 279 ms 1528 KB Output is correct
4 Correct 36 ms 896 KB Output is correct
5 Correct 35 ms 896 KB Output is correct
6 Correct 34 ms 896 KB Output is correct
7 Correct 38 ms 1024 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 36 ms 964 KB Output is correct
10 Correct 36 ms 896 KB Output is correct
11 Correct 36 ms 896 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 36 ms 1024 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1144 KB Output is correct
2 Correct 43 ms 928 KB Output is correct
3 Correct 37 ms 1052 KB Output is correct
4 Correct 33 ms 1024 KB Output is correct
5 Correct 42 ms 1024 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 36 ms 896 KB Output is correct
8 Correct 35 ms 1024 KB Output is correct
9 Correct 41 ms 1024 KB Output is correct
10 Correct 39 ms 1024 KB Output is correct
11 Correct 37 ms 1024 KB Output is correct
12 Correct 37 ms 1024 KB Output is correct
13 Correct 39 ms 1024 KB Output is correct
14 Correct 36 ms 1024 KB Output is correct
15 Correct 37 ms 1152 KB Output is correct
16 Correct 36 ms 896 KB Output is correct
17 Correct 36 ms 1024 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 38 ms 1024 KB Output is correct
20 Correct 39 ms 1024 KB Output is correct
21 Correct 37 ms 1024 KB Output is correct
22 Correct 38 ms 1152 KB Output is correct
23 Correct 36 ms 896 KB Output is correct
24 Correct 34 ms 896 KB Output is correct
25 Correct 38 ms 1024 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 36 ms 964 KB Output is correct
28 Correct 36 ms 896 KB Output is correct
29 Correct 36 ms 896 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 36 ms 1024 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 1784 KB Output is correct
2 Correct 330 ms 2296 KB Output is correct
3 Correct 279 ms 1536 KB Output is correct
4 Correct 280 ms 1912 KB Output is correct
5 Correct 281 ms 1912 KB Output is correct
6 Correct 274 ms 1784 KB Output is correct
7 Correct 36 ms 1024 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 38 ms 1024 KB Output is correct
10 Correct 39 ms 1024 KB Output is correct
11 Correct 37 ms 1024 KB Output is correct
12 Correct 38 ms 1152 KB Output is correct
13 Correct 36 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1144 KB Output is correct
2 Correct 43 ms 928 KB Output is correct
3 Correct 37 ms 1052 KB Output is correct
4 Correct 33 ms 1024 KB Output is correct
5 Correct 42 ms 1024 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 36 ms 896 KB Output is correct
8 Correct 35 ms 1024 KB Output is correct
9 Correct 41 ms 1024 KB Output is correct
10 Correct 39 ms 1024 KB Output is correct
11 Correct 37 ms 1024 KB Output is correct
12 Correct 37 ms 1024 KB Output is correct
13 Correct 39 ms 1024 KB Output is correct
14 Correct 36 ms 1024 KB Output is correct
15 Correct 37 ms 1152 KB Output is correct
16 Correct 36 ms 896 KB Output is correct
17 Correct 283 ms 1784 KB Output is correct
18 Correct 330 ms 2296 KB Output is correct
19 Correct 279 ms 1536 KB Output is correct
20 Correct 280 ms 1912 KB Output is correct
21 Correct 281 ms 1912 KB Output is correct
22 Correct 274 ms 1784 KB Output is correct
23 Correct 36 ms 1024 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 38 ms 1024 KB Output is correct
26 Correct 39 ms 1024 KB Output is correct
27 Correct 37 ms 1024 KB Output is correct
28 Correct 38 ms 1152 KB Output is correct
29 Correct 36 ms 896 KB Output is correct
30 Correct 269 ms 1536 KB Output is correct
31 Correct 274 ms 1792 KB Output is correct
32 Correct 292 ms 2680 KB Output is correct
33 Correct 270 ms 1664 KB Output is correct
34 Correct 279 ms 1784 KB Output is correct
35 Correct 276 ms 1784 KB Output is correct
36 Correct 375 ms 4344 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 271 ms 1536 KB Output is correct
40 Correct 276 ms 1664 KB Output is correct
41 Correct 288 ms 1656 KB Output is correct
42 Correct 305 ms 1656 KB Output is correct
43 Correct 275 ms 1528 KB Output is correct
44 Correct 1 ms 512 KB Output is correct
45 Correct 37 ms 1152 KB Output is correct
46 Correct 40 ms 1152 KB Output is correct
47 Correct 38 ms 1152 KB Output is correct
48 Correct 341 ms 4472 KB Output is correct
49 Correct 364 ms 4472 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 310 ms 2296 KB Output is correct
52 Correct 263 ms 1408 KB Output is correct
53 Correct 279 ms 1528 KB Output is correct
54 Correct 36 ms 896 KB Output is correct
55 Correct 35 ms 896 KB Output is correct
56 Correct 34 ms 896 KB Output is correct
57 Correct 38 ms 1024 KB Output is correct
58 Correct 1 ms 512 KB Output is correct
59 Correct 36 ms 964 KB Output is correct
60 Correct 36 ms 896 KB Output is correct
61 Correct 36 ms 896 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 36 ms 1024 KB Output is correct