oj.uz

Submission #57293

# Submission time Handle Problem Language Result Execution time Memory
57293 2018-07-14T13:50:35 Z gabrielsimoes Travelling Merchant (APIO17_merchant) C++17
12 / 100
 35 ms 1380 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 int MAXN = 51, MAXK = 51;
const ll INF = 1e18;

int N, M, K;
ll d[MAXN][MAXN];
// vector<pii> g[MAXN];
int buy[MAXN][MAXK];
int sell[MAXN][MAXK];

// ll dist[2][MAXN];
// priority_queue<pair<int, ll>, vector<pair<int, ll>>, greater<pair<int, ll>>> q;
// void dijkstra(int start, ll d[], vector<pii> g[]) {
//     for (int i = 1; i <= N; i++) d[i] = INF;
//     q.push({0, start});
//     d[start] = 0;

//     while (!q.empty()) {
//         ll dd; int cur;
//         tie(dd, cur) = q.top();
//         q.pop();
//         if (dd > d[cur]) continue;
//         for (pii p : g[cur]) {
//             int nx = p.first;
//             ll cost = p.second;

//             if (dd + cost < d[nx]) {
//                 d[nx] = dd + cost;
//                 q.push({d[nx], nx});
//             }
//         }
//     }
// }

// ll dp[MAXN][MAXN*MAXN][MAXK];
// bool ok[MAXN][MAXN*MAXN][MAXK];

// ll f(int cur, int sum, int bag) {
//     if (cur == 1 && sum == 0 && bag == 0) return 0;
//     else if (sum <= 0) return -INF;

//     ll &ret = dp[cur][sum][bag];
//     if (ok[cur][sum][bag]) return ret;
//     ok[cur][sum][bag] = true;
//     ret = -INF;

//     if (bag && sell[cur][bag] != -1) {
//         ret = max(ret, f(cur, sum, 0) + sell[cur][bag]);
//     }

//     if (bag == 0) {
//         for (int k = 1; k <= K; k++) {
//             if (buy[cur][k] != -1) {
//                 ret = max(ret, f(cur, sum, k) - buy[cur][k]);
//             }
//         }
//     }

//     for (pii p : g[cur]) {
//         int nx = p.first;
//         int cost = p.second;

//         ret = max(ret, f(nx, sum - cost, bag));
//     }

//     return ret;
// }

int main() {
    scanf("%d%d%d", &N, &M, &K);
    for (int i = 1; i <= N; i++) {
        for (int k = 1; k <= K; k++) {
            scanf("%d%d", &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]);
            }
        }
    }

    // ll ans = 0;
    // for (int sum = 1; sum <= N*N; sum++) {
    //     ans = max(ans, f(1, sum, 0)/ll(sum));
    // }

    // for (int sum = 0; sum <= N*N; sum++) {
    //     printf("dp %d %d %d: %lld\n", 1, sum, 0, f(1, sum, 0));
    // }

    ll ans = 0;
    for (int i = 1; i <= N; i++) {
        for (int k = 1; k <= K; k++) {
            ll dist = d[1][i] + d[i][1];
            if (buy[1][k] != -1 && sell[i][k] != -1 && dist > 0) {
                ans = max(ans, ll(-buy[1][k] + sell[i][k])/dist);
            }
        }
    }

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

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:75: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:78:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d%d", &buy[i][k], &sell[i][k]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:90: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 35 ms 1264 KB Output is correct
2 Correct 4 ms 1264 KB Output is correct
3 Correct 7 ms 1332 KB Output is correct
4 Correct 3 ms 1332 KB Output is correct
5 Correct 2 ms 1332 KB Output is correct
6 Correct 4 ms 1332 KB Output is correct
7 Correct 5 ms 1332 KB Output is correct
8 Correct 3 ms 1332 KB Output is correct
9 Correct 4 ms 1332 KB Output is correct
10 Correct 3 ms 1332 KB Output is correct
11 Correct 3 ms 1332 KB Output is correct
12 Correct 2 ms 1332 KB Output is correct
13 Correct 4 ms 1332 KB Output is correct

Subtask #2
0 / 21.0

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

Subtask #3
0 / 33.0

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

Subtask #4
0 / 34.0

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