//Pantyhose(black) + glasses = infinity
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) {cerr << #A << " = "; for (int64_t _=1; _<=n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; for (int64_t _=0; _<n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define FILE_NAME "merchant"
const int64_t MAX_N = 102;
const int64_t MAX_K = 1002;
const int64_t INF = 1e9+1e8;
struct edge {
int64_t u, v;
double w;
edge() {}
edge(int64_t u, int64_t v, double w): u(u), v(v), w(w) {}
};
int64_t n, m, k, b[MAX_N][MAX_K], s[MAX_N][MAX_K], c[MAX_N][MAX_N], mx[MAX_N][MAX_N];
vector<edge> g[MAX_N];
double d[MAX_N];
void read_input() {
cin >> n >> m >> k;
for (int64_t i=1; i<=n; ++i) {
for (int64_t j=1; j<=k; ++j)
cin >> b[i][j] >> s[i][j];
}
}
void floyd() {
for (int64_t i=1; i<=n; ++i) {
for (int64_t j=1; j<=n; ++j)
c[i][j] = INF;
}
for (int64_t i=1; i<=n; ++i)
c[i][i] = 0;
for (int64_t i=1; i<=m; ++i) {
int64_t u, v;
cin >> u >> v;
cin >> c[u][v];
}
for (int64_t k=1; k<=n; ++k) {
for (int64_t i=1; i<=n; ++i) {
for (int64_t j=1; j<=n; ++j) {
c[i][j] = min(c[i][j], c[i][k] + c[k][j]);
assert(c[i][j]>=0);
}
}
}
// debug(c[4][1]);
}
void init() {
for (int64_t i=1; i<=n; ++i) {
for (int64_t j=1; j<=n; ++j) {
mx[i][j] = -INF;
for (int64_t t=1; t<=k; ++t) {
if (b[i][t]!=-1 && s[j][t]!=-1)
mx[i][j] = max(mx[i][j], -b[i][t] + s[j][t]);
}
}
}
// debug(mx[1][4]);
}
bool relax(edge e) {
if (d[e.v]>d[e.u] + e.w) {
d[e.v] = d[e.u] + e.w;
return true;
}
return false;
}
bool check_negative_cycle(double x) {
vector<edge> E;
for (int64_t i=1; i<=n; ++i) {
for (int64_t j=1; j<=n; ++j)
E.push_back(edge(i, j, x*c[i][j] - max((int64_t)0, mx[i][j])));
}
memset(d, 0, sizeof(d));
for (int64_t i=0; i<=n; ++i) {
if (i==n)
return true;
bool stop = true;
for (auto e : E) {
if (relax(e))
stop = false;
}
if (stop)
break;
}
return false;
}
double bisect() {
double l = 0, r = INF;
while (abs(l-r)>1e-2) {
double mid = (l + r) / 2;
if (check_negative_cycle(mid))
l = mid;
else
r = mid;
}
return r;
}
int main() {
//freopen(FILE_NAME".inp", "r", stdin);
//freopen(FILE_NAME".out", "w", stdout);
ios::sync_with_stdio(0); cin.tie(0);
read_input();
floyd();
init();
// debug(check_negative_cycle(1.9));
cout << int64_t(bisect());
// for (int64_t i=1; i<=n; ++i) {
// for (int64_t j=1; j<=n; ++j) {
// if (mx[i][j]==-INF)
// cout << -1 << " \n"[j==n];
// else
// cout << mx[i][j] << " \n"[j==n];
// }
// }
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
53 ms |
2760 KB |
Output is correct |
2 |
Incorrect |
28 ms |
2000 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
1056 KB |
Output is correct |
2 |
Correct |
8 ms |
1024 KB |
Output is correct |
3 |
Correct |
9 ms |
1088 KB |
Output is correct |
4 |
Correct |
8 ms |
1044 KB |
Output is correct |
5 |
Correct |
10 ms |
1088 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
7 ms |
1056 KB |
Output is correct |
8 |
Correct |
8 ms |
1056 KB |
Output is correct |
9 |
Correct |
8 ms |
1056 KB |
Output is correct |
10 |
Correct |
10 ms |
1056 KB |
Output is correct |
11 |
Correct |
10 ms |
1088 KB |
Output is correct |
12 |
Correct |
13 ms |
1056 KB |
Output is correct |
13 |
Correct |
11 ms |
1056 KB |
Output is correct |
14 |
Correct |
9 ms |
1088 KB |
Output is correct |
15 |
Correct |
9 ms |
1056 KB |
Output is correct |
16 |
Correct |
7 ms |
1024 KB |
Output is correct |
17 |
Correct |
8 ms |
1152 KB |
Output is correct |
18 |
Correct |
2 ms |
384 KB |
Output is correct |
19 |
Correct |
12 ms |
1056 KB |
Output is correct |
20 |
Correct |
9 ms |
1056 KB |
Output is correct |
21 |
Correct |
8 ms |
1056 KB |
Output is correct |
22 |
Correct |
9 ms |
1056 KB |
Output is correct |
23 |
Correct |
10 ms |
1024 KB |
Output is correct |
24 |
Correct |
6 ms |
1056 KB |
Output is correct |
25 |
Correct |
9 ms |
1056 KB |
Output is correct |
26 |
Correct |
2 ms |
384 KB |
Output is correct |
27 |
Correct |
10 ms |
1024 KB |
Output is correct |
28 |
Correct |
10 ms |
1056 KB |
Output is correct |
29 |
Correct |
10 ms |
1024 KB |
Output is correct |
30 |
Correct |
3 ms |
512 KB |
Output is correct |
31 |
Correct |
6 ms |
1088 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
39 ms |
2280 KB |
Output is correct |
2 |
Correct |
98 ms |
2792 KB |
Output is correct |
3 |
Correct |
43 ms |
2120 KB |
Output is correct |
4 |
Correct |
54 ms |
2216 KB |
Output is correct |
5 |
Correct |
58 ms |
2248 KB |
Output is correct |
6 |
Correct |
46 ms |
2048 KB |
Output is correct |
7 |
Correct |
8 ms |
1152 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
12 ms |
1056 KB |
Output is correct |
10 |
Correct |
9 ms |
1056 KB |
Output is correct |
11 |
Correct |
8 ms |
1056 KB |
Output is correct |
12 |
Correct |
9 ms |
1056 KB |
Output is correct |
13 |
Correct |
10 ms |
1024 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
1056 KB |
Output is correct |
2 |
Correct |
8 ms |
1024 KB |
Output is correct |
3 |
Correct |
9 ms |
1088 KB |
Output is correct |
4 |
Correct |
8 ms |
1044 KB |
Output is correct |
5 |
Correct |
10 ms |
1088 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
7 ms |
1056 KB |
Output is correct |
8 |
Correct |
8 ms |
1056 KB |
Output is correct |
9 |
Correct |
8 ms |
1056 KB |
Output is correct |
10 |
Correct |
10 ms |
1056 KB |
Output is correct |
11 |
Correct |
10 ms |
1088 KB |
Output is correct |
12 |
Correct |
13 ms |
1056 KB |
Output is correct |
13 |
Correct |
11 ms |
1056 KB |
Output is correct |
14 |
Correct |
9 ms |
1088 KB |
Output is correct |
15 |
Correct |
9 ms |
1056 KB |
Output is correct |
16 |
Correct |
7 ms |
1024 KB |
Output is correct |
17 |
Correct |
39 ms |
2280 KB |
Output is correct |
18 |
Correct |
98 ms |
2792 KB |
Output is correct |
19 |
Correct |
43 ms |
2120 KB |
Output is correct |
20 |
Correct |
54 ms |
2216 KB |
Output is correct |
21 |
Correct |
58 ms |
2248 KB |
Output is correct |
22 |
Correct |
46 ms |
2048 KB |
Output is correct |
23 |
Correct |
8 ms |
1152 KB |
Output is correct |
24 |
Correct |
2 ms |
384 KB |
Output is correct |
25 |
Correct |
12 ms |
1056 KB |
Output is correct |
26 |
Correct |
9 ms |
1056 KB |
Output is correct |
27 |
Correct |
8 ms |
1056 KB |
Output is correct |
28 |
Correct |
9 ms |
1056 KB |
Output is correct |
29 |
Correct |
10 ms |
1024 KB |
Output is correct |
30 |
Correct |
31 ms |
2016 KB |
Output is correct |
31 |
Correct |
32 ms |
2144 KB |
Output is correct |
32 |
Correct |
54 ms |
2764 KB |
Output is correct |
33 |
Correct |
53 ms |
2176 KB |
Output is correct |
34 |
Correct |
38 ms |
2144 KB |
Output is correct |
35 |
Correct |
47 ms |
2144 KB |
Output is correct |
36 |
Correct |
79 ms |
2920 KB |
Output is correct |
37 |
Correct |
2 ms |
384 KB |
Output is correct |
38 |
Correct |
2 ms |
384 KB |
Output is correct |
39 |
Correct |
33 ms |
2000 KB |
Output is correct |
40 |
Correct |
27 ms |
2000 KB |
Output is correct |
41 |
Correct |
33 ms |
2224 KB |
Output is correct |
42 |
Correct |
36 ms |
2032 KB |
Output is correct |
43 |
Correct |
39 ms |
2072 KB |
Output is correct |
44 |
Correct |
2 ms |
384 KB |
Output is correct |
45 |
Correct |
9 ms |
1120 KB |
Output is correct |
46 |
Correct |
9 ms |
1152 KB |
Output is correct |
47 |
Correct |
9 ms |
1088 KB |
Output is correct |
48 |
Correct |
87 ms |
2792 KB |
Output is correct |
49 |
Correct |
98 ms |
2940 KB |
Output is correct |
50 |
Correct |
2 ms |
384 KB |
Output is correct |
51 |
Correct |
53 ms |
2760 KB |
Output is correct |
52 |
Incorrect |
28 ms |
2000 KB |
Output isn't correct |
53 |
Halted |
0 ms |
0 KB |
- |