oj.uz

Submission #631858

# Submission time Handle Problem Language Result Execution time Memory
631858 2022-08-19T01:57:43 Z ziduo Travelling Merchant (APIO17_merchant) C++14
100 / 100
 113 ms 4156 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
 
const ll INF = LLONG_MAX / 2;
 
int n, m, x;
ll b[101][1001], s[101][1001];
ll graph[101][101], profit[101][101], graph2[101][101];
 
void floyd_warshall(ll adj[101][101]) {
	FOR(i, 1, n + 1)
		FOR(j, 1, n + 1)
			FOR(k, 1, n + 1)
				adj[j][k] = min(adj[j][k], adj[j][i] + adj[i][k]);
}
 
int main() {
	iostream::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m >> x;
	FOR(i, 1, n + 1) {
		FOR(j, 1, n + 1) graph[i][j] = INF;
		FOR(j, 1, x + 1) cin >> b[i][j] >> s[i][j];
	}
	FOR(i, 0, m) {
		int u, v, w;
		cin >> u >> v >> w;
		graph[u][v] = w;
	}
	floyd_warshall(graph);
	FOR(i, 1, n + 1) FOR(j, 1, n + 1) FOR(k, 1, x + 1)
		if (s[j][k] != -1 && b[i][k] != -1)
			profit[i][j] = max(profit[i][j], s[j][k] - b[i][k]);
 
	ll l = 1, r = 1e9;
	while (l <= r) {
		ll mid = (l + r) / 2;
		FOR(i, 1, n + 1) FOR(j, 1, n + 1)
			graph2[i][j] = mid * min(graph[i][j], INF / mid) - profit[i][j];
		floyd_warshall(graph2);
		bool has_nonnegative_cycle = false;
		FOR(i, 1, n + 1) if (graph2[i][i] <= 0) has_nonnegative_cycle = true;
		if (has_nonnegative_cycle) l = mid + 1;
		else r = mid - 1;
	}
	cout << r;
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3296 KB Output is correct
2 Correct 43 ms 1236 KB Output is correct
3 Correct 36 ms 1296 KB Output is correct
4 Correct 5 ms 712 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 5 ms 716 KB Output is correct
11 Correct 5 ms 712 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 8 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 716 KB Output is correct
6 Correct 5 ms 712 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 8 ms 852 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 8 ms 852 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 6 ms 840 KB Output is correct
16 Correct 8 ms 852 KB Output is correct
17 Correct 7 ms 852 KB Output is correct
18 Correct 8 ms 912 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 6 ms 852 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 6 ms 852 KB Output is correct
23 Correct 9 ms 852 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 7 ms 856 KB Output is correct
28 Correct 8 ms 952 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 6 ms 852 KB Output is correct
31 Correct 7 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 7 ms 856 KB Output is correct
4 Correct 8 ms 952 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 7 ms 852 KB Output is correct
8 Correct 46 ms 1584 KB Output is correct
9 Correct 103 ms 3756 KB Output is correct
10 Correct 33 ms 1492 KB Output is correct
11 Correct 35 ms 1716 KB Output is correct
12 Correct 36 ms 1636 KB Output is correct
13 Correct 32 ms 1492 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 840 KB Output is correct
8 Correct 8 ms 852 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 8 ms 912 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 6 ms 852 KB Output is correct
15 Correct 9 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 46 ms 1584 KB Output is correct
18 Correct 103 ms 3756 KB Output is correct
19 Correct 33 ms 1492 KB Output is correct
20 Correct 35 ms 1716 KB Output is correct
21 Correct 36 ms 1636 KB Output is correct
22 Correct 32 ms 1492 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 7 ms 856 KB Output is correct
26 Correct 8 ms 952 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 7 ms 852 KB Output is correct
30 Correct 59 ms 3296 KB Output is correct
31 Correct 43 ms 1236 KB Output is correct
32 Correct 36 ms 1296 KB Output is correct
33 Correct 5 ms 712 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 5 ms 852 KB Output is correct
37 Correct 1 ms 352 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 5 ms 716 KB Output is correct
40 Correct 5 ms 712 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 8 ms 852 KB Output is correct
43 Correct 31 ms 1364 KB Output is correct
44 Correct 32 ms 1488 KB Output is correct
45 Correct 48 ms 2484 KB Output is correct
46 Correct 47 ms 1580 KB Output is correct
47 Correct 37 ms 1488 KB Output is correct
48 Correct 36 ms 1620 KB Output is correct
49 Correct 85 ms 4000 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 32 ms 1360 KB Output is correct
53 Correct 35 ms 1476 KB Output is correct
54 Correct 34 ms 1364 KB Output is correct
55 Correct 32 ms 1364 KB Output is correct
56 Correct 44 ms 1344 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 8 ms 984 KB Output is correct
59 Correct 7 ms 1036 KB Output is correct
60 Correct 10 ms 980 KB Output is correct
61 Correct 113 ms 4156 KB Output is correct
62 Correct 88 ms 4036 KB Output is correct
63 Correct 1 ms 340 KB Output is correct