oj.uz

Submission #106440

# Submission time Handle Problem Language Result Execution time Memory
106440 2019-04-18T13:39:10 Z Kastanda Travelling Merchant (APIO17_merchant) C++11
100 / 100
 474 ms 3400 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 109, K = 1009;
int n, m, k, B[N][K], S[N][K];
ll D[N][N], dp[N][N];
inline bool Solve(ll md)
{
    memset(dp, -63, sizeof(dp));
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (i != j && D[i][j] <= INT_MAX)
            {
                dp[i][j] = 0;
                for (int h = 1; h <= k; h++)
                    if (B[i][h] != -1 && S[j][h] != -1)
                        dp[i][j] = max(dp[i][j], (ll)S[j][h] - B[i][h]);
                dp[i][j] -= md * D[i][j];
            }
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                dp[i][j] = max(dp[i][j], dp[i][k] + dp[k][j]);
    for (int i = 1; i <= n; i++)
        if (dp[i][i] >= 0)
            return 1;
    return 0;
}
int main()
{
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= k; j++)
            scanf("%d%d", &B[i][j], &S[i][j]);
    memset(D, 63, sizeof(D));
    for (int i = 1, v, u; i <= m; i++)
        scanf("%d%d", &v, &u), scanf("%lld", &D[v][u]);
    for (int i = 1; i <= n; i++)
        D[i][i] = 0;
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
    ll le = 0, ri = 1873428744, md;
    while (ri - le > 1)
    {
        md = (le + ri) >> 1;
        if (Solve(md))
            le = md;
        else
            ri = md;
    }
    return !printf("%lld\n", le);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:34:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d%d", &B[i][j], &S[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:37:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &v, &u), scanf("%lld", &D[v][u]);
         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:37:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 2652 KB Output is correct
2 Correct 52 ms 1280 KB Output is correct
3 Correct 44 ms 1280 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 8 ms 896 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 15 ms 896 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 12 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 768 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 14 ms 896 KB Output is correct
4 Correct 13 ms 896 KB Output is correct
5 Correct 15 ms 1024 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 13 ms 896 KB Output is correct
8 Correct 18 ms 896 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 16 ms 896 KB Output is correct
12 Correct 13 ms 960 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 11 ms 896 KB Output is correct
15 Correct 15 ms 996 KB Output is correct
16 Correct 10 ms 896 KB Output is correct
17 Correct 16 ms 896 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 13 ms 896 KB Output is correct
20 Correct 14 ms 1024 KB Output is correct
21 Correct 14 ms 1152 KB Output is correct
22 Correct 12 ms 896 KB Output is correct
23 Correct 9 ms 896 KB Output is correct
24 Correct 8 ms 896 KB Output is correct
25 Correct 15 ms 896 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 10 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 9 ms 896 KB Output is correct
30 Correct 3 ms 640 KB Output is correct
31 Correct 12 ms 896 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 1464 KB Output is correct
2 Correct 401 ms 3104 KB Output is correct
3 Correct 62 ms 1408 KB Output is correct
4 Correct 121 ms 1536 KB Output is correct
5 Correct 90 ms 1656 KB Output is correct
6 Correct 57 ms 1408 KB Output is correct
7 Correct 16 ms 896 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 13 ms 896 KB Output is correct
10 Correct 14 ms 1024 KB Output is correct
11 Correct 14 ms 1152 KB Output is correct
12 Correct 12 ms 896 KB Output is correct
13 Correct 9 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 768 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 14 ms 896 KB Output is correct
4 Correct 13 ms 896 KB Output is correct
5 Correct 15 ms 1024 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 13 ms 896 KB Output is correct
8 Correct 18 ms 896 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 16 ms 896 KB Output is correct
12 Correct 13 ms 960 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 11 ms 896 KB Output is correct
15 Correct 15 ms 996 KB Output is correct
16 Correct 10 ms 896 KB Output is correct
17 Correct 91 ms 1464 KB Output is correct
18 Correct 401 ms 3104 KB Output is correct
19 Correct 62 ms 1408 KB Output is correct
20 Correct 121 ms 1536 KB Output is correct
21 Correct 90 ms 1656 KB Output is correct
22 Correct 57 ms 1408 KB Output is correct
23 Correct 16 ms 896 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 13 ms 896 KB Output is correct
26 Correct 14 ms 1024 KB Output is correct
27 Correct 14 ms 1152 KB Output is correct
28 Correct 12 ms 896 KB Output is correct
29 Correct 9 ms 896 KB Output is correct
30 Correct 53 ms 1336 KB Output is correct
31 Correct 91 ms 1408 KB Output is correct
32 Correct 362 ms 1844 KB Output is correct
33 Correct 107 ms 1380 KB Output is correct
34 Correct 88 ms 1396 KB Output is correct
35 Correct 86 ms 1400 KB Output is correct
36 Correct 443 ms 3280 KB Output is correct
37 Correct 2 ms 640 KB Output is correct
38 Correct 3 ms 640 KB Output is correct
39 Correct 57 ms 1280 KB Output is correct
40 Correct 57 ms 1408 KB Output is correct
41 Correct 71 ms 1352 KB Output is correct
42 Correct 56 ms 1280 KB Output is correct
43 Correct 64 ms 1280 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 19 ms 1024 KB Output is correct
46 Correct 17 ms 1024 KB Output is correct
47 Correct 14 ms 1024 KB Output is correct
48 Correct 445 ms 3400 KB Output is correct
49 Correct 474 ms 3320 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 329 ms 2652 KB Output is correct
52 Correct 52 ms 1280 KB Output is correct
53 Correct 44 ms 1280 KB Output is correct
54 Correct 9 ms 896 KB Output is correct
55 Correct 8 ms 896 KB Output is correct
56 Correct 8 ms 896 KB Output is correct
57 Correct 15 ms 896 KB Output is correct
58 Correct 2 ms 512 KB Output is correct
59 Correct 10 ms 896 KB Output is correct
60 Correct 11 ms 896 KB Output is correct
61 Correct 9 ms 896 KB Output is correct
62 Correct 3 ms 640 KB Output is correct
63 Correct 12 ms 896 KB Output is correct