oj.uz

Submission #704705

# Submission time Handle Problem Language Result Execution time Memory
704705 2023-03-02T17:05:34 Z four_specks Travelling Merchant (APIO17_merchant) C++17
100 / 100
 86 ms 4428 KB 
#include <bits/stdc++.h>

using namespace std;

namespace
{
} // namespace

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;

    vector a(n, vector<array<long, 2>>(k));
    for (int u = 0; u < n; u++)
    {
        for (auto &[x, y] : a[u])
            cin >> x >> y;
    }

    vector<tuple<int, int, long>> edges(m);
    for (auto &[u, v, w] : edges)
        cin >> u >> v >> w, --u, --v;

    vector util(n, vector<long>(n));
    for (int u = 0; u < n; u++)
    {
        for (int v = 0; v < n; v++)
        {
            for (int i = 0; i < k; i++)
            {
                if (min(a[u][i][0], a[v][i][1]) != -1)
                    util[u][v] = max(util[u][v], a[v][i][1] - a[u][i][0]);
            }
        }
    }

    vector dist(n, vector<long>(n, 1l << 30));
    for (auto [u, v, w] : edges)
        dist[u][v] = w;
    for (int s = 0; s < n; s++)
    {
        for (int u = 0; u < n; u++)
        {
            for (int v = 0; v < n; v++)
                dist[u][v] = min(dist[u][v], dist[u][s] + dist[s][v]);
        }
    }

    auto check = [&](long mid) -> bool
    {
        vector dp(n, vector<long>(n));
        for (int u = 0; u < n; u++)
        {
            for (int v = 0; v < n; v++)
                dp[u][v] = util[u][v] - mid * dist[u][v];
        }
        for (int s = 0; s < n; s++)
        {
            for (int u = 0; u < n; u++)
            {
                for (int v = 0; v < n; v++)
                    dp[u][v] = max(dp[u][v], dp[u][s] + dp[s][v]);
            }
        }

        for (int u = 0; u < n; u++)
        {
            if (dp[u][u] >= 0)
                return 1;
        }

        return 0;
    };

    long lo = 0, hi = 1l << 30;
    while (lo < hi)
    {
        long mid = (lo + hi + 1) / 2;
        if (check(mid))
            lo = mid;
        else
            hi = mid - 1;
    }

    cout << lo << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(NULL);

    solve();

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 3244 KB Output is correct
2 Correct 29 ms 580 KB Output is correct
3 Correct 29 ms 580 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 7 ms 340 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 7 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 400 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 5 ms 488 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 5 ms 408 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 5 ms 324 KB Output is correct
18 Correct 5 ms 336 KB Output is correct
19 Correct 5 ms 468 KB Output is correct
20 Correct 6 ms 468 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 5 ms 328 KB Output is correct
23 Correct 6 ms 528 KB Output is correct
24 Correct 5 ms 340 KB Output is correct
25 Correct 7 ms 468 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 5 ms 460 KB Output is correct
28 Correct 6 ms 468 KB Output is correct
29 Correct 5 ms 468 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 5 ms 340 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 468 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 6 ms 468 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 34 ms 724 KB Output is correct
9 Correct 79 ms 3792 KB Output is correct
10 Correct 31 ms 716 KB Output is correct
11 Correct 39 ms 924 KB Output is correct
12 Correct 37 ms 852 KB Output is correct
13 Correct 34 ms 712 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 5 ms 400 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 5 ms 488 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 5 ms 408 KB Output is correct
8 Correct 7 ms 340 KB Output is correct
9 Correct 5 ms 324 KB Output is correct
10 Correct 5 ms 336 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 5 ms 328 KB Output is correct
15 Correct 6 ms 528 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 34 ms 724 KB Output is correct
18 Correct 79 ms 3792 KB Output is correct
19 Correct 31 ms 716 KB Output is correct
20 Correct 39 ms 924 KB Output is correct
21 Correct 37 ms 852 KB Output is correct
22 Correct 34 ms 712 KB Output is correct
23 Correct 7 ms 468 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 5 ms 460 KB Output is correct
26 Correct 6 ms 468 KB Output is correct
27 Correct 5 ms 468 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 5 ms 340 KB Output is correct
30 Correct 54 ms 3244 KB Output is correct
31 Correct 29 ms 580 KB Output is correct
32 Correct 29 ms 580 KB Output is correct
33 Correct 4 ms 340 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 5 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 5 ms 340 KB Output is correct
39 Correct 4 ms 340 KB Output is correct
40 Correct 4 ms 340 KB Output is correct
41 Correct 1 ms 320 KB Output is correct
42 Correct 7 ms 340 KB Output is correct
43 Correct 31 ms 600 KB Output is correct
44 Correct 32 ms 796 KB Output is correct
45 Correct 46 ms 2308 KB Output is correct
46 Correct 34 ms 720 KB Output is correct
47 Correct 45 ms 812 KB Output is correct
48 Correct 47 ms 724 KB Output is correct
49 Correct 85 ms 4060 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 30 ms 616 KB Output is correct
53 Correct 32 ms 852 KB Output is correct
54 Correct 32 ms 552 KB Output is correct
55 Correct 31 ms 596 KB Output is correct
56 Correct 33 ms 596 KB Output is correct
57 Correct 0 ms 216 KB Output is correct
58 Correct 6 ms 552 KB Output is correct
59 Correct 7 ms 468 KB Output is correct
60 Correct 7 ms 464 KB Output is correct
61 Correct 86 ms 4428 KB Output is correct
62 Correct 83 ms 4316 KB Output is correct
63 Correct 1 ms 212 KB Output is correct