oj.uz

Submission #57351

# Submission time Handle Problem Language Result Execution time Memory
57351 2018-07-14T15:39:00 Z gabrielsimoes Travelling Merchant (APIO17_merchant) C++17
0 / 100
 119 ms 2040 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;
const ll INF = 1e14;
// const ll INF = 1000;
int N, M, K;
vector<pii> g[MAXN];
ll buy[MAXN][MAXK];
ll sell[MAXN][MAXK];

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++) {
                dist[i][j] = max(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }

    return (dist[1][1] > 0);
}

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; i <= N; i++) {
        for (int k = 1; k <= N; k++) {
            d[i][k] = INF;
        }
        d[i][i] = 0;
    }

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

    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]);
            }
        }
    }

    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]);
                }
            }
        }
    }

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

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

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:38: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:41: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:53: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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 119 ms 2040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2040 KB Output is correct
2 Incorrect 15 ms 2040 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 101 ms 2040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2040 KB Output is correct
2 Incorrect 15 ms 2040 KB Output isn't correct
3 Halted 0 ms 0 KB -