oj.uz

Submission #253372

# Submission time Handle Problem Language Result Execution time Memory
253372 2020-07-27T19:12:48 Z super_j6 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 109 ms 4216 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<ll, ll>
#define f first
#define s second
 
const ll inf = 0x3f3f3f3f;
const int mxn = 100, mxk = 1000;
int n, m, k;
ll a[mxn][mxk][2];
pi g[mxn][mxn];
ll g2[mxn][mxn];
 
bool sol(ll x){
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
		g2[i][j] = g[i][j].f - x * g[i][j].s;
	}
	for(int l = 0; l < n; l++)
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
		g2[i][j] = max(g2[i][j], g2[i][l] + g2[l][j]);
	}
	for(int i = 0; i < n; i++){
		if(/*(!i || (g[0][i].s < inf && g[i][0].s < inf)) &&*/ g2[i][i] >= 0) return 1;
	}
	return 0;
}
 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m >> k;
	
	for(int i = 0; i < n; i++)
	for(int j = 0; j < k; j++)
	for(int l = 0; l < 2; l++){
		cin >> a[i][j][l];
	}
	
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
		g[i][j] = {0, inf};
		for(int l = 0; l < k; l++){
			if(~a[i][l][0] && ~a[j][l][1]) g[i][j].f = max(g[i][j].f, a[j][l][1] - a[i][l][0]);
		}
	}
	
	for(int i = 0; i < m; i++){
		ll u, v, w;
		cin >> u >> v >> w;
		u--, v--;
		g[u][v].s = min(g[u][v].s, w);
	}
	
	for(int l = 0; l < n; l++)
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
		g[i][j].s = min(g[i][j].s, g[i][l].s + g[l][j].s);
	}
	/*
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
		cout << g[i][j].f << " " << g[i][j].s << " | ";
		if(j == n - 1) cout << endl;
	}
	cout << endl;
	*/
	int l = 0, r = inf;
	while(r - l > 1){
		int mid = (l + r) / 2;
		if(sol(mid)) l = mid;
		else r = mid;
	}
	/*
	cout << sol(r) << endl;
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
		if(i == j) cout << g2[i][j] << " " << g[0][i].s << " " << g[i][0].s;
		if(j == n - 1) cout << endl;
	}
	cout << endl;
	*/
	cout << l << endl;
 
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 2168 KB Output is correct
2 Correct 36 ms 1024 KB Output is correct
3 Correct 36 ms 1016 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 6 ms 640 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1152 KB Output is correct
2 Correct 95 ms 2168 KB Output is correct
3 Correct 39 ms 1024 KB Output is correct
4 Correct 43 ms 1152 KB Output is correct
5 Correct 54 ms 1164 KB Output is correct
6 Correct 39 ms 1024 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 7 ms 640 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 616 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 7 ms 768 KB Output is correct
12 Correct 6 ms 768 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 7 ms 768 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 43 ms 1152 KB Output is correct
18 Correct 95 ms 2168 KB Output is correct
19 Correct 39 ms 1024 KB Output is correct
20 Correct 43 ms 1152 KB Output is correct
21 Correct 54 ms 1164 KB Output is correct
22 Correct 39 ms 1024 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 7 ms 640 KB Output is correct
26 Correct 7 ms 640 KB Output is correct
27 Correct 7 ms 640 KB Output is correct
28 Correct 6 ms 640 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 37 ms 1024 KB Output is correct
31 Correct 40 ms 1152 KB Output is correct
32 Correct 55 ms 2560 KB Output is correct
33 Correct 40 ms 1152 KB Output is correct
34 Correct 39 ms 1152 KB Output is correct
35 Correct 40 ms 1152 KB Output is correct
36 Correct 103 ms 4088 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 40 ms 1024 KB Output is correct
40 Correct 43 ms 1152 KB Output is correct
41 Correct 38 ms 1152 KB Output is correct
42 Correct 38 ms 1076 KB Output is correct
43 Correct 38 ms 1024 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 8 ms 768 KB Output is correct
46 Correct 8 ms 768 KB Output is correct
47 Correct 8 ms 768 KB Output is correct
48 Correct 109 ms 4216 KB Output is correct
49 Correct 104 ms 4216 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 65 ms 2168 KB Output is correct
52 Correct 36 ms 1024 KB Output is correct
53 Correct 36 ms 1016 KB Output is correct
54 Correct 6 ms 640 KB Output is correct
55 Correct 5 ms 640 KB Output is correct
56 Correct 6 ms 640 KB Output is correct
57 Correct 6 ms 640 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 6 ms 640 KB Output is correct
60 Correct 6 ms 640 KB Output is correct
61 Correct 6 ms 640 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 6 ms 640 KB Output is correct