oj.uz

Submission #383337

# Submission time Handle Problem Language Result Execution time Memory
383337 2021-03-29T16:32:40 Z Saynaa Travelling Merchant (APIO17_merchant) C++14
100 / 100
 143 ms 5484 KB 
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const int MAXN = 1000 + 10;
const ll MAX = LLONG_MAX/2;
int n, m, pf;
ll mat[MAXN][MAXN], tmp[MAXN][MAXN], b[MAXN][MAXN], s[MAXN][MAXN], res[MAXN][MAXN];
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> m >> pf;
	for(int i = 0; i < n; i ++){
		for(int j = 0; j < n; j ++) mat[i][j] = MAX;
		for(int j = 0; j < pf; j ++)
			cin >> b[i][j] >> s[i][j];
	}
	for(int i = 0; i < m; i ++){
		int u, v;
		ll w;
		cin >> u >> v >> w, u --, v --;
		mat[u][v] = w;
	}
	for(int i = 0; i < n; i ++)
		for(int j = 0; j < n; j ++)
			for(int t = 0; t < n; t ++)
				mat[j][t] = min(mat[j][t], mat[j][i] + mat[i][t]);

	for(int i = 0; i < n; i ++)
		for(int j = 0; j < n; j ++)
			for(int t = 0; t < pf; t ++)
				if( s[j][t] != -1 && b[i][t] != -1)
					res[i][j] = max(res[i][j], s[j][t] - b[i][t]);
	
	ll l = 1, r = MAX, ans = MAX;
	while( l <= r){
		ll mid = (l + r)/2;
		for(int i = 0; i < n; i ++)
			for(int j = 0; j < n; j ++)
				tmp[i][j] = mid*min(mat[i][j], MAX/mid) - res[i][j];
		for(int i = 0; i < n; i ++)
			for(int j = 0; j < n; j ++)
				for(int t = 0; t < n; t ++)
					tmp[j][t] = min(tmp[j][t], tmp[j][i] + tmp[i][t]);
		bool dor = false;
		for(int i = 0; i < n; i ++)
			if( tmp[i][i] <= 0) dor = true;
		if( dor ) l = mid + 1;
		else r = mid - 1, ans = min(ans, mid);
	}
	cout << r << endl;

	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 2924 KB Output is correct
2 Correct 78 ms 2184 KB Output is correct
3 Correct 77 ms 2188 KB Output is correct
4 Correct 12 ms 1132 KB Output is correct
5 Correct 17 ms 1260 KB Output is correct
6 Correct 12 ms 1260 KB Output is correct
7 Correct 12 ms 1260 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 12 ms 1132 KB Output is correct
10 Correct 12 ms 1260 KB Output is correct
11 Correct 12 ms 1260 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 14 ms 1260 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1388 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 19 ms 1388 KB Output is correct
4 Correct 13 ms 1388 KB Output is correct
5 Correct 13 ms 1388 KB Output is correct
6 Correct 12 ms 1388 KB Output is correct
7 Correct 12 ms 1388 KB Output is correct
8 Correct 84 ms 2924 KB Output is correct
9 Correct 130 ms 3436 KB Output is correct
10 Correct 79 ms 2796 KB Output is correct
11 Correct 90 ms 3052 KB Output is correct
12 Correct 87 ms 2924 KB Output is correct
13 Correct 79 ms 2796 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1388 KB Output is correct
2 Correct 12 ms 1260 KB Output is correct
3 Correct 12 ms 1388 KB Output is correct
4 Correct 11 ms 1388 KB Output is correct
5 Correct 13 ms 1388 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 12 ms 1260 KB Output is correct
8 Correct 14 ms 1388 KB Output is correct
9 Correct 14 ms 1388 KB Output is correct
10 Correct 12 ms 1260 KB Output is correct
11 Correct 13 ms 1388 KB Output is correct
12 Correct 13 ms 1388 KB Output is correct
13 Correct 12 ms 1388 KB Output is correct
14 Correct 12 ms 1388 KB Output is correct
15 Correct 13 ms 1388 KB Output is correct
16 Correct 12 ms 1260 KB Output is correct
17 Correct 84 ms 2924 KB Output is correct
18 Correct 130 ms 3436 KB Output is correct
19 Correct 79 ms 2796 KB Output is correct
20 Correct 90 ms 3052 KB Output is correct
21 Correct 87 ms 2924 KB Output is correct
22 Correct 79 ms 2796 KB Output is correct
23 Correct 13 ms 1388 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 19 ms 1388 KB Output is correct
26 Correct 13 ms 1388 KB Output is correct
27 Correct 13 ms 1388 KB Output is correct
28 Correct 12 ms 1388 KB Output is correct
29 Correct 12 ms 1388 KB Output is correct
30 Correct 104 ms 2924 KB Output is correct
31 Correct 78 ms 2184 KB Output is correct
32 Correct 77 ms 2188 KB Output is correct
33 Correct 12 ms 1132 KB Output is correct
34 Correct 17 ms 1260 KB Output is correct
35 Correct 12 ms 1260 KB Output is correct
36 Correct 12 ms 1260 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 12 ms 1132 KB Output is correct
39 Correct 12 ms 1260 KB Output is correct
40 Correct 12 ms 1260 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 14 ms 1260 KB Output is correct
43 Correct 78 ms 2284 KB Output is correct
44 Correct 81 ms 2924 KB Output is correct
45 Correct 102 ms 3948 KB Output is correct
46 Correct 82 ms 2796 KB Output is correct
47 Correct 80 ms 2796 KB Output is correct
48 Correct 82 ms 2796 KB Output is correct
49 Correct 138 ms 5484 KB Output is correct
50 Correct 1 ms 492 KB Output is correct
51 Correct 1 ms 492 KB Output is correct
52 Correct 78 ms 2284 KB Output is correct
53 Correct 91 ms 2440 KB Output is correct
54 Correct 79 ms 2540 KB Output is correct
55 Correct 79 ms 2284 KB Output is correct
56 Correct 81 ms 2156 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 14 ms 1644 KB Output is correct
59 Correct 14 ms 1644 KB Output is correct
60 Correct 14 ms 1644 KB Output is correct
61 Correct 143 ms 5484 KB Output is correct
62 Correct 139 ms 5448 KB Output is correct
63 Correct 1 ms 492 KB Output is correct