oj.uz

Submission #436824

# Submission time Handle Problem Language Result Execution time Memory
436824 2021-06-25T02:22:55 Z Lam_lai_cuoc_doi Travelling Merchant (APIO17_merchant) C++17
100 / 100
 257 ms 4332 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

constexpr bool typetest = 0;
constexpr int N = 1e2 + 5;
constexpr ll Inf = 1e17;

ll w[N][N], b[N][N * 10], s[N][N * 10], d[N][N];
ll dp[N][N];
int n, m, k;

void Read()
{
    cin >> n >> m >> k;

    fill_n(&w[0][0], N * N, Inf);

    for (int i = 1; i <= n; ++i)
    {
        w[i][i] = 0;

        for (int j = 1; j <= k; ++j)
            cin >> b[i][j] >> s[i][j];
    }

    for (int i = 1; i <= m; ++i)
    {
        int u, v;

        cin >> u >> v;
        cin >> w[u][v];
    }
}

void Floyd()
{
    for (int k = 1; k <= n; ++k)
        for (int u = 1; u <= n; ++u)
            for (int v = 1; v <= n; ++v)
                w[u][v] = min(w[u][v], w[u][k] + w[k][v]);

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            for (int t = 1; t <= k; ++t)
                if (s[j][t] != -1 && b[i][t] != -1)
                    d[i][j] = max(d[i][j], s[j][t] - b[i][t]);
}

bool Check(ll v)
{
    fill_n(&dp[0][0], N * N, Inf);

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            dp[i][j] = v * min(w[i][j], Inf / v) - d[i][j];

    for (int k = 1; k <= n; ++k)
        for (int u = 1; u <= n; ++u)
            for (int v = 1; v <= n; ++v)
                dp[u][v] = max(-Inf, min(dp[u][v], dp[u][k] + dp[k][v]));

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            if (i != j && dp[i][j] < Inf && dp[j][i] < Inf && dp[i][j] + dp[j][i] <= 0)
                return true;

    return false;
}

