oj.uz

Submission #744436

# Submission time Handle Problem Language Result Execution time Memory
744436 2023-05-18T14:47:41 Z Mauve Travelling Merchant (APIO17_merchant) C++14
100 / 100
 88 ms 4212 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 61 ms 1924 KB Output is correct
2 Correct 42 ms 1236 KB Output is correct
3 Correct 31 ms 1236 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 728 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 6 ms 816 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 6 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 6 ms 852 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 728 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 6 ms 816 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 8 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 7 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 5 ms 852 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 5 ms 856 KB Output is correct
18 Correct 7 ms 852 KB Output is correct
19 Correct 9 ms 852 KB Output is correct
20 Correct 9 ms 948 KB Output is correct
21 Correct 6 ms 852 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 7 ms 852 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 7 ms 904 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 8 ms 852 KB Output is correct
28 Correct 7 ms 896 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 5 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 904 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 35 ms 1492 KB Output is correct
9 Correct 79 ms 2112 KB Output is correct
10 Correct 35 ms 1408 KB Output is correct
11 Correct 63 ms 1496 KB Output is correct
12 Correct 42 ms 1492 KB Output is correct
13 Correct 36 ms 1364 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 8 ms 852 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 7 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 5 ms 856 KB Output is correct
10 Correct 7 ms 852 KB Output is correct
11 Correct 9 ms 852 KB Output is correct
12 Correct 9 ms 948 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 7 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 35 ms 1492 KB Output is correct
18 Correct 79 ms 2112 KB Output is correct
19 Correct 35 ms 1408 KB Output is correct
20 Correct 63 ms 1496 KB Output is correct
21 Correct 42 ms 1492 KB Output is correct
22 Correct 36 ms 1364 KB Output is correct
23 Correct 7 ms 904 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 8 ms 852 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 61 ms 1924 KB Output is correct
31 Correct 42 ms 1236 KB Output is correct
32 Correct 31 ms 1236 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 5 ms 728 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 6 ms 816 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 31 ms 1364 KB Output is correct
44 Correct 38 ms 1576 KB Output is correct
45 Correct 49 ms 2608 KB Output is correct
46 Correct 48 ms 1492 KB Output is correct
47 Correct 32 ms 1492 KB Output is correct
48 Correct 32 ms 1492 KB Output is correct
49 Correct 85 ms 4056 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 30 ms 1364 KB Output is correct
53 Correct 35 ms 1348 KB Output is correct
54 Correct 31 ms 1444 KB Output is correct
55 Correct 32 ms 1492 KB Output is correct
56 Correct 29 ms 1328 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 7 ms 980 KB Output is correct
59 Correct 6 ms 980 KB Output is correct
60 Correct 7 ms 980 KB Output is correct
61 Correct 88 ms 4212 KB Output is correct
62 Correct 84 ms 4056 KB Output is correct
63 Correct 1 ms 320 KB Output is correct