oj.uz

Submission #487643

# Submission time Handle Problem Language Result Execution time Memory
487643 2021-11-16T10:32:09 Z leaked Travelling Merchant (APIO17_merchant) C++14
100 / 100
 182 ms 4480 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define vec vector
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pw(x) (1LL<<(x))
#define sz(x) (int)(x).size()
#define fast_iati ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

template<class T> bool umin(T &a,const  T &b){return (a>b?a=b,1:0);}
template<class T> bool umax(T &a,const  T &b){return (a<b?a=b,1:0);}
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll>pll;
const int N=201;
const int K=2001;
const ll inf=1e16;
int b[N][K],s[N][K];
ll dst[N][N];
ll mx[N][N];
signed main(){
    fast_iati;
    int n,m,k;
    cin>>n>>m>>k;
    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<n;i++){
        for(int j=0;j<n;j++){
            if(i==j) continue;
            for(int t=0;t<k;t++){
                if(b[i][t]==-1 || s[j][t]==-1) continue;
                umax(mx[i][j],(ll)-b[i][t]+s[j][t]);
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++) dst[i][j]=inf;
        dst[i][i]=0;
    }
    for(int i=0;i<m;i++){
        int v,u,w;
        cin>>v>>u>>w;--v;--u;
        umin(dst[v][u],(ll)w);
    }
    for(int t=0;t<n;t++){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                umin(dst[i][j],dst[i][t]+dst[t][j]);
            }
        }
    }
    auto check=[&](ll x){
        vec<vec<ll>>f(n,vec<ll>(n,-inf));
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if(dst[i][j]<=inf/x && i!=j){
                    umax(f[i][j],mx[i][j]-1ll*x*dst[i][j]);
                }
            }
        }
        for(int k=0;k<n;k++){
            for(int i=0;i<n;i++){
                for(int j=0;j<n;j++){
                    umax(f[i][j],min(inf,f[i][k]+f[k][j]));
                }
            }
        }
        for(int i=0;i<n;i++){
            if(f[i][i]>=0)
                return 1;
        }
//        int ok=(f[0][0]>=0);
        return 0;
    };
//    cout<<check(3);
//    return 0;
    ll l=1,r=inf;
    while(l!=r){
        ll mid=(l+r)/2;
        if(check(mid)) l=mid+1;
        else r=mid;
    }
    cout<<l-1;
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 2124 KB Output is correct
2 Correct 71 ms 1368 KB Output is correct
3 Correct 66 ms 1356 KB Output is correct
4 Correct 10 ms 716 KB Output is correct
5 Correct 10 ms 832 KB Output is correct
6 Correct 14 ms 828 KB Output is correct
7 Correct 11 ms 848 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 10 ms 820 KB Output is correct
10 Correct 12 ms 832 KB Output is correct
11 Correct 10 ms 716 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 10 ms 748 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 828 KB Output is correct
2 Correct 11 ms 848 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 10 ms 820 KB Output is correct
5 Correct 12 ms 832 KB Output is correct
6 Correct 10 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 10 ms 748 KB Output is correct
9 Correct 12 ms 844 KB Output is correct
10 Correct 10 ms 844 KB Output is correct
11 Correct 17 ms 928 KB Output is correct
12 Correct 9 ms 896 KB Output is correct
13 Correct 18 ms 932 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 16 ms 872 KB Output is correct
16 Correct 12 ms 956 KB Output is correct
17 Correct 12 ms 848 KB Output is correct
18 Correct 13 ms 848 KB Output is correct
19 Correct 13 ms 976 KB Output is correct
20 Correct 12 ms 980 KB Output is correct
21 Correct 11 ms 872 KB Output is correct
22 Correct 12 ms 848 KB Output is correct
23 Correct 19 ms 996 KB Output is correct
24 Correct 10 ms 848 KB Output is correct
25 Correct 23 ms 844 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 23 ms 924 KB Output is correct
28 Correct 15 ms 924 KB Output is correct
29 Correct 17 ms 844 KB Output is correct
30 Correct 12 ms 904 KB Output is correct
31 Correct 17 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 844 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 23 ms 924 KB Output is correct
4 Correct 15 ms 924 KB Output is correct
5 Correct 17 ms 844 KB Output is correct
6 Correct 12 ms 904 KB Output is correct
7 Correct 17 ms 844 KB Output is correct
8 Correct 153 ms 1588 KB Output is correct
9 Correct 182 ms 2216 KB Output is correct
10 Correct 125 ms 1536 KB Output is correct
11 Correct 132 ms 1592 KB Output is correct
12 Correct 167 ms 1592 KB Output is correct
13 Correct 103 ms 1480 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 844 KB Output is correct
2 Correct 10 ms 844 KB Output is correct
3 Correct 17 ms 928 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 18 ms 932 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 16 ms 872 KB Output is correct
8 Correct 12 ms 956 KB Output is correct
9 Correct 12 ms 848 KB Output is correct
10 Correct 13 ms 848 KB Output is correct
11 Correct 13 ms 976 KB Output is correct
12 Correct 12 ms 980 KB Output is correct
13 Correct 11 ms 872 KB Output is correct
14 Correct 12 ms 848 KB Output is correct
15 Correct 19 ms 996 KB Output is correct
16 Correct 10 ms 848 KB Output is correct
17 Correct 153 ms 1588 KB Output is correct
18 Correct 182 ms 2216 KB Output is correct
19 Correct 125 ms 1536 KB Output is correct
20 Correct 132 ms 1592 KB Output is correct
21 Correct 167 ms 1592 KB Output is correct
22 Correct 103 ms 1480 KB Output is correct
23 Correct 23 ms 844 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 23 ms 924 KB Output is correct
26 Correct 15 ms 924 KB Output is correct
27 Correct 17 ms 844 KB Output is correct
28 Correct 12 ms 904 KB Output is correct
29 Correct 17 ms 844 KB Output is correct
30 Correct 107 ms 2124 KB Output is correct
31 Correct 71 ms 1368 KB Output is correct
32 Correct 66 ms 1356 KB Output is correct
33 Correct 10 ms 716 KB Output is correct
34 Correct 10 ms 832 KB Output is correct
35 Correct 14 ms 828 KB Output is correct
36 Correct 11 ms 848 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 10 ms 820 KB Output is correct
39 Correct 12 ms 832 KB Output is correct
40 Correct 10 ms 716 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 10 ms 748 KB Output is correct
43 Correct 72 ms 1464 KB Output is correct
44 Correct 73 ms 1616 KB Output is correct
45 Correct 95 ms 2624 KB Output is correct
46 Correct 85 ms 1616 KB Output is correct
47 Correct 83 ms 1672 KB Output is correct
48 Correct 67 ms 1616 KB Output is correct
49 Correct 121 ms 4224 KB Output is correct
50 Correct 0 ms 328 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 92 ms 1360 KB Output is correct
53 Correct 70 ms 1524 KB Output is correct
54 Correct 69 ms 1488 KB Output is correct
55 Correct 69 ms 1448 KB Output is correct
56 Correct 87 ms 1392 KB Output is correct
57 Correct 0 ms 336 KB Output is correct
58 Correct 13 ms 976 KB Output is correct
59 Correct 15 ms 1060 KB Output is correct
60 Correct 12 ms 976 KB Output is correct
61 Correct 113 ms 4480 KB Output is correct
62 Correct 114 ms 4316 KB Output is correct
63 Correct 0 ms 336 KB Output is correct