oj.uz

Submission #231946

# Submission time Handle Problem Language Result Execution time Memory
231946 2020-05-15T12:15:53 Z Atalasion Travelling Merchant (APIO17_merchant) C++14
100 / 100
 110 ms 2552 KB 
//khodaya khodet komak kon
#include <bits/stdc++.h>
 
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize ("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize ("-O2")
#define int long long
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
 
const int N = 100 + 10;
const ll MOD = 1000000000 + 7;
const ll INF = 1000000000;
const ll LOG = 25;
 
int n, m, K, B[N][N * 10], S[N][N * 10];
ll dis[N][N], pth[N][N], D[N][N];

bool isval(ll x){
	for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) D[i][j] = x * dis[i][j] - pth[i][j];
	for (int k = 1; k <= n; k++) for (int v = 1; v <= n; v++) for (int u = 1; u <= n; u++) if (v != u) D[v][u] = min(D[v][u], D[v][k] + D[k][u]);
	for (int v = 1; v <= n; v++) for (int u = 1; u <= n; u++) if (v != u && D[v][u] + D[u][v]<= 0) return 1;
	return 0;
}

 
int32_t main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m >> K;
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= 2 * K; j++){
			if (j % 2 == 1) cin >> B[i][j / 2 + 1];
			else cin >> S[i][j / 2];
		}
	}
	for (int i = 0; i < N; i++)for (int j = 0; j < N; j++) dis[i][j] = INF;
	for (int i = 1; i <= n; i++) dis[i][i] = 0;
	for (int i = 1; i <= m; i++){
		ll v, u, T;
		cin >> v >> u >> T;
		dis[v][u] = min(dis[v][u], T);
	} 
	for (int k = 1; k <= n; k++)for (int v = 1; v <= n; v++) for (int u = 1; u <= n; u++) dis[v][u] = min(dis[v][u], dis[v][k] + dis[k][u]);
	for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++)for (int k = 1; k <= K; k++)if (S[j][k] != -1 && B[i][k] != -1) pth[i][j] = max(pth[i][j], S[j][k] - B[i][k]);
	ll l = 0, r = INF;
	while (r - l > 1){
		ll md = (l + r) >> 1;
		if (isval(md)) l = md;
		else r = md;
	}
	cout << l;
//	isval(5);
 
 
 
 
 
 
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 2424 KB Output is correct
2 Correct 38 ms 1404 KB Output is correct
3 Correct 39 ms 1408 KB Output is correct
4 Correct 9 ms 768 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 9 ms 896 KB Output is correct
7 Correct 10 ms 1024 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 12 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 9 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 1536 KB Output is correct
2 Correct 99 ms 2296 KB Output is correct
3 Correct 42 ms 1536 KB Output is correct
4 Correct 45 ms 1536 KB Output is correct
5 Correct 46 ms 1624 KB Output is correct
6 Correct 53 ms 1536 KB Output is correct
7 Correct 10 ms 1024 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 10 ms 1024 KB Output is correct
10 Correct 10 ms 1024 KB Output is correct
11 Correct 10 ms 1024 KB Output is correct
12 Correct 10 ms 896 KB Output is correct
13 Correct 9 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1024 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 12 ms 1024 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 10 ms 1024 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 10 ms 1024 KB Output is correct
9 Correct 9 ms 1024 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 10 ms 1024 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 10 ms 1024 KB Output is correct
15 Correct 12 ms 1024 KB Output is correct
16 Correct 9 ms 896 KB Output is correct
17 Correct 44 ms 1536 KB Output is correct
18 Correct 99 ms 2296 KB Output is correct
19 Correct 42 ms 1536 KB Output is correct
20 Correct 45 ms 1536 KB Output is correct
21 Correct 46 ms 1624 KB Output is correct
22 Correct 53 ms 1536 KB Output is correct
23 Correct 10 ms 1024 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 10 ms 1024 KB Output is correct
26 Correct 10 ms 1024 KB Output is correct
27 Correct 10 ms 1024 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 9 ms 896 KB Output is correct
30 Correct 40 ms 1528 KB Output is correct
31 Correct 41 ms 1664 KB Output is correct
32 Correct 61 ms 2552 KB Output is correct
33 Correct 43 ms 1664 KB Output is correct
34 Correct 42 ms 1664 KB Output is correct
35 Correct 43 ms 1664 KB Output is correct
36 Correct 110 ms 2424 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 40 ms 1408 KB Output is correct
40 Correct 44 ms 1576 KB Output is correct
41 Correct 40 ms 1536 KB Output is correct
42 Correct 39 ms 1536 KB Output is correct
43 Correct 42 ms 1528 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 12 ms 1152 KB Output is correct
46 Correct 12 ms 1280 KB Output is correct
47 Correct 12 ms 1152 KB Output is correct
48 Correct 106 ms 2428 KB Output is correct
49 Correct 104 ms 2424 KB Output is correct
50 Correct 5 ms 512 KB Output is correct
51 Correct 70 ms 2424 KB Output is correct
52 Correct 38 ms 1404 KB Output is correct
53 Correct 39 ms 1408 KB Output is correct
54 Correct 9 ms 768 KB Output is correct
55 Correct 9 ms 896 KB Output is correct
56 Correct 9 ms 896 KB Output is correct
57 Correct 10 ms 1024 KB Output is correct
58 Correct 4 ms 512 KB Output is correct
59 Correct 12 ms 896 KB Output is correct
60 Correct 10 ms 896 KB Output is correct
61 Correct 9 ms 896 KB Output is correct
62 Correct 5 ms 512 KB Output is correct
63 Correct 9 ms 896 KB Output is correct