oj.uz

Submission #250743

# Submission time Handle Problem Language Result Execution time Memory
250743 2020-07-19T01:16:33 Z balbit Travelling Merchant (APIO17_merchant) C++14
100 / 100
 192 ms 4600 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define int ll
#define pii pair<int, int>
#define f first
#define s second

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S&&...y){cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define IOS() ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif // BALBIT

#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
#define pb push_back

const int maxn = 2e5+5;

int n,m,k;

ll B[102][1002], S[102][1002];
vector<pii> g[102];
ll d[102][1002];

bool bellmango(int start, int mid) {
    memset(d, 0x3f, sizeof d);
    d[start][0] = 0;
    for (int cnt = 0; cnt<n*3; ++cnt) {
        bool upd = 0;
        for (int v = 0; v<n; ++v) {
            for (int j = 0; j<=k; ++j) {
                if (d[v][j] == 0x3f3f3f3f3f3f3f3f) continue;
                for (pii & p : g[v]) {
                    if (d[p.f][j] > d[v][j] + mid * (ll)p.s) {
                        d[p.f][j] = d[v][j] + mid * (ll)p.s; upd = 1;
                    }
                }
                if (j == 0) {
                    for (int j2 = 1; j2<=k; ++j2) {
                        if (B[v][j2] != -1 && d[v][j2] > d[v][j] + B[v][j2]) {
                            d[v][j2] = d[v][j] + B[v][j2]; upd = 1;
                        }
                    }
                }else{
                    if (S[v][j] != -1 && d[v][0] > d[v][j] - S[v][j]){
                        d[v][0] = d[v][j] - S[v][j]; upd = 1;
                    }

                }
            }
        }
        if (!upd) {
            bug(mid, "No");
            return 0;
        }
    }
    bug(mid, "Works");
    return 1;
}

ll gdst[102][102];
ll deal[102][102];
__int128 F[102][102];
bool floydgo(int mid){
    memset(F, 0x3f, sizeof F);
    for (int i = 0; i<n; ++i) F[i][i] = 0;
    for (int i = 0; i<n; ++i) {
        for (int j = 0; j<n; ++j) {
            F[i][j] = min(F[i][j], deal[i][j] + mid * (__int128)gdst[i][j]);
        }
    }
    for (int K = 0; K<n; ++K){
        for (int i = 0; i<n; ++i) {
            for (int j = 0; j<n; ++j) {
                F[i][j] = min(F[i][j], F[i][K] + F[K][j]);
            }
        }
    }
    for (int i = 0; i<n; ++i) {
        if (F[i][i] < 0) return 1;
        for (int j = 0; j<n; ++j) {
            if (j != i && F[i][j] + F[j][i] <=0) {
                return 1;
            }
        }
    }
    return 0;
}


signed main(){
    IOS();
    cin>>n>>m>>k;
    for (int i = 0; i<n; ++i) {
        for (int j = 0; j<k*2; ++j) {
            cin>>(j%2==0?B:S)[i][(j/2)+1];
        }
    }
    for (int i =0 ; i<n; ++i) {
        for (int j = 0; j<n; ++j) {
            for (int K = 1; K<=k; ++K) {
                if (B[i][K] != -1 && S[j][K] != -1) {
                    deal[i][j] = min(deal[i][j], B[i][K] - S[j][K]);
                }
            }
        }
    }
    memset(gdst, 0x3f, sizeof gdst);
    for (int i =0 ; i<n; ++i) gdst[i][i] = 0;
    for (int i = 0; i<m; ++i) {
        int a,b,c; cin>>a>>b>>c;
        g[a-1].pb({b-1,c});
        gdst[a-1][b-1] = min(gdst[a-1][b-1], (ll)c);
    }
    for (int K = 0; K<n; ++K){
        for (int i = 0; i<n; ++i) {
            for (int j = 0; j<n; ++j) {
                gdst[i][j] = min(gdst[i][j], gdst[i][K] + gdst[K][j]);
            }
        }
    }
    int l = 0, r = 1e9+1;
    while (l!=r) {
        int mid = (l+r)/2;
        if (floydgo(mid)) {
            l = mid+1;
        }else{
            r = mid;
        }
        bug(l,r);
    }
    cout<<max(l-1,0ll)<<endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 2168 KB Output is correct
2 Correct 121 ms 1528 KB Output is correct
3 Correct 107 ms 1532 KB Output is correct
4 Correct 12 ms 1024 KB Output is correct
5 Correct 12 ms 1024 KB Output is correct
6 Correct 17 ms 1024 KB Output is correct
7 Correct 17 ms 1100 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 17 ms 1024 KB Output is correct
10 Correct 13 ms 1024 KB Output is correct
11 Correct 14 ms 1024 KB Output is correct
12 Correct 1 ms 640 KB Output is correct
13 Correct 20 ms 1152 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1024 KB Output is correct
2 Correct 19 ms 1024 KB Output is correct
3 Correct 19 ms 1024 KB Output is correct
4 Correct 25 ms 1024 KB Output is correct
5 Correct 18 ms 1024 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 23 ms 1024 KB Output is correct
8 Correct 14 ms 1152 KB Output is correct
9 Correct 17 ms 1024 KB Output is correct
10 Correct 15 ms 1024 KB Output is correct
11 Correct 14 ms 1152 KB Output is correct
12 Correct 17 ms 1152 KB Output is correct
13 Correct 10 ms 1152 KB Output is correct
14 Correct 23 ms 1024 KB Output is correct
15 Correct 14 ms 1152 KB Output is correct
16 Correct 20 ms 1024 KB Output is correct
17 Correct 19 ms 1024 KB Output is correct
18 Correct 1 ms 640 KB Output is correct
19 Correct 21 ms 1024 KB Output is correct
20 Correct 28 ms 1024 KB Output is correct
21 Correct 18 ms 1024 KB Output is correct
22 Correct 13 ms 1152 KB Output is correct
23 Correct 14 ms 1024 KB Output is correct
24 Correct 17 ms 1024 KB Output is correct
25 Correct 17 ms 1100 KB Output is correct
26 Correct 1 ms 640 KB Output is correct
27 Correct 17 ms 1024 KB Output is correct
28 Correct 13 ms 1024 KB Output is correct
29 Correct 14 ms 1024 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 20 ms 1152 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 1664 KB Output is correct
2 Correct 192 ms 2296 KB Output is correct
3 Correct 120 ms 1536 KB Output is correct
4 Correct 132 ms 1784 KB Output is correct
5 Correct 144 ms 1664 KB Output is correct
6 Correct 96 ms 1536 KB Output is correct
7 Correct 19 ms 1024 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 21 ms 1024 KB Output is correct
10 Correct 28 ms 1024 KB Output is correct
11 Correct 18 ms 1024 KB Output is correct
12 Correct 13 ms 1152 KB Output is correct
13 Correct 14 ms 1024 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1024 KB Output is correct
2 Correct 19 ms 1024 KB Output is correct
3 Correct 19 ms 1024 KB Output is correct
4 Correct 25 ms 1024 KB Output is correct
5 Correct 18 ms 1024 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 23 ms 1024 KB Output is correct
8 Correct 14 ms 1152 KB Output is correct
9 Correct 17 ms 1024 KB Output is correct
10 Correct 15 ms 1024 KB Output is correct
11 Correct 14 ms 1152 KB Output is correct
12 Correct 17 ms 1152 KB Output is correct
13 Correct 10 ms 1152 KB Output is correct
14 Correct 23 ms 1024 KB Output is correct
15 Correct 14 ms 1152 KB Output is correct
16 Correct 20 ms 1024 KB Output is correct
17 Correct 123 ms 1664 KB Output is correct
18 Correct 192 ms 2296 KB Output is correct
19 Correct 120 ms 1536 KB Output is correct
20 Correct 132 ms 1784 KB Output is correct
21 Correct 144 ms 1664 KB Output is correct
22 Correct 96 ms 1536 KB Output is correct
23 Correct 19 ms 1024 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 21 ms 1024 KB Output is correct
26 Correct 28 ms 1024 KB Output is correct
27 Correct 18 ms 1024 KB Output is correct
28 Correct 13 ms 1152 KB Output is correct
29 Correct 14 ms 1024 KB Output is correct
30 Correct 105 ms 1536 KB Output is correct
31 Correct 96 ms 1764 KB Output is correct
32 Correct 133 ms 2680 KB Output is correct
33 Correct 124 ms 1664 KB Output is correct
34 Correct 125 ms 1792 KB Output is correct
35 Correct 97 ms 1792 KB Output is correct
36 Correct 161 ms 4216 KB Output is correct
37 Correct 1 ms 640 KB Output is correct
38 Correct 1 ms 640 KB Output is correct
39 Correct 74 ms 1536 KB Output is correct
40 Correct 79 ms 1792 KB Output is correct
41 Correct 87 ms 1536 KB Output is correct
42 Correct 87 ms 1536 KB Output is correct
43 Correct 76 ms 1540 KB Output is correct
44 Correct 1 ms 640 KB Output is correct
45 Correct 17 ms 1280 KB Output is correct
46 Correct 17 ms 1280 KB Output is correct
47 Correct 19 ms 1280 KB Output is correct
48 Correct 153 ms 4600 KB Output is correct
49 Correct 156 ms 4472 KB Output is correct
50 Correct 1 ms 640 KB Output is correct
51 Correct 124 ms 2168 KB Output is correct
52 Correct 121 ms 1528 KB Output is correct
53 Correct 107 ms 1532 KB Output is correct
54 Correct 12 ms 1024 KB Output is correct
55 Correct 12 ms 1024 KB Output is correct
56 Correct 17 ms 1024 KB Output is correct
57 Correct 17 ms 1100 KB Output is correct
58 Correct 1 ms 640 KB Output is correct
59 Correct 17 ms 1024 KB Output is correct
60 Correct 13 ms 1024 KB Output is correct
61 Correct 14 ms 1024 KB Output is correct
62 Correct 1 ms 640 KB Output is correct
63 Correct 20 ms 1152 KB Output is correct