oj.uz

Submission #261184

# Submission time Handle Problem Language Result Execution time Memory
261184 2020-08-11T13:36:15 Z evpipis Travelling Merchant (APIO17_merchant) C++11
100 / 100
 128 ms 1408 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int len = 105, max_k = 1005, inf = 1e9+10;
const ll long_inf = 1e18+10;

int n, m, k;
int dis[len][len], prof[len][len], buy[len][max_k], sell[len][max_k];
ll path[len][len], state[len];

bool check(int c){
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            path[i][j] = long_inf;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (dis[i][j] != inf)
                path[i][j] = c*1LL*dis[i][j] - prof[i][j];

    for (int d = 0; d < n; d++)
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++){
                if (i == d || d == j)
                    continue;
                if (path[i][d] != long_inf && path[d][j] != long_inf)
                    path[i][j] = min(path[i][j], path[i][d]+path[d][j]);
                //if (path[i][j] < -long_inf)
                  //  path[i][j] = -long_inf;
                //assert(path[i][j] >= -long_inf);
            }

    // although it works fine with that without any
    // further overflow checks, it is wrong!!!
    for (int i = 0; i < n; i++)
        if (path[i][i] <= 0)
            return true;
    return false;
}

int bs(){
    int l = 1, r = 1e9, ans = 0;
    while (l <= r){
        int mid = (l+r)/2;
        if (check(mid))
            ans = mid, l = mid+1;
        else
            r = mid-1;
    }

    return ans;
}

int main(){
    //freopen("0001-cycle-bydist0.in", "r", stdin);

    scanf("%d %d %d", &n, &m, &k);
    for (int i = 0; i < n; i++)
        for (int j = 0; j < k; j++)
            scanf("%d %d", &buy[i][j], &sell[i][j]);

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            dis[i][j] = inf;

    for (int i = 0; i < m; i++){
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        dis[a-1][b-1] = c;
    }

    // fix dis, prof...
    for (int d = 0; d < n; d++)
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                dis[i][j] = min(dis[i][j], dis[i][d]+dis[d][j]);

    for (int a = 0; a < n; a++)
        for (int b = 0; b < n; b++)
            for (int d = 0; d < k; d++)
                if (buy[a][d] != -1 && sell[b][d] != -1)
                    prof[a][b] = max(prof[a][b], sell[b][d]-buy[a][d]);

    printf("%d\n", bs());
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:59: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:62:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d", &buy[i][j], &sell[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:70: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 82 ms 1272 KB Output is correct
2 Correct 45 ms 1280 KB Output is correct
3 Correct 48 ms 1280 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 8 ms 896 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 10 ms 836 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 1316 KB Output is correct
2 Correct 122 ms 1272 KB Output is correct
3 Correct 53 ms 1280 KB Output is correct
4 Correct 55 ms 1280 KB Output is correct
5 Correct 54 ms 1280 KB Output is correct
6 Correct 50 ms 1316 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 9 ms 768 KB Output is correct
10 Correct 9 ms 768 KB Output is correct
11 Correct 13 ms 896 KB Output is correct
12 Correct 8 ms 768 KB Output is correct
13 Correct 9 ms 768 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 768 KB Output is correct
2 Correct 7 ms 768 KB Output is correct
3 Correct 8 ms 768 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 8 ms 768 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 10 ms 768 KB Output is correct
9 Correct 9 ms 768 KB Output is correct
10 Correct 9 ms 768 KB Output is correct
11 Correct 8 ms 768 KB Output is correct
12 Correct 10 ms 768 KB Output is correct
13 Correct 8 ms 768 KB Output is correct
14 Correct 15 ms 768 KB Output is correct
15 Correct 12 ms 768 KB Output is correct
16 Correct 7 ms 768 KB Output is correct
17 Correct 54 ms 1316 KB Output is correct
18 Correct 122 ms 1272 KB Output is correct
19 Correct 53 ms 1280 KB Output is correct
20 Correct 55 ms 1280 KB Output is correct
21 Correct 54 ms 1280 KB Output is correct
22 Correct 50 ms 1316 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 9 ms 768 KB Output is correct
26 Correct 9 ms 768 KB Output is correct
27 Correct 13 ms 896 KB Output is correct
28 Correct 8 ms 768 KB Output is correct
29 Correct 9 ms 768 KB Output is correct
30 Correct 51 ms 1408 KB Output is correct
31 Correct 50 ms 1280 KB Output is correct
32 Correct 71 ms 1272 KB Output is correct
33 Correct 49 ms 1280 KB Output is correct
34 Correct 50 ms 1280 KB Output is correct
35 Correct 50 ms 1280 KB Output is correct
36 Correct 126 ms 1252 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 47 ms 1280 KB Output is correct
40 Correct 50 ms 1280 KB Output is correct
41 Correct 63 ms 1280 KB Output is correct
42 Correct 73 ms 1280 KB Output is correct
43 Correct 47 ms 1280 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 12 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 125 ms 1228 KB Output is correct
49 Correct 128 ms 1276 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 82 ms 1272 KB Output is correct
52 Correct 45 ms 1280 KB Output is correct
53 Correct 48 ms 1280 KB Output is correct
54 Correct 7 ms 768 KB Output is correct
55 Correct 8 ms 896 KB Output is correct
56 Correct 7 ms 768 KB Output is correct
57 Correct 8 ms 768 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 10 ms 768 KB Output is correct
60 Correct 7 ms 768 KB Output is correct
61 Correct 7 ms 896 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 10 ms 836 KB Output is correct