oj.uz

Submission #497143

# Submission time Handle Problem Language Result Execution time Memory
497143 2021-12-22T14:49:28 Z mp007mp Travelling Merchant (APIO17_merchant) C++14
100 / 100
 100 ms 4236 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define debug(x) cout<<#x<<" = "<<x<<"\n";
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pii;
int mod = 1e9+7;
ll inf = 1e9+5;
ll linf = 1ll*inf*inf;
const int maxn = 105;
ll sel[maxn][maxn*10],buy[maxn][maxn*10],dist[maxn][maxn],bnf[maxn][maxn];
int n,m,k;
inline bool check(ll x){
    ll d[maxn][maxn];
    for(int i=0;i<maxn;i++){
        for(int j=0;j<maxn;j++){
            d[i][j] = linf;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(dist[i][j] == linf)continue;
            d[i][j] = dist[i][j]*x-bnf[i][j];
        }
    }
    for(int z=1;z<=n;z++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                d[i][j] = min(d[i][j],d[i][z]+d[z][j]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(d[i][i] <= 0){
            return true;
        }
    }
    return false;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //cout<<"Hello, World!";
    //return 0;
    int l=0,r=inf;
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            cin>>buy[i][j]>>sel[i][j];
        }
    }
    for(int i=0;i<maxn;i++){
        for(int j=0;j<maxn;j++){
            dist[i][j] = linf;
        }
    }
    for(int i=0;i<m;i++){
        ll u,v,w;
        cin>>u>>v>>w;
        dist[u][v] = min(dist[u][v],w);
    }
    for(int z=1;z<=n;z++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                dist[i][j] = min(dist[i][j],dist[i][z]+dist[z][j]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int z=1;z<=k;z++){
                if(buy[i][z] != -1 && sel[j][z] != -1){
                    bnf[i][j] = max(bnf[i][j],sel[j][z]-buy[i][z]);
                }
            }
        }
    }
    while(r-l>1){
        int mid = (l+r)>>1;
        if(check(mid)){
            l = mid;
        }else{
            r = mid;
        }
    }
    cout<<l;
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2244 KB Output is correct
2 Correct 31 ms 1276 KB Output is correct
3 Correct 33 ms 1280 KB Output is correct
4 Correct 6 ms 900 KB Output is correct
5 Correct 5 ms 848 KB Output is correct
6 Correct 5 ms 848 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 5 ms 848 KB Output is correct
10 Correct 6 ms 848 KB Output is correct
11 Correct 5 ms 840 KB Output is correct
12 Correct 1 ms 444 KB Output is correct
13 Correct 6 ms 948 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 848 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 5 ms 848 KB Output is correct
5 Correct 6 ms 848 KB Output is correct
6 Correct 5 ms 840 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 6 ms 948 KB Output is correct
9 Correct 5 ms 836 KB Output is correct
10 Correct 5 ms 844 KB Output is correct
11 Correct 9 ms 1096 KB Output is correct
12 Correct 5 ms 972 KB Output is correct
13 Correct 7 ms 964 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 6 ms 836 KB Output is correct
16 Correct 5 ms 972 KB Output is correct
17 Correct 5 ms 844 KB Output is correct
18 Correct 5 ms 972 KB Output is correct
19 Correct 7 ms 972 KB Output is correct
20 Correct 7 ms 944 KB Output is correct
21 Correct 6 ms 848 KB Output is correct
22 Correct 8 ms 976 KB Output is correct
23 Correct 8 ms 980 KB Output is correct
24 Correct 8 ms 848 KB Output is correct
25 Correct 6 ms 972 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 6 ms 972 KB Output is correct
28 Correct 6 ms 968 KB Output is correct
29 Correct 6 ms 968 KB Output is correct
30 Correct 8 ms 840 KB Output is correct
31 Correct 8 ms 848 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 972 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 6 ms 972 KB Output is correct
4 Correct 6 ms 968 KB Output is correct
5 Correct 6 ms 968 KB Output is correct
6 Correct 8 ms 840 KB Output is correct
7 Correct 8 ms 848 KB Output is correct
8 Correct 36 ms 1640 KB Output is correct
9 Correct 78 ms 2296 KB Output is correct
10 Correct 34 ms 1504 KB Output is correct
11 Correct 39 ms 1636 KB Output is correct
12 Correct 38 ms 1744 KB Output is correct
13 Correct 36 ms 1412 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 836 KB Output is correct
2 Correct 5 ms 844 KB Output is correct
3 Correct 9 ms 1096 KB Output is correct
4 Correct 5 ms 972 KB Output is correct
5 Correct 7 ms 964 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 6 ms 836 KB Output is correct
8 Correct 5 ms 972 KB Output is correct
9 Correct 5 ms 844 KB Output is correct
10 Correct 5 ms 972 KB Output is correct
11 Correct 7 ms 972 KB Output is correct
12 Correct 7 ms 944 KB Output is correct
13 Correct 6 ms 848 KB Output is correct
14 Correct 8 ms 976 KB Output is correct
15 Correct 8 ms 980 KB Output is correct
16 Correct 8 ms 848 KB Output is correct
17 Correct 36 ms 1640 KB Output is correct
18 Correct 78 ms 2296 KB Output is correct
19 Correct 34 ms 1504 KB Output is correct
20 Correct 39 ms 1636 KB Output is correct
21 Correct 38 ms 1744 KB Output is correct
22 Correct 36 ms 1412 KB Output is correct
23 Correct 6 ms 972 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 6 ms 972 KB Output is correct
26 Correct 6 ms 968 KB Output is correct
27 Correct 6 ms 968 KB Output is correct
28 Correct 8 ms 840 KB Output is correct
29 Correct 8 ms 848 KB Output is correct
30 Correct 55 ms 2244 KB Output is correct
31 Correct 31 ms 1276 KB Output is correct
32 Correct 33 ms 1280 KB Output is correct
33 Correct 6 ms 900 KB Output is correct
34 Correct 5 ms 848 KB Output is correct
35 Correct 5 ms 848 KB Output is correct
36 Correct 6 ms 860 KB Output is correct
37 Correct 1 ms 464 KB Output is correct
38 Correct 5 ms 848 KB Output is correct
39 Correct 6 ms 848 KB Output is correct
40 Correct 5 ms 840 KB Output is correct
41 Correct 1 ms 444 KB Output is correct
42 Correct 6 ms 948 KB Output is correct
43 Correct 32 ms 1352 KB Output is correct
44 Correct 34 ms 1476 KB Output is correct
45 Correct 49 ms 2632 KB Output is correct
46 Correct 34 ms 1488 KB Output is correct
47 Correct 35 ms 1592 KB Output is correct
48 Correct 37 ms 1488 KB Output is correct
49 Correct 83 ms 4152 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 1 ms 464 KB Output is correct
52 Correct 40 ms 1360 KB Output is correct
53 Correct 35 ms 1472 KB Output is correct
54 Correct 36 ms 1360 KB Output is correct
55 Correct 32 ms 1352 KB Output is correct
56 Correct 32 ms 1360 KB Output is correct
57 Correct 1 ms 452 KB Output is correct
58 Correct 8 ms 1104 KB Output is correct
59 Correct 7 ms 1092 KB Output is correct
60 Correct 9 ms 1100 KB Output is correct
61 Correct 89 ms 4180 KB Output is correct
62 Correct 100 ms 4236 KB Output is correct
63 Correct 1 ms 452 KB Output is correct