oj.uz

Submission #107406

# Submission time Handle Problem Language Result Execution time Memory
107406 2019-04-24T05:55:43 Z kuroni Travelling Merchant (APIO17_merchant) C++14
100 / 100
 126 ms 1500 KB 
#include <iostream>
#include <cstdio>
using namespace std;

const int N = 105, K = 1005;
const long long INF = 4E18 + 7;

int n, m, k, u, v, w[N][N], b[N][K], s[N][K];
long long dis[N][N], tmp[N][N];

bool floyd(long long dis[N][N])
{
    for (int mi = 1; mi <= n; mi++)
        for (int le = 1; le <= n; le++)
            for (int ri = 1; ri <= n; ri++)
                dis[le][ri] = min(dis[le][ri], max(-INF, dis[le][mi] + dis[mi][ri]));
    for (int st = 1; st <= n; st++)
        for (int mi = st + 1; mi <= n; mi++)
            if (dis[st][mi] + dis[mi][st] <= 0)
                return true;
    return false;
}

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]);
        for (int j = 1; j <= n; j++)
            if (j != i)
                dis[i][j] = INF;
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            for (int t = 1; t <= k; t++)
                if (b[i][t] != -1 && s[j][t] != -1)
                    w[i][j] = max(w[i][j], s[j][t] - b[i][t]);
    while (m--)
    {
        scanf("%d%d", &u, &v);
        scanf("%lld", &dis[u][v]);
    }
    floyd(dis);
    int le = 1, ri = 1E9;
    while (le <= ri)
    {
        int mi = (le + ri) / 2;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (dis[i][j] == INF)
                    tmp[i][j] = INF;
                else
                    tmp[i][j] = dis[i][j] * mi - w[i][j];
        if (floyd(tmp))
            le = mi + 1;
        else
            ri = mi - 1;
    }
    printf("%d", ri);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:26: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:30: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:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~
merchant.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &dis[u][v]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 1280 KB Output is correct
2 Correct 46 ms 1280 KB Output is correct
3 Correct 50 ms 1280 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 8 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 768 KB Output is correct
2 Correct 9 ms 768 KB Output is correct
3 Correct 14 ms 768 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 9 ms 768 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 8 ms 768 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 10 ms 868 KB Output is correct
12 Correct 9 ms 768 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 12 ms 896 KB Output is correct
15 Correct 13 ms 768 KB Output is correct
16 Correct 12 ms 896 KB Output is correct
17 Correct 9 ms 896 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 9 ms 868 KB Output is correct
20 Correct 11 ms 896 KB Output is correct
21 Correct 11 ms 896 KB Output is correct
22 Correct 9 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 8 ms 896 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 8 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 8 ms 896 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 1364 KB Output is correct
2 Correct 98 ms 1400 KB Output is correct
3 Correct 43 ms 1380 KB Output is correct
4 Correct 47 ms 1280 KB Output is correct
5 Correct 53 ms 1372 KB Output is correct
6 Correct 48 ms 1280 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 9 ms 868 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 9 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 9 ms 768 KB Output is correct
2 Correct 9 ms 768 KB Output is correct
3 Correct 14 ms 768 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 9 ms 768 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 8 ms 768 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 10 ms 868 KB Output is correct
12 Correct 9 ms 768 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 12 ms 896 KB Output is correct
15 Correct 13 ms 768 KB Output is correct
16 Correct 12 ms 896 KB Output is correct
17 Correct 52 ms 1364 KB Output is correct
18 Correct 98 ms 1400 KB Output is correct
19 Correct 43 ms 1380 KB Output is correct
20 Correct 47 ms 1280 KB Output is correct
21 Correct 53 ms 1372 KB Output is correct
22 Correct 48 ms 1280 KB Output is correct
23 Correct 9 ms 896 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 9 ms 868 KB Output is correct
26 Correct 11 ms 896 KB Output is correct
27 Correct 11 ms 896 KB Output is correct
28 Correct 9 ms 896 KB Output is correct
29 Correct 9 ms 896 KB Output is correct
30 Correct 47 ms 1280 KB Output is correct
31 Correct 65 ms 1408 KB Output is correct
32 Correct 63 ms 1400 KB Output is correct
33 Correct 48 ms 1400 KB Output is correct
34 Correct 56 ms 1408 KB Output is correct
35 Correct 50 ms 1500 KB Output is correct
36 Correct 116 ms 1400 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 65 ms 1280 KB Output is correct
40 Correct 49 ms 1408 KB Output is correct
41 Correct 48 ms 1400 KB Output is correct
42 Correct 57 ms 1280 KB Output is correct
43 Correct 52 ms 1400 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 11 ms 768 KB Output is correct
46 Correct 11 ms 768 KB Output is correct
47 Correct 14 ms 768 KB Output is correct
48 Correct 126 ms 1480 KB Output is correct
49 Correct 106 ms 1408 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 68 ms 1280 KB Output is correct
52 Correct 46 ms 1280 KB Output is correct
53 Correct 50 ms 1280 KB Output is correct
54 Correct 10 ms 896 KB Output is correct
55 Correct 9 ms 896 KB Output is correct
56 Correct 8 ms 896 KB Output is correct
57 Correct 8 ms 896 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 8 ms 896 KB Output is correct
60 Correct 11 ms 896 KB Output is correct
61 Correct 11 ms 896 KB Output is correct
62 Correct 2 ms 512 KB Output is correct
63 Correct 8 ms 896 KB Output is correct