oj.uz

Submission #57390

# Submission time Handle Problem Language Result Execution time Memory
57390 2018-07-14T19:30:51 Z gabrielsimoes Travelling Merchant (APIO17_merchant) C++17
12 / 100
 42 ms 1912 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 = 1e16;
// const ll INF = 1000;
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++) {
            if (i != j && reaches[i][j] && reaches[j][i]) {
                maxAns = max(maxAns, d[i][j] + d[j][i]);
            }
        }
    }

    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 ans = 0;
    for (int i = 2; i <= N; i++) {
        if (reaches[1][i] && reaches[i][1])
            ans = max(ans, gain[1][i]/(d[1][i] + d[i][1]));
    }

    printf("%lld\n", ans);

    // 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:50: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:53: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:58: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 42 ms 1912 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 6 ms 1912 KB Output is correct
4 Correct 3 ms 1912 KB Output is correct
5 Correct 4 ms 1912 KB Output is correct
6 Correct 3 ms 1912 KB Output is correct
7 Correct 5 ms 1912 KB Output is correct
8 Correct 3 ms 1912 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 3 ms 1912 KB Output is correct
11 Correct 4 ms 1912 KB Output is correct
12 Correct 2 ms 1912 KB Output is correct
13 Correct 5 ms 1912 KB Output is correct

Subtask #2
0 / 21.0

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

Subtask #3
0 / 33.0

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

Subtask #4
0 / 34.0

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