oj.uz

Submission #57392

# Submission time Handle Problem Language Result Execution time Memory
57392 2018-07-14T19:34:50 Z gabrielsimoes Travelling Merchant (APIO17_merchant) C++17
100 / 100
 201 ms 2428 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int MAXN = 101, MAXM = 9901, MAXK = 1001;
int N, M, K;
ll buy[MAXN][MAXK];
ll sell[MAXN][MAXK];

ll maxAns = 0;

bool reaches[MAXN][MAXN];
ll d[MAXN][MAXN];
ll gain[MAXN][MAXN];
ll dist[MAXN][MAXN];
bool ok[MAXN];

bool testPosCycle(ll x) {
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            dist[i][j] = gain[i][j] - x * d[i][j];
        }
    }

    for (int k = 1; k <= N; k++) {
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                if (i != j && reaches[i][k] && reaches[k][j]) {
                    dist[i][j] = max(dist[i][j], dist[i][k] + dist[k][j]);
                }
            }
        }
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            if (i != j && reaches[i][j] && reaches[j][i] && dist[i][j] + dist[j][i] >= 0) {
                return true;
            }
        }
    }

    return false;
}

int main() {
    scanf("%d%d%d", &N, &M, &K);
    for (int i = 1; i <= N; i++) {
        for (int k = 1; k <= K; k++) {
            scanf("%lld%lld", &buy[i][k], &sell[i][k]);
        }
    }

    for (int i = 1,a,b,c; i <= M; i++) {
        scanf("%d%d%d", &a, &b, &c);
        d[a][b] = c;
        reaches[a][b] = true;
    }

    for (int k = 1; k <= N; k++) {
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                if (i != j && reaches[i][k] && reaches[k][j]) {
                    if (!reaches[i][j]) {
                        reaches[i][j] = true;
                        d[i][j] = d[i][k] + d[k][j];
                    } else {
                        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
                    }
                }
            }
        }
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            for (int k = 1; k <= K; k++) {
                if (buy[i][k] != -1 && sell[j][k] != -1) {
                    gain[i][j] = max(gain[i][j], -buy[i][k] + sell[j][k]);
                }
            }
        }
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            if (i != j && reaches[i][j] && reaches[j][i]) {
                maxAns = max(maxAns, gain[i][j] + gain[j][i]);
            }
        }
    }

    ll l = 0, r = maxAns;
    while (l < r) {
        ll m = (l + r + 1LL) >> 1;
        if (testPosCycle(m)) l = m;
        else r = m-1;
    }

    printf("%lld\n", l);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:48: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:51:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%lld%lld", &buy[i][k], &sell[i][k]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:56:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 2136 KB Output is correct
2 Correct 98 ms 2136 KB Output is correct
3 Correct 115 ms 2136 KB Output is correct
4 Correct 13 ms 2136 KB Output is correct
5 Correct 13 ms 2136 KB Output is correct
6 Correct 3 ms 2136 KB Output is correct
7 Correct 19 ms 2136 KB Output is correct
8 Correct 3 ms 2136 KB Output is correct
9 Correct 20 ms 2136 KB Output is correct
10 Correct 16 ms 2136 KB Output is correct
11 Correct 17 ms 2136 KB Output is correct
12 Correct 2 ms 2136 KB Output is correct
13 Correct 6 ms 2136 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 2136 KB Output is correct
2 Correct 149 ms 2428 KB Output is correct
3 Correct 97 ms 2428 KB Output is correct
4 Correct 117 ms 2428 KB Output is correct
5 Correct 100 ms 2428 KB Output is correct
6 Correct 99 ms 2428 KB Output is correct
7 Correct 10 ms 2136 KB Output is correct
8 Correct 2 ms 2136 KB Output is correct
9 Correct 20 ms 2136 KB Output is correct
10 Correct 19 ms 2136 KB Output is correct
11 Correct 15 ms 2136 KB Output is correct
12 Correct 17 ms 2136 KB Output is correct
13 Correct 14 ms 2136 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2136 KB Output is correct
2 Correct 15 ms 2136 KB Output is correct
3 Correct 10 ms 2136 KB Output is correct
4 Correct 11 ms 2136 KB Output is correct
5 Correct 18 ms 2136 KB Output is correct
6 Correct 3 ms 2136 KB Output is correct
7 Correct 10 ms 2136 KB Output is correct
8 Correct 8 ms 2136 KB Output is correct
9 Correct 10 ms 2136 KB Output is correct
10 Correct 13 ms 2136 KB Output is correct
11 Correct 17 ms 2136 KB Output is correct
12 Correct 16 ms 2136 KB Output is correct
13 Correct 14 ms 2136 KB Output is correct
14 Correct 16 ms 2136 KB Output is correct
15 Correct 15 ms 2136 KB Output is correct
16 Correct 16 ms 2136 KB Output is correct
17 Correct 62 ms 2136 KB Output is correct
18 Correct 149 ms 2428 KB Output is correct
19 Correct 97 ms 2428 KB Output is correct
20 Correct 117 ms 2428 KB Output is correct
21 Correct 100 ms 2428 KB Output is correct
22 Correct 99 ms 2428 KB Output is correct
23 Correct 10 ms 2136 KB Output is correct
24 Correct 2 ms 2136 KB Output is correct
25 Correct 20 ms 2136 KB Output is correct
26 Correct 19 ms 2136 KB Output is correct
27 Correct 15 ms 2136 KB Output is correct
28 Correct 17 ms 2136 KB Output is correct
29 Correct 14 ms 2136 KB Output is correct
30 Correct 70 ms 2428 KB Output is correct
31 Correct 84 ms 2428 KB Output is correct
32 Correct 100 ms 2428 KB Output is correct
33 Correct 115 ms 2428 KB Output is correct
34 Correct 85 ms 2428 KB Output is correct
35 Correct 80 ms 2428 KB Output is correct
36 Correct 159 ms 2428 KB Output is correct
37 Correct 3 ms 2428 KB Output is correct
38 Correct 3 ms 2428 KB Output is correct
39 Correct 81 ms 2428 KB Output is correct
40 Correct 75 ms 2428 KB Output is correct
41 Correct 42 ms 2428 KB Output is correct
42 Correct 78 ms 2428 KB Output is correct
43 Correct 79 ms 2428 KB Output is correct
44 Correct 2 ms 2428 KB Output is correct
45 Correct 14 ms 2428 KB Output is correct
46 Correct 17 ms 2428 KB Output is correct
47 Correct 17 ms 2428 KB Output is correct
48 Correct 201 ms 2428 KB Output is correct
49 Correct 147 ms 2428 KB Output is correct
50 Correct 3 ms 2428 KB Output is correct
51 Correct 108 ms 2136 KB Output is correct
52 Correct 98 ms 2136 KB Output is correct
53 Correct 115 ms 2136 KB Output is correct
54 Correct 13 ms 2136 KB Output is correct
55 Correct 13 ms 2136 KB Output is correct
56 Correct 3 ms 2136 KB Output is correct
57 Correct 19 ms 2136 KB Output is correct
58 Correct 3 ms 2136 KB Output is correct
59 Correct 20 ms 2136 KB Output is correct
60 Correct 16 ms 2136 KB Output is correct
61 Correct 17 ms 2136 KB Output is correct
62 Correct 2 ms 2136 KB Output is correct
63 Correct 6 ms 2136 KB Output is correct