void Solve()
{
    Floyd();

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            if (i != j && w[i][j] < Inf && w[j][i] < Inf)
                goto done;
    cout << 0;
    return;

done:;

    ll l = 1, mid, h = Inf;

    while (l <= h)
    {
        mid = (l + h) / 2;

        if (Check(mid))
            l = mid + 1;
        else
            h = mid - 1;
    }

    cout << h;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t(1);
    if (typetest)
        cin >> t;
    for (int _ = 1; _ <= t; ++_)
    {
        Read();
        Solve();
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 2120 KB Output is correct
2 Correct 82 ms 1216 KB Output is correct
3 Correct 80 ms 1296 KB Output is correct
4 Correct 12 ms 844 KB Output is correct
5 Correct 12 ms 892 KB Output is correct
6 Correct 12 ms 892 KB Output is correct
7 Correct 14 ms 932 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 14 ms 844 KB Output is correct
10 Correct 13 ms 844 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 13 ms 932 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 892 KB Output is correct
2 Correct 14 ms 932 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 14 ms 844 KB Output is correct
5 Correct 13 ms 844 KB Output is correct
6 Correct 12 ms 896 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 13 ms 932 KB Output is correct
9 Correct 14 ms 948 KB Output is correct
10 Correct 13 ms 944 KB Output is correct
11 Correct 13 ms 976 KB Output is correct
12 Correct 12 ms 844 KB Output is correct
13 Correct 26 ms 972 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 16 ms 844 KB Output is correct
16 Correct 16 ms 972 KB Output is correct
17 Correct 12 ms 844 KB Output is correct
18 Correct 13 ms 960 KB Output is correct
19 Correct 15 ms 972 KB Output is correct
20 Correct 18 ms 972 KB Output is correct
21 Correct 13 ms 932 KB Output is correct
22 Correct 15 ms 944 KB Output is correct
23 Correct 15 ms 972 KB Output is correct
24 Correct 12 ms 924 KB Output is correct
25 Correct 31 ms 972 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 30 ms 972 KB Output is correct
28 Correct 19 ms 972 KB Output is correct
29 Correct 20 ms 976 KB Output is correct
30 Correct 15 ms 896 KB Output is correct
31 Correct 15 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 972 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 30 ms 972 KB Output is correct
4 Correct 19 ms 972 KB Output is correct
5 Correct 20 ms 976 KB Output is correct
6 Correct 15 ms 896 KB Output is correct
7 Correct 15 ms 844 KB Output is correct
8 Correct 200 ms 1508 KB Output is correct
9 Correct 257 ms 2456 KB Output is correct
10 Correct 135 ms 1496 KB Output is correct
11 Correct 149 ms 1724 KB Output is correct
12 Correct 203 ms 1720 KB Output is correct
13 Correct 100 ms 1484 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 948 KB Output is correct
2 Correct 13 ms 944 KB Output is correct
3 Correct 13 ms 976 KB Output is correct
4 Correct 12 ms 844 KB Output is correct
5 Correct 26 ms 972 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 16 ms 844 KB Output is correct
8 Correct 16 ms 972 KB Output is correct
9 Correct 12 ms 844 KB Output is correct
10 Correct 13 ms 960 KB Output is correct
11 Correct 15 ms 972 KB Output is correct
12 Correct 18 ms 972 KB Output is correct
13 Correct 13 ms 932 KB Output is correct
14 Correct 15 ms 944 KB Output is correct
15 Correct 15 ms 972 KB Output is correct
16 Correct 12 ms 924 KB Output is correct
17 Correct 200 ms 1508 KB Output is correct
18 Correct 257 ms 2456 KB Output is correct
19 Correct 135 ms 1496 KB Output is correct
20 Correct 149 ms 1724 KB Output is correct
21 Correct 203 ms 1720 KB Output is correct
22 Correct 100 ms 1484 KB Output is correct
23 Correct 31 ms 972 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 30 ms 972 KB Output is correct
26 Correct 19 ms 972 KB Output is correct
27 Correct 20 ms 976 KB Output is correct
28 Correct 15 ms 896 KB Output is correct
29 Correct 15 ms 844 KB Output is correct
30 Correct 141 ms 2120 KB Output is correct
31 Correct 82 ms 1216 KB Output is correct
32 Correct 80 ms 1296 KB Output is correct
33 Correct 12 ms 844 KB Output is correct
34 Correct 12 ms 892 KB Output is correct
35 Correct 12 ms 892 KB Output is correct
36 Correct 14 ms 932 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 14 ms 844 KB Output is correct
39 Correct 13 ms 844 KB Output is correct
40 Correct 12 ms 896 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 13 ms 932 KB Output is correct
43 Correct 85 ms 1356 KB Output is correct
44 Correct 103 ms 1584 KB Output is correct
45 Correct 132 ms 2684 KB Output is correct
46 Correct 86 ms 1484 KB Output is correct
47 Correct 82 ms 1484 KB Output is correct
48 Correct 89 ms 1588 KB Output is correct
49 Correct 172 ms 4164 KB Output is correct
50 Correct 2 ms 460 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 80 ms 1356 KB Output is correct
53 Correct 82 ms 1356 KB Output is correct
54 Correct 85 ms 1364 KB Output is correct
55 Correct 111 ms 1388 KB Output is correct
56 Correct 82 ms 1228 KB Output is correct
57 Correct 1 ms 460 KB Output is correct
58 Correct 22 ms 1064 KB Output is correct
59 Correct 18 ms 1100 KB Output is correct
60 Correct 19 ms 1100 KB Output is correct
61 Correct 178 ms 4260 KB Output is correct
62 Correct 165 ms 4332 KB Output is correct
63 Correct 2 ms 460 KB Output is correct