oj.uz

답안 #699816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699816 2023-02-18T04:46:50 Z Spade1 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 83 ms 4200 KB 
#include<bits/stdc++.h>
#define pii pair<int, int>
#define pII pair<pii, pii>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
#define sz(x) (int)x.size()
using namespace std;

const int N = 110;
const int K = 1010;

ll dis[N][N], dis2[N][N], prf[N][N];
ll s[N][K], b[N][K];

void solve() {
    int n, m, k; 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)
            dis[i][j] = INF;

    for (int i = 1; i <= m; ++i) {
        int u, v, w; cin >> u >> v >> w;
        dis[u][v] = w;
    }

    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            for (int l = 1; l <= k; ++l) {
                if (s[j][l] == -1 || b[i][l] == -1) continue;
                prf[i][j] = max(prf[i][j], s[j][l] - b[i][l]);
            }

    ll l = 0, r = 1e9;
    while (l < r) {
        ll mid = (l+r+1)/2;
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                dis2[i][j] = mid*dis[i][j] - prf[i][j];

        for (int k = 1; k <= n; ++k)
            for (int i = 1; i <= n; ++i)
                for (int j = 1; j <= n; ++j)
                    dis2[i][j] = min(dis2[i][j], dis2[i][k] + dis2[k][j]);
        bool y = 0;
        for (int i = 1; i <= n; ++i) if (dis2[i][i] <= 0) y = 1;
        if (y) l = mid;
        else r = mid-1;
    }
    cout << l << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 3376 KB Output is correct
2 Correct 29 ms 1236 KB Output is correct
3 Correct 30 ms 1236 KB Output is correct
4 Correct 5 ms 712 KB Output is correct
5 Correct 5 ms 708 KB Output is correct
6 Correct 5 ms 832 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 5 ms 840 KB Output is correct
11 Correct 5 ms 844 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 6 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 832 KB Output is correct
2 Correct 6 ms 844 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 840 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 980 KB Output is correct
12 Correct 5 ms 848 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 5 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 7 ms 852 KB Output is correct
20 Correct 5 ms 852 KB Output is correct
21 Correct 5 ms 796 KB Output is correct
22 Correct 5 ms 908 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 5 ms 980 KB Output is correct
31 Correct 5 ms 880 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 5 ms 880 KB Output is correct
8 Correct 37 ms 1740 KB Output is correct
9 Correct 75 ms 3896 KB Output is correct
10 Correct 32 ms 1492 KB Output is correct
11 Correct 36 ms 1736 KB Output is correct
12 Correct 36 ms 1748 KB Output is correct
13 Correct 33 ms 1492 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 6 ms 980 KB Output is correct
4 Correct 5 ms 848 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 7 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 5 ms 796 KB Output is correct
14 Correct 5 ms 908 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 37 ms 1740 KB Output is correct
18 Correct 75 ms 3896 KB Output is correct
19 Correct 32 ms 1492 KB Output is correct
20 Correct 36 ms 1736 KB Output is correct
21 Correct 36 ms 1748 KB Output is correct
22 Correct 33 ms 1492 KB Output is correct
23 Correct 5 ms 852 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 5 ms 852 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 5 ms 980 KB Output is correct
29 Correct 5 ms 880 KB Output is correct
30 Correct 54 ms 3376 KB Output is correct
31 Correct 29 ms 1236 KB Output is correct
32 Correct 30 ms 1236 KB Output is correct
33 Correct 5 ms 712 KB Output is correct
34 Correct 5 ms 708 KB Output is correct
35 Correct 5 ms 832 KB Output is correct
36 Correct 6 ms 844 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 5 ms 840 KB Output is correct
40 Correct 5 ms 844 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 34 ms 1364 KB Output is correct
44 Correct 33 ms 1632 KB Output is correct
45 Correct 50 ms 2764 KB Output is correct
46 Correct 32 ms 1620 KB Output is correct
47 Correct 33 ms 1620 KB Output is correct
48 Correct 33 ms 1620 KB Output is correct
49 Correct 80 ms 4116 KB Output is correct
50 Correct 1 ms 328 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 31 ms 1364 KB Output is correct
53 Correct 33 ms 1492 KB Output is correct
54 Correct 32 ms 1476 KB Output is correct
55 Correct 31 ms 1364 KB Output is correct
56 Correct 31 ms 1372 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 7 ms 976 KB Output is correct
59 Correct 6 ms 976 KB Output is correct
60 Correct 6 ms 980 KB Output is correct
61 Correct 83 ms 4200 KB Output is correct
62 Correct 82 ms 4172 KB Output is correct
63 Correct 1 ms 328 KB Output is correct