Submission #907704

# Submission time Handle Problem Language Result Execution time Memory
907704 2024-01-16T02:31:30 Z shezitt Travelling Merchant (APIO17_merchant) C++14
100 / 100
72 ms 4220 KB
// CODE FROM USACO GUIDE, JUST TESTING
#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;
}
# Verdict Execution time Memory Grader output
1 Correct 44 ms 2140 KB Output is correct
2 Correct 26 ms 1368 KB Output is correct
3 Correct 28 ms 1372 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 4 ms 856 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 6 ms 860 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 856 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 4 ms 924 KB Output is correct
19 Correct 4 ms 1112 KB Output is correct
20 Correct 5 ms 1116 KB Output is correct
21 Correct 4 ms 856 KB Output is correct
22 Correct 4 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 4 ms 860 KB Output is correct
31 Correct 5 ms 860 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 29 ms 1628 KB Output is correct
9 Correct 62 ms 2108 KB Output is correct
10 Correct 28 ms 1372 KB Output is correct
11 Correct 29 ms 1628 KB Output is correct
12 Correct 29 ms 1628 KB Output is correct
13 Correct 28 ms 1372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 860 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 856 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 924 KB Output is correct
11 Correct 4 ms 1112 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 4 ms 856 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 29 ms 1628 KB Output is correct
18 Correct 62 ms 2108 KB Output is correct
19 Correct 28 ms 1372 KB Output is correct
20 Correct 29 ms 1628 KB Output is correct
21 Correct 29 ms 1628 KB Output is correct
22 Correct 28 ms 1372 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 5 ms 860 KB Output is correct
30 Correct 44 ms 2140 KB Output is correct
31 Correct 26 ms 1368 KB Output is correct
32 Correct 28 ms 1372 KB Output is correct
33 Correct 4 ms 860 KB Output is correct
34 Correct 4 ms 860 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 4 ms 860 KB Output is correct
37 Correct 0 ms 600 KB Output is correct
38 Correct 4 ms 860 KB Output is correct
39 Correct 4 ms 860 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 4 ms 856 KB Output is correct
43 Correct 27 ms 1372 KB Output is correct
44 Correct 29 ms 1624 KB Output is correct
45 Correct 41 ms 2732 KB Output is correct
46 Correct 29 ms 1624 KB Output is correct
47 Correct 29 ms 1628 KB Output is correct
48 Correct 28 ms 1628 KB Output is correct
49 Correct 72 ms 4180 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 27 ms 1368 KB Output is correct
53 Correct 28 ms 1372 KB Output is correct
54 Correct 28 ms 1588 KB Output is correct
55 Correct 27 ms 1368 KB Output is correct
56 Correct 27 ms 1368 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 5 ms 1000 KB Output is correct
59 Correct 7 ms 1116 KB Output is correct
60 Correct 5 ms 1116 KB Output is correct
61 Correct 70 ms 4220 KB Output is correct
62 Correct 70 ms 4180 KB Output is correct
63 Correct 1 ms 344 KB Output is correct