oj.uz

Submission #568504

# Submission time Handle Problem Language Result Execution time Memory
568504 2022-05-25T15:31:59 Z Ooops_sorry Travelling Merchant (APIO17_merchant) C++14
100 / 100
 75 ms 3412 KB 
#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define ld double
#define ll long long

mt19937 rnd(51);

const int N = 110, K = 1010, INF = 1e9;
ll d[N][N];
int b[N][K], s[N][K], mx[N][N], n, m, k;
vector<pair<int,ll>> g[N];

bool solve(int mid) {
    for (int i = 0; i < N; i++) g[i].clear();
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i != j) {
                g[i].pb({j, (ll)mx[i][j] - mid * d[i][j]});
            }
        }
    }
    vector<ll> d(n);
    vector<bool> a(n, 1);
    for (int i = 0; i <= n; i++) {
        bool ok = 0;
        vector<bool> b(n);
        for (int j = 0; j < n; j++) {
            if (!a[j]) continue;
            for (auto to : g[j]) {
                if (d[j] + to.second >= d[to.first]) {
                    d[to.first] = d[j] + to.second;
                    ok = 1;
                    b[to.first] = 1;
                }
            }
        }
        swap(a, b);
        if (i == n) return ok;
    }
}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            d[i][j] = INF;
        }
        d[i][i] = 0;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            cin >> b[i][j] >> s[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            mx[i][j] = 0;
            for (int f = 0; f < k; f++) {
                if (b[i][f] == -1 || s[j][f] == -1) continue;
                mx[i][j] = max(mx[i][j], s[j][f] - b[i][f]);
            }
        }
    }
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        d[a][b] = c;
    }
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }
    int l = 0, r = INF;
    while (r - l > 1) {
        int mid = (r + l) / 2;
        if (solve(mid)) {
            l = mid;
        } else {
            r = mid;
        }
    }
    cout << l << endl;
    return 0;
}

Compilation message

merchant.cpp: In function 'bool solve(int)':
merchant.cpp:25:19: warning: control reaches end of non-void function [-Wreturn-type]
   25 |     vector<ll> d(n);
      |                   ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 2684 KB Output is correct
2 Correct 8 ms 1364 KB Output is correct
3 Correct 67 ms 1456 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 7 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 11 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 7 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 11 ms 852 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 5 ms 868 KB Output is correct
12 Correct 3 ms 736 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 3 ms 852 KB Output is correct
16 Correct 3 ms 868 KB Output is correct
17 Correct 3 ms 852 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 4 ms 852 KB Output is correct
20 Correct 5 ms 864 KB Output is correct
21 Correct 4 ms 872 KB Output is correct
22 Correct 3 ms 860 KB Output is correct
23 Correct 5 ms 852 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 4 ms 852 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 11 ms 980 KB Output is correct
28 Correct 7 ms 852 KB Output is correct
29 Correct 5 ms 904 KB Output is correct
30 Correct 4 ms 852 KB Output is correct
31 Correct 3 ms 856 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 11 ms 980 KB Output is correct
4 Correct 7 ms 852 KB Output is correct
5 Correct 5 ms 904 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 27 ms 1492 KB Output is correct
9 Correct 67 ms 3232 KB Output is correct
10 Correct 19 ms 1556 KB Output is correct
11 Correct 21 ms 1620 KB Output is correct
12 Correct 51 ms 1660 KB Output is correct
13 Correct 14 ms 1556 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 5 ms 868 KB Output is correct
4 Correct 3 ms 736 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 852 KB Output is correct
8 Correct 3 ms 868 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 5 ms 864 KB Output is correct
13 Correct 4 ms 872 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 5 ms 852 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 27 ms 1492 KB Output is correct
18 Correct 67 ms 3232 KB Output is correct
19 Correct 19 ms 1556 KB Output is correct
20 Correct 21 ms 1620 KB Output is correct
21 Correct 51 ms 1660 KB Output is correct
22 Correct 14 ms 1556 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 11 ms 980 KB Output is correct
26 Correct 7 ms 852 KB Output is correct
27 Correct 5 ms 904 KB Output is correct
28 Correct 4 ms 852 KB Output is correct
29 Correct 3 ms 856 KB Output is correct
30 Correct 30 ms 2684 KB Output is correct
31 Correct 8 ms 1364 KB Output is correct
32 Correct 67 ms 1456 KB Output is correct
33 Correct 2 ms 852 KB Output is correct
34 Correct 3 ms 852 KB Output is correct
35 Correct 2 ms 852 KB Output is correct
36 Correct 7 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 11 ms 852 KB Output is correct
39 Correct 3 ms 852 KB Output is correct
40 Correct 4 ms 852 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 13 ms 1364 KB Output is correct
44 Correct 18 ms 1472 KB Output is correct
45 Correct 37 ms 1940 KB Output is correct
46 Correct 19 ms 1500 KB Output is correct
47 Correct 18 ms 1492 KB Output is correct
48 Correct 17 ms 1492 KB Output is correct
49 Correct 75 ms 3344 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 15 ms 1480 KB Output is correct
53 Correct 11 ms 1504 KB Output is correct
54 Correct 10 ms 1504 KB Output is correct
55 Correct 18 ms 1364 KB Output is correct
56 Correct 17 ms 1380 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 5 ms 908 KB Output is correct
59 Correct 5 ms 908 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 68 ms 3408 KB Output is correct
62 Correct 73 ms 3412 KB Output is correct
63 Correct 1 ms 340 KB Output is correct