oj.uz

Submission #316160

# Submission time Handle Problem Language Result Execution time Memory
316160 2020-10-25T15:49:45 Z phathnv Travelling Merchant (APIO17_merchant) C++11
100 / 100
 113 ms 1400 KB 
#include <bits/stdc++.h>

#define mp make_pair
#define X first
#define Y second
#define taskname "Merchant"

using namespace std;

typedef long long ll;
typedef pair <int, int> ii;

const int N = 101;
const int K = 1001;
const int INF = 1e9;
const ll LLINF = 1e18;

int n, m, k, s[N][K], b[N][K], a[N][N], best[N][N];

ll cost[N][N];

void readInput(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= k; j++)
            cin >> b[i][j] >> s[i][j];
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            if (i != j)
                a[i][j] = -1;
    for(int i = 1; i <= m; i++){
        int u, v, t;
        cin >> u >> v >> t;
        if (a[u][v] == -1)
            a[u][v] = t;
        else
            a[u][v] = min(a[u][v], t);
    }
}

void prepare(){
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if (a[i][k] != -1 && a[k][j] != -1 && (a[i][j] == -1 || a[i][j] > a[i][k] + a[k][j]))
                    a[i][j] = a[i][k] + a[k][j];

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            for(int c = 1; c <= k; c++)
                if (s[j][c] != -1 && b[i][c] != -1)
                    best[i][j] = max(best[i][j], s[j][c] - b[i][c]);
}

bool check(int x){
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++){
            if (i == j)
                cost[i][j] = LLINF;
            else
                cost[i][j] = (ll) x * a[i][j] - best[i][j];
        }

    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if (a[i][k] != -1 && a[k][j] != -1)
                    cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
    for(int i = 1; i <= n; i++)
        if (cost[i][i] <= 0)
            return 1;
    return 0;
}

void solve(){
    int l = 0, r = INF, res = 0;
    while (l <= r){
        int mid = (l + r) >> 1;
        if (check(mid)){
            res = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    cout << res;
}

int main(){
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    readInput();
    prepare();
    solve();
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:92:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   92 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:93:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   93 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1272 KB Output is correct
2 Correct 49 ms 1400 KB Output is correct
3 Correct 50 ms 1280 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 7 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 768 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 7 ms 768 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 896 KB Output is correct
2 Correct 7 ms 768 KB Output is correct
3 Correct 8 ms 768 KB Output is correct
4 Correct 8 ms 768 KB Output is correct
5 Correct 8 ms 768 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 7 ms 768 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 8 ms 768 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 8 ms 768 KB Output is correct
14 Correct 8 ms 768 KB Output is correct
15 Correct 8 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 8 ms 768 KB Output is correct
20 Correct 8 ms 768 KB Output is correct
21 Correct 7 ms 768 KB Output is correct
22 Correct 7 ms 768 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 7 ms 768 KB Output is correct
25 Correct 7 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 768 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 7 ms 768 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1280 KB Output is correct
2 Correct 101 ms 1304 KB Output is correct
3 Correct 49 ms 1280 KB Output is correct
4 Correct 52 ms 1280 KB Output is correct
5 Correct 52 ms 1280 KB Output is correct
6 Correct 49 ms 1280 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 8 ms 768 KB Output is correct
10 Correct 8 ms 768 KB Output is correct
11 Correct 7 ms 768 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 6 ms 768 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 896 KB Output is correct
2 Correct 7 ms 768 KB Output is correct
3 Correct 8 ms 768 KB Output is correct
4 Correct 8 ms 768 KB Output is correct
5 Correct 8 ms 768 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 7 ms 768 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 8 ms 768 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 8 ms 768 KB Output is correct
14 Correct 8 ms 768 KB Output is correct
15 Correct 8 ms 768 KB Output is correct
16 Correct 7 ms 768 KB Output is correct
17 Correct 53 ms 1280 KB Output is correct
18 Correct 101 ms 1304 KB Output is correct
19 Correct 49 ms 1280 KB Output is correct
20 Correct 52 ms 1280 KB Output is correct
21 Correct 52 ms 1280 KB Output is correct
22 Correct 49 ms 1280 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 8 ms 768 KB Output is correct
26 Correct 8 ms 768 KB Output is correct
27 Correct 7 ms 768 KB Output is correct
28 Correct 7 ms 768 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 47 ms 1332 KB Output is correct
31 Correct 48 ms 1280 KB Output is correct
32 Correct 68 ms 1272 KB Output is correct
33 Correct 48 ms 1280 KB Output is correct
34 Correct 49 ms 1280 KB Output is correct
35 Correct 49 ms 1400 KB Output is correct
36 Correct 110 ms 1260 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 49 ms 1280 KB Output is correct
41 Correct 42 ms 1328 KB Output is correct
42 Correct 54 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 8 ms 768 KB Output is correct
46 Correct 8 ms 768 KB Output is correct
47 Correct 8 ms 768 KB Output is correct
48 Correct 113 ms 1272 KB Output is correct
49 Correct 109 ms 1232 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 81 ms 1272 KB Output is correct
52 Correct 49 ms 1400 KB Output is correct
53 Correct 50 ms 1280 KB Output is correct
54 Correct 7 ms 768 KB Output is correct
55 Correct 7 ms 768 KB Output is correct
56 Correct 7 ms 768 KB Output is correct
57 Correct 7 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 768 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 7 ms 768 KB Output is correct