oj.uz

Submission #409312

# Submission time Handle Problem Language Result Execution time Memory
409312 2021-05-20T14:43:19 Z tranxuanbach Travelling Merchant (APIO17_merchant) C++17
100 / 100
 159 ms 3472 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(i, l, r) for (int i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <pii> vpii;
typedef vector <vi> vvi;

const int N = 1e2 + 5, K = 1e3 + 5, inf = 1e9 + 7;
const ll infll = (ld)1e18 + 7;

int n, m, k;
int b[N][K], s[N][K];
ll adj[N][N];

ll dist[N][N];

void floyd_warshall(){
    ForE(k, 1, n){
        ForE(i, 1, n){
            ForE(j, 1, n){
                if (dist[i][j] > dist[i][k] + dist[k][j]){
                    dist[i][j] = dist[i][k] + dist[k][j];
                }
            }
        }
    }
}

int profit[N][N];

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("KEK.inp", "r", stdin);
    // freopen("KEK.out", "w", stdout);
    cin >> n >> m >> k;
    ForE(i, 1, n){
        ForE(j, 1, k){
            cin >> b[i][j] >> s[i][j];
        }
    }
    ForE(i, 1, n){
        ForE(j, 1, n){
            adj[i][j] = infll;
        }
    }
    ForE(i, 1, m){
        int u, v, w; cin >> u >> v >> w;
        adj[u][v] = w;
    }
    ForE(i, 1, n){
        ForE(j, 1, n){
            dist[i][j] = adj[i][j];
        }
    }
    floyd_warshall();
    ForE(i, 1, n){
        ForE(j, 1, n){
            adj[i][j] = dist[i][j];
        }
    }
    ForE(i, 1, n){
        ForE(j, 1, n){
            ForE(kk, 1, k){
                if (b[i][kk] != -1 and s[j][kk] != -1){
                    profit[i][j] = max(profit[i][j], s[j][kk] - b[i][kk]);
                }
            }
        }
    }
    int lo = 0, hi = inf;
    while (lo < hi){
        int mid = (lo + hi + 1) >> 1;
        ForE(i, 1, n){
            ForE(j, 1, n){
                dist[i][j] = (ll)mid * min(adj[i][j], infll / mid) - profit[i][j];
            }
        }
        floyd_warshall();
        bool ck = 0;
        ForE(i, 1, n){
            if (dist[i][i] <= 0){
                ck = 1;
            }
        }
        if (ck){
            lo = mid;
        }
        else{
            hi = mid - 1;
        }
    }
    cout << lo << endl;
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 1200 KB Output is correct
2 Correct 35 ms 1252 KB Output is correct
3 Correct 37 ms 1252 KB Output is correct
4 Correct 6 ms 800 KB Output is correct
5 Correct 6 ms 804 KB Output is correct
6 Correct 6 ms 800 KB Output is correct
7 Correct 8 ms 716 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 716 KB Output is correct
10 Correct 7 ms 804 KB Output is correct
11 Correct 6 ms 716 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 6 ms 716 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 800 KB Output is correct
2 Correct 8 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 7 ms 804 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 6 ms 716 KB Output is correct
9 Correct 7 ms 716 KB Output is correct
10 Correct 6 ms 716 KB Output is correct
11 Correct 7 ms 716 KB Output is correct
12 Correct 6 ms 716 KB Output is correct
13 Correct 12 ms 828 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 6 ms 716 KB Output is correct
16 Correct 7 ms 716 KB Output is correct
17 Correct 7 ms 824 KB Output is correct
18 Correct 7 ms 824 KB Output is correct
19 Correct 9 ms 824 KB Output is correct
20 Correct 9 ms 824 KB Output is correct
21 Correct 6 ms 716 KB Output is correct
22 Correct 8 ms 716 KB Output is correct
23 Correct 9 ms 716 KB Output is correct
24 Correct 6 ms 824 KB Output is correct
25 Correct 15 ms 716 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 15 ms 716 KB Output is correct
28 Correct 10 ms 716 KB Output is correct
29 Correct 9 ms 716 KB Output is correct
30 Correct 7 ms 716 KB Output is correct
31 Correct 8 ms 820 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 716 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 15 ms 716 KB Output is correct
4 Correct 10 ms 716 KB Output is correct
5 Correct 9 ms 716 KB Output is correct
6 Correct 7 ms 716 KB Output is correct
7 Correct 8 ms 820 KB Output is correct
8 Correct 95 ms 1228 KB Output is correct
9 Correct 159 ms 1304 KB Output is correct
10 Correct 78 ms 1228 KB Output is correct
11 Correct 104 ms 1304 KB Output is correct
12 Correct 102 ms 1516 KB Output is correct
13 Correct 51 ms 1356 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 716 KB Output is correct
2 Correct 6 ms 716 KB Output is correct
3 Correct 7 ms 716 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 12 ms 828 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 716 KB Output is correct
8 Correct 7 ms 716 KB Output is correct
9 Correct 7 ms 824 KB Output is correct
10 Correct 7 ms 824 KB Output is correct
11 Correct 9 ms 824 KB Output is correct
12 Correct 9 ms 824 KB Output is correct
13 Correct 6 ms 716 KB Output is correct
14 Correct 8 ms 716 KB Output is correct
15 Correct 9 ms 716 KB Output is correct
16 Correct 6 ms 824 KB Output is correct
17 Correct 95 ms 1228 KB Output is correct
18 Correct 159 ms 1304 KB Output is correct
19 Correct 78 ms 1228 KB Output is correct
20 Correct 104 ms 1304 KB Output is correct
21 Correct 102 ms 1516 KB Output is correct
22 Correct 51 ms 1356 KB Output is correct
23 Correct 15 ms 716 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 15 ms 716 KB Output is correct
26 Correct 10 ms 716 KB Output is correct
27 Correct 9 ms 716 KB Output is correct
28 Correct 7 ms 716 KB Output is correct
29 Correct 8 ms 820 KB Output is correct
30 Correct 69 ms 1200 KB Output is correct
31 Correct 35 ms 1252 KB Output is correct
32 Correct 37 ms 1252 KB Output is correct
33 Correct 6 ms 800 KB Output is correct
34 Correct 6 ms 804 KB Output is correct
35 Correct 6 ms 800 KB Output is correct
36 Correct 8 ms 716 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 6 ms 716 KB Output is correct
39 Correct 7 ms 804 KB Output is correct
40 Correct 6 ms 716 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 44 ms 1224 KB Output is correct
44 Correct 42 ms 1384 KB Output is correct
45 Correct 64 ms 1764 KB Output is correct
46 Correct 40 ms 1356 KB Output is correct
47 Correct 39 ms 1392 KB Output is correct
48 Correct 39 ms 1356 KB Output is correct
49 Correct 127 ms 3248 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 316 KB Output is correct
52 Correct 37 ms 1228 KB Output is correct
53 Correct 38 ms 1420 KB Output is correct
54 Correct 40 ms 1348 KB Output is correct
55 Correct 37 ms 1316 KB Output is correct
56 Correct 38 ms 1228 KB Output is correct
57 Correct 1 ms 324 KB Output is correct
58 Correct 10 ms 844 KB Output is correct
59 Correct 10 ms 844 KB Output is correct
60 Correct 9 ms 928 KB Output is correct
61 Correct 109 ms 3472 KB Output is correct
62 Correct 110 ms 3268 KB Output is correct
63 Correct 1 ms 332 KB Output is correct