oj.uz

답안 #161840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161840 2019-11-04T16:27:34 Z Minnakhmetov 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 229 ms 5496 KB 
#include <bits/stdc++.h>
    
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
 
using namespace std;

const ll INF = 1e18;
const int N = 1005;
ll prof[N][N], dp[N][N], 
    b[N][N], s[N][N], w[N][N];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    int n, m, k;
    cin >> n >> m >> k;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            w[i][j] = INF;
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            cin >> b[i][j] >> s[i][j];
        }
    }

    for (int i = 0; i < m; i++) {
        ll a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        w[a][b] = min(w[a][b], c);
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < n; k++) {
                if (w[j][i] != INF && w[i][k] != INF) {
                    w[j][k] = min(w[j][k], w[j][i] + w[i][k]);
                }
            }
        }
    }

    for (int x = 0; x < n; x++) {
        for (int y = 0; y < n; y++) {
            for (int z = 0; z < k; z++) {
                if (b[x][z] != -1 && s[y][z] != -1) {
                    prof[x][y] = max(prof[x][y], s[y][z] - b[x][z]); 
                }
            }
        }
    }

    ll l = 0, r = 3e9;

    while (r - l > 1) {
        ll p = (l + r) >> 1;

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (w[i][j] != INF) {
                    dp[i][j] = prof[i][j] - w[i][j] * p;
                }
            }
        }

        bool ok = false;

        for (int x = 0; x < n; x++) {
            for (int y = 0; y < n; y++) {
                for (int z = 0; z < n; z++) {
                    if (w[y][x] != INF && w[x][z] != INF) {
                        dp[y][z] = max(dp[y][z], dp[y][x] + dp[x][z]);

                        if (y == z && dp[y][z] >= 0) {
                            ok = true;
                        }
                    }
                }
            }
        }

        if (ok) {
            l = p;
        }
        else {
            r = p;
        }
    }

    cout << l;

    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 2936 KB Output is correct
2 Correct 75 ms 2168 KB Output is correct
3 Correct 78 ms 2152 KB Output is correct
4 Correct 13 ms 1144 KB Output is correct
5 Correct 13 ms 1272 KB Output is correct
6 Correct 12 ms 1272 KB Output is correct
7 Correct 13 ms 1272 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 13 ms 1144 KB Output is correct
10 Correct 13 ms 1144 KB Output is correct
11 Correct 12 ms 1144 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 10 ms 1272 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1272 KB Output is correct
2 Correct 13 ms 1272 KB Output is correct
3 Correct 13 ms 1400 KB Output is correct
4 Correct 12 ms 1400 KB Output is correct
5 Correct 15 ms 1400 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 9 ms 1272 KB Output is correct
8 Correct 11 ms 1400 KB Output is correct
9 Correct 8 ms 1272 KB Output is correct
10 Correct 9 ms 1272 KB Output is correct
11 Correct 14 ms 1400 KB Output is correct
12 Correct 11 ms 1400 KB Output is correct
13 Correct 14 ms 1400 KB Output is correct
14 Correct 13 ms 1400 KB Output is correct
15 Correct 28 ms 1400 KB Output is correct
16 Correct 13 ms 1272 KB Output is correct
17 Correct 14 ms 1400 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 15 ms 1528 KB Output is correct
20 Correct 13 ms 1400 KB Output is correct
21 Correct 11 ms 1400 KB Output is correct
22 Correct 13 ms 1404 KB Output is correct
23 Correct 9 ms 1400 KB Output is correct
24 Correct 12 ms 1272 KB Output is correct
25 Correct 13 ms 1272 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 13 ms 1144 KB Output is correct
28 Correct 13 ms 1144 KB Output is correct
29 Correct 12 ms 1144 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 10 ms 1272 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 2808 KB Output is correct
2 Correct 132 ms 3320 KB Output is correct
3 Correct 80 ms 2680 KB Output is correct
4 Correct 82 ms 2936 KB Output is correct
5 Correct 84 ms 3064 KB Output is correct
6 Correct 80 ms 2680 KB Output is correct
7 Correct 14 ms 1400 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 15 ms 1528 KB Output is correct
10 Correct 13 ms 1400 KB Output is correct
11 Correct 11 ms 1400 KB Output is correct
12 Correct 13 ms 1404 KB Output is correct
13 Correct 9 ms 1400 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1272 KB Output is correct
2 Correct 13 ms 1272 KB Output is correct
3 Correct 13 ms 1400 KB Output is correct
4 Correct 12 ms 1400 KB Output is correct
5 Correct 15 ms 1400 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 9 ms 1272 KB Output is correct
8 Correct 11 ms 1400 KB Output is correct
9 Correct 8 ms 1272 KB Output is correct
10 Correct 9 ms 1272 KB Output is correct
11 Correct 14 ms 1400 KB Output is correct
12 Correct 11 ms 1400 KB Output is correct
13 Correct 14 ms 1400 KB Output is correct
14 Correct 13 ms 1400 KB Output is correct
15 Correct 28 ms 1400 KB Output is correct
16 Correct 13 ms 1272 KB Output is correct
17 Correct 84 ms 2808 KB Output is correct
18 Correct 132 ms 3320 KB Output is correct
19 Correct 80 ms 2680 KB Output is correct
20 Correct 82 ms 2936 KB Output is correct
21 Correct 84 ms 3064 KB Output is correct
22 Correct 80 ms 2680 KB Output is correct
23 Correct 14 ms 1400 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 15 ms 1528 KB Output is correct
26 Correct 13 ms 1400 KB Output is correct
27 Correct 11 ms 1400 KB Output is correct
28 Correct 13 ms 1404 KB Output is correct
29 Correct 9 ms 1400 KB Output is correct
30 Correct 80 ms 2296 KB Output is correct
31 Correct 81 ms 2808 KB Output is correct
32 Correct 100 ms 3884 KB Output is correct
33 Correct 83 ms 2908 KB Output is correct
34 Correct 81 ms 2680 KB Output is correct
35 Correct 81 ms 2808 KB Output is correct
36 Correct 229 ms 5472 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 78 ms 2168 KB Output is correct
40 Correct 79 ms 2396 KB Output is correct
41 Correct 59 ms 2424 KB Output is correct
42 Correct 73 ms 2296 KB Output is correct
43 Correct 82 ms 2208 KB Output is correct
44 Correct 2 ms 504 KB Output is correct
45 Correct 13 ms 1596 KB Output is correct
46 Correct 12 ms 1528 KB Output is correct
47 Correct 11 ms 1528 KB Output is correct
48 Correct 145 ms 5496 KB Output is correct
49 Correct 143 ms 5496 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 107 ms 2936 KB Output is correct
52 Correct 75 ms 2168 KB Output is correct
53 Correct 78 ms 2152 KB Output is correct
54 Correct 13 ms 1144 KB Output is correct
55 Correct 13 ms 1272 KB Output is correct
56 Correct 12 ms 1272 KB Output is correct
57 Correct 13 ms 1272 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 13 ms 1144 KB Output is correct
60 Correct 13 ms 1144 KB Output is correct
61 Correct 12 ms 1144 KB Output is correct
62 Correct 2 ms 504 KB Output is correct
63 Correct 10 ms 1272 KB Output is correct