#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) static_cast<int>((x).size())
template<class T, size_t D>
struct vec : vector<vec<T, D - 1>> {
template<class... Args>
vec(size_t n = 0, Args... args)
: vector<vec<T, D - 1>>(n, vec<T, D - 1>(args...)) {}
};
template<class T>
struct vec<T, 1> : vector<T> {
template<class... Args>
vec(Args... args)
: vector<T>(args...) {}
};
template<class T>
inline bool Minimize(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T>
inline bool Maximize(T& a, const T& b) { return a < b ? a = b, true : false; }
inline int Next(int i, int n) { return i == n - 1 ? 0 : i + 1; }
inline int Prev(int i, int n) { return !i ? n - 1 : i - 1; }
mt19937 rng(static_cast<uint32_t>(chrono::steady_clock::now().time_since_epoch().count()));
constexpr int kSmallInf = 1e9;
constexpr int64_t kBigInf = 1e18;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n_vertices, n_edges, n_items; cin >> n_vertices >> n_edges >> n_items;
vec<pair<int, int>, 2> price_items_vertices(n_vertices, n_items);
for (auto& price_items : price_items_vertices) {
for (auto& price_item : price_items) {
cin >> price_item.first >> price_item.second;
}
}
vec<int, 2> max_profit_pairs(n_vertices, n_vertices);
for (int i = 0; i < n_vertices; ++i) {
for (int j = 0; j < n_vertices; ++j) {
for (int k = 0; k < n_items; ++k) {
if (~price_items_vertices[i][k].first && ~price_items_vertices[j][k].second) {
Maximize(max_profit_pairs[i][j], - price_items_vertices[i][k].first + price_items_vertices[j][k].second);
}
}
}
}
vec<int, 2> min_distance_paths(n_vertices, n_vertices, kSmallInf);
for (int u = 0; u < n_vertices; ++u) {
min_distance_paths[u][u] = 0;
}
while (n_edges--) {
int u, v, w; cin >> u >> v >> w; --u; --v;
min_distance_paths[u][v] = w;
}
for (int k = 0; k < n_vertices; ++k) {
for (int i = 0; i < n_vertices; ++i) {
for (int j = 0; j < n_vertices; ++j) {
Minimize(min_distance_paths[i][j], min_distance_paths[i][k] + min_distance_paths[k][j]);
}
}
}
auto Check = [&](int efficiency) -> bool {
vec<int64_t, 2> f(n_vertices, n_vertices, -kBigInf);
for (int i = 0; i < n_vertices; ++i) {
for (int j = 0; j < n_vertices; ++j) {
if (min_distance_paths[i][j] != kSmallInf && i != j) {
f[i][j] = static_cast<int64_t>(max_profit_pairs[i][j]) - static_cast<int64_t>(efficiency) * min_distance_paths[i][j];
}
}
}
for (int k = 0; k < n_vertices; ++k) {
for (int i = 0; i < n_vertices; ++i) {
for (int j = 0; j < n_vertices; ++j) {
Maximize(f[i][j], f[i][k] + f[k][j]);
}
}
}
for (int i = 0; i < n_vertices; ++i) {
if (f[i][i] >= 0) {
return true;
}
}
return false;
};
int left_answer = 0, right_answer = static_cast<int>(1e9);
while (left_answer < right_answer) {
int middle_answer = (left_answer + right_answer + 1) >> 1;
if (Check(middle_answer)) {
left_answer = middle_answer;
} else {
right_answer = middle_answer - 1;
}
}
cout << left_answer << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
59 ms |
1272 KB |
Output is correct |
2 |
Correct |
32 ms |
512 KB |
Output is correct |
3 |
Correct |
32 ms |
512 KB |
Output is correct |
4 |
Correct |
6 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
6 ms |
384 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
12 |
Correct |
0 ms |
384 KB |
Output is correct |
13 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
6 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
11 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
10 ms |
384 KB |
Output is correct |
8 |
Correct |
6 ms |
384 KB |
Output is correct |
9 |
Correct |
6 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
13 ms |
384 KB |
Output is correct |
12 |
Correct |
7 ms |
384 KB |
Output is correct |
13 |
Correct |
10 ms |
384 KB |
Output is correct |
14 |
Correct |
7 ms |
384 KB |
Output is correct |
15 |
Correct |
13 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
384 KB |
Output is correct |
17 |
Correct |
19 ms |
384 KB |
Output is correct |
18 |
Correct |
0 ms |
384 KB |
Output is correct |
19 |
Correct |
13 ms |
384 KB |
Output is correct |
20 |
Correct |
9 ms |
384 KB |
Output is correct |
21 |
Correct |
8 ms |
384 KB |
Output is correct |
22 |
Correct |
6 ms |
384 KB |
Output is correct |
23 |
Correct |
7 ms |
384 KB |
Output is correct |
24 |
Correct |
5 ms |
384 KB |
Output is correct |
25 |
Correct |
6 ms |
384 KB |
Output is correct |
26 |
Correct |
0 ms |
384 KB |
Output is correct |
27 |
Correct |
5 ms |
384 KB |
Output is correct |
28 |
Correct |
6 ms |
384 KB |
Output is correct |
29 |
Correct |
6 ms |
384 KB |
Output is correct |
30 |
Correct |
0 ms |
384 KB |
Output is correct |
31 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
88 ms |
640 KB |
Output is correct |
2 |
Correct |
134 ms |
1144 KB |
Output is correct |
3 |
Correct |
82 ms |
512 KB |
Output is correct |
4 |
Correct |
97 ms |
640 KB |
Output is correct |
5 |
Correct |
95 ms |
640 KB |
Output is correct |
6 |
Correct |
49 ms |
512 KB |
Output is correct |
7 |
Correct |
19 ms |
384 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
13 ms |
384 KB |
Output is correct |
10 |
Correct |
9 ms |
384 KB |
Output is correct |
11 |
Correct |
8 ms |
384 KB |
Output is correct |
12 |
Correct |
6 ms |
384 KB |
Output is correct |
13 |
Correct |
7 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
6 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
11 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
10 ms |
384 KB |
Output is correct |
8 |
Correct |
6 ms |
384 KB |
Output is correct |
9 |
Correct |
6 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
13 ms |
384 KB |
Output is correct |
12 |
Correct |
7 ms |
384 KB |
Output is correct |
13 |
Correct |
10 ms |
384 KB |
Output is correct |
14 |
Correct |
7 ms |
384 KB |
Output is correct |
15 |
Correct |
13 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
384 KB |
Output is correct |
17 |
Correct |
88 ms |
640 KB |
Output is correct |
18 |
Correct |
134 ms |
1144 KB |
Output is correct |
19 |
Correct |
82 ms |
512 KB |
Output is correct |
20 |
Correct |
97 ms |
640 KB |
Output is correct |
21 |
Correct |
95 ms |
640 KB |
Output is correct |
22 |
Correct |
49 ms |
512 KB |
Output is correct |
23 |
Correct |
19 ms |
384 KB |
Output is correct |
24 |
Correct |
0 ms |
384 KB |
Output is correct |
25 |
Correct |
13 ms |
384 KB |
Output is correct |
26 |
Correct |
9 ms |
384 KB |
Output is correct |
27 |
Correct |
8 ms |
384 KB |
Output is correct |
28 |
Correct |
6 ms |
384 KB |
Output is correct |
29 |
Correct |
7 ms |
384 KB |
Output is correct |
30 |
Correct |
37 ms |
580 KB |
Output is correct |
31 |
Correct |
39 ms |
640 KB |
Output is correct |
32 |
Correct |
56 ms |
1148 KB |
Output is correct |
33 |
Correct |
34 ms |
640 KB |
Output is correct |
34 |
Correct |
36 ms |
640 KB |
Output is correct |
35 |
Correct |
35 ms |
760 KB |
Output is correct |
36 |
Correct |
106 ms |
1272 KB |
Output is correct |
37 |
Correct |
0 ms |
384 KB |
Output is correct |
38 |
Correct |
1 ms |
384 KB |
Output is correct |
39 |
Correct |
35 ms |
512 KB |
Output is correct |
40 |
Correct |
37 ms |
512 KB |
Output is correct |
41 |
Correct |
38 ms |
512 KB |
Output is correct |
42 |
Correct |
34 ms |
512 KB |
Output is correct |
43 |
Correct |
39 ms |
512 KB |
Output is correct |
44 |
Correct |
1 ms |
384 KB |
Output is correct |
45 |
Correct |
9 ms |
384 KB |
Output is correct |
46 |
Correct |
8 ms |
384 KB |
Output is correct |
47 |
Correct |
7 ms |
384 KB |
Output is correct |
48 |
Correct |
84 ms |
1272 KB |
Output is correct |
49 |
Correct |
94 ms |
1272 KB |
Output is correct |
50 |
Correct |
1 ms |
384 KB |
Output is correct |
51 |
Correct |
59 ms |
1272 KB |
Output is correct |
52 |
Correct |
32 ms |
512 KB |
Output is correct |
53 |
Correct |
32 ms |
512 KB |
Output is correct |
54 |
Correct |
6 ms |
384 KB |
Output is correct |
55 |
Correct |
5 ms |
384 KB |
Output is correct |
56 |
Correct |
5 ms |
384 KB |
Output is correct |
57 |
Correct |
6 ms |
384 KB |
Output is correct |
58 |
Correct |
0 ms |
384 KB |
Output is correct |
59 |
Correct |
5 ms |
384 KB |
Output is correct |
60 |
Correct |
6 ms |
384 KB |
Output is correct |
61 |
Correct |
6 ms |
384 KB |
Output is correct |
62 |
Correct |
0 ms |
384 KB |
Output is correct |
63 |
Correct |
5 ms |
384 KB |
Output is correct |