oj.uz

답안 #589347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589347 2022-07-04T13:38:53 Z stevancv 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 74 ms 3412 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> a(n, vector<int>(2 * k));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 2 * k; j++) {
            cin >> a[i][j];
        }
    }
    vector<vector<ll>> dist(n, vector<ll>(n, 1e18));
    for (int i = 0; i < m; i++) {
        int x, y, z; cin >> x >> y >> z;
        x -= 1; y -= 1;
        dist[x][y] = z;
    }
    for (int l = 0; l < n; l++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                smin(dist[i][j], dist[i][l] + dist[l][j]);
            }
        }
    }
    vector<vector<ll>> opt(n, vector<ll>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            ll x = 0;
            for (int l = 0; l < k; l++) {
                if (a[i][2 * l] == -1 || a[j][2 * l + 1] == -1) continue;
                ll tx = a[j][2 * l + 1] - a[i][2 * l];
                smax(x, tx);
            }
            opt[i][j] = x;
        }
    }
    auto Can = [&] (ll x) {
        vector<vector<ll>> d(n, vector<ll>(n, 1e18));
        for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) d[i][j] = x * min(dist[i][j], (ll)1e18 / x) - opt[i][j];
        for (int o = 0; o < n; o++) for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) smin(d[i][j], d[i][o] + d[o][j]);
        for (int i = 0; i < n; i++) if (d[i][i] <= 0) return true;
        return false;
    };
    ll l = 1; ll r = 1e9;
    ll ans = 0;
    while (l <= r) {
        ll mid = l + r >> 1;
        if (Can(mid)) {
            ans = mid;
            l = mid + 1;
        }
        else r = mid - 1;
    }
    cout << ans << en;
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:56:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |         ll mid = l + r >> 1;
      |                  ~~^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 1356 KB Output is correct
2 Correct 29 ms 560 KB Output is correct
3 Correct 30 ms 444 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 396 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 5 ms 340 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 5 ms 396 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 7 ms 340 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 5 ms 468 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 6 ms 340 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 7 ms 340 KB Output is correct
23 Correct 6 ms 408 KB Output is correct
24 Correct 5 ms 340 KB Output is correct
25 Correct 5 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 5 ms 340 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 4 ms 340 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 34 ms 596 KB Output is correct
9 Correct 55 ms 1260 KB Output is correct
10 Correct 32 ms 596 KB Output is correct
11 Correct 34 ms 644 KB Output is correct
12 Correct 36 ms 652 KB Output is correct
13 Correct 32 ms 596 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 6 ms 340 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 7 ms 340 KB Output is correct
15 Correct 6 ms 408 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 34 ms 596 KB Output is correct
18 Correct 55 ms 1260 KB Output is correct
19 Correct 32 ms 596 KB Output is correct
20 Correct 34 ms 644 KB Output is correct
21 Correct 36 ms 652 KB Output is correct
22 Correct 32 ms 596 KB Output is correct
23 Correct 5 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 5 ms 340 KB Output is correct
26 Correct 5 ms 340 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 55 ms 1356 KB Output is correct
31 Correct 29 ms 560 KB Output is correct
32 Correct 30 ms 444 KB Output is correct
33 Correct 4 ms 340 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 5 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 5 ms 340 KB Output is correct
39 Correct 5 ms 396 KB Output is correct
40 Correct 5 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 5 ms 340 KB Output is correct
43 Correct 30 ms 596 KB Output is correct
44 Correct 32 ms 700 KB Output is correct
45 Correct 45 ms 1600 KB Output is correct
46 Correct 32 ms 596 KB Output is correct
47 Correct 32 ms 596 KB Output is correct
48 Correct 37 ms 724 KB Output is correct
49 Correct 74 ms 3280 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 30 ms 588 KB Output is correct
53 Correct 31 ms 596 KB Output is correct
54 Correct 30 ms 596 KB Output is correct
55 Correct 30 ms 592 KB Output is correct
56 Correct 29 ms 596 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 6 ms 524 KB Output is correct
59 Correct 6 ms 468 KB Output is correct
60 Correct 8 ms 452 KB Output is correct
61 Correct 64 ms 3412 KB Output is correct
62 Correct 61 ms 3276 KB Output is correct
63 Correct 0 ms 212 KB Output is correct