oj.uz

답안 #540823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
540823 2022-03-21T20:00:32 Z Lobo 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 73 ms 4424 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 110;
const int maxk = 1100;

int n,m,k, b[maxn][maxk], s[maxn][maxk], dfw[maxn][maxn], d[maxn][maxn], g[maxn][maxn], a[maxn][maxn];

void solve() {
    cin >> n >> m >> k;

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

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            dfw[i][j] = inf1;
        }
    }
    for(int i = 1; i <= m; i++) {
        int u,v,w; cin >> u >> v >> w;
        dfw[u][v] = min(dfw[u][v],w);
    }

    for(int v = 1; v <= n; v++) {
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                dfw[i][j] = min(dfw[i][j], dfw[i][v]+dfw[v][j]);
            }
        }
    }

    for(int u = 1; u <= n; u++) {
        for(int v = 1; v <= n; v++) {
            a[u][v] = 0;
            //compra em u e vende em v
            for(int i = 1; i <= k; i++) {
                a[u][v] = max(a[u][v],s[v][i]-b[u][i]);
            }
            // cout << u << " " << v << " " << dfw[u][v] << endl;
        }
    }

    int l = 1;
    int r = inf1; //valor maximo
    int ans = 0;
    while(l <= r) {
        int mid = (l+r)>>1;

        //cria as arestas
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                d[i][j] = -inf1;
            }
        }

        for(int u = 1; u <= n; u++) {
            for(int v = 1; v <= n; v++) {
                g[u][v] = a[u][v]-dfw[u][v]*mid;
                d[u][v] = g[u][v];
                // cout << u << " " << v << " " << d[u][v] << endl;
            }
        }

        bool ok = false;

        for(int v = 1; v <= n; v++) {
            for(int i = 1; i <= n; i++) {
                for(int j = 1; j <= n; j++) {
                    d[i][j] = max(d[i][j], d[i][v]+d[v][j]);
                }
            }
        }

        for(int i = 1; i <= n; i++) {
            // cout << d[i][i] << endl;
            if(d[i][i] >= 0) ok = true;
        }

        //encontrar se tem ciclo positivo em um grafo bellman

        // bool ok = false;
        // for(int beg = 1; beg <= n; beg++) {
        //     for(int i = 1; i <= n; i++) {
        //         d[i][0] = -inf;
        //     }
        //     d[beg][0] = 0;
        //     for(int i = 1; i <= n+1; i++) {
        //         for(int u = 1; u <= n; u++) d[u][i] = d[u][i-1];

        //         for(int u = 1; u <= n; u++) {
        //             for(int v = 1; v <= n; v++) {
        //                 d[v][i] = max(d[v][i],d[u][i-1] + g[u][v]);
        //             }
        //         }
        //     }

        //     for(int u = 1; u <= n; u++) {
        //         for(int v = 1; v <= n; v++) {
        //             if(d[u][n] != -inf && d[v][n] < d[u][n]+g[u][v]) {
        //                 cout << beg << " " << u << " " << v << " " << d[u][n] << " " << d[v][n] << " " << g[u][v] << endl;
        //                 ok = true;
        //             }
        //             // d[v][i] = max(d[v][i],d[u][i-1] + g[u][v]);
        //         }
        //     }
        // }

        if(ok) {
            ans = mid;
            l = mid+1;
        }
        else {
            r = mid-1;
        }
    }

    cout << ans << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 2380 KB Output is correct
2 Correct 32 ms 1364 KB Output is correct
3 Correct 33 ms 1364 KB Output is correct
4 Correct 5 ms 916 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 0 ms 340 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 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 0 ms 340 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 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 6 ms 912 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 6 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 6 ms 940 KB Output is correct
21 Correct 6 ms 852 KB Output is correct
22 Correct 6 ms 852 KB Output is correct
23 Correct 7 ms 852 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 7 ms 852 KB Output is correct
28 Correct 8 ms 944 KB Output is correct
29 Correct 8 ms 948 KB Output is correct
30 Correct 5 ms 912 KB Output is correct
31 Correct 5 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 7 ms 852 KB Output is correct
4 Correct 8 ms 944 KB Output is correct
5 Correct 8 ms 948 KB Output is correct
6 Correct 5 ms 912 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 37 ms 1620 KB Output is correct
9 Correct 60 ms 2384 KB Output is correct
10 Correct 40 ms 1492 KB Output is correct
11 Correct 40 ms 1620 KB Output is correct
12 Correct 37 ms 1624 KB Output is correct
13 Correct 38 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 5 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 1 ms 340 KB Output is correct
7 Correct 6 ms 912 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 940 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 6 ms 852 KB Output is correct
15 Correct 7 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 37 ms 1620 KB Output is correct
18 Correct 60 ms 2384 KB Output is correct
19 Correct 40 ms 1492 KB Output is correct
20 Correct 40 ms 1620 KB Output is correct
21 Correct 37 ms 1624 KB Output is correct
22 Correct 38 ms 1492 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 7 ms 852 KB Output is correct
26 Correct 8 ms 944 KB Output is correct
27 Correct 8 ms 948 KB Output is correct
28 Correct 5 ms 912 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 57 ms 2380 KB Output is correct
31 Correct 32 ms 1364 KB Output is correct
32 Correct 33 ms 1364 KB Output is correct
33 Correct 5 ms 916 KB Output is correct
34 Correct 6 ms 852 KB Output is correct
35 Correct 5 ms 852 KB Output is correct
36 Correct 5 ms 852 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 5 ms 852 KB Output is correct
39 Correct 5 ms 852 KB Output is correct
40 Correct 5 ms 852 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 39 ms 1516 KB Output is correct
44 Correct 39 ms 1620 KB Output is correct
45 Correct 54 ms 2876 KB Output is correct
46 Correct 35 ms 1620 KB Output is correct
47 Correct 39 ms 1704 KB Output is correct
48 Correct 36 ms 1616 KB Output is correct
49 Correct 64 ms 4304 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 36 ms 1492 KB Output is correct
53 Correct 46 ms 1620 KB Output is correct
54 Correct 37 ms 1492 KB Output is correct
55 Correct 36 ms 1492 KB Output is correct
56 Correct 38 ms 1496 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 7 ms 980 KB Output is correct
59 Correct 7 ms 980 KB Output is correct
60 Correct 7 ms 988 KB Output is correct
61 Correct 73 ms 4424 KB Output is correct
62 Correct 67 ms 4316 KB Output is correct
63 Correct 1 ms 340 KB Output is correct