oj.uz

Submission #230167

# Submission time Handle Problem Language Result Execution time Memory
230167 2020-05-08T19:52:29 Z mehrdad_sohrabi Travelling Merchant (APIO17_merchant) C++14
100 / 100
 127 ms 4216 KB 
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
//#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
/// khodaya komak kon
/// ya navid navid
const int N=110,K=1010,inf=(ll)1e18;
ll g[N][N];
ll val[N][N];
ll b[N][K],s[N][K];
ll dp[N][N];
ll n,m,k1;
ll check(ll mid){
    for (int i=0;i<N;i++) for (int j=0;j<N;j++) dp[i][j]=-(ll)1e12;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            if (g[i][j]==0 || inf/g[i][j]<mid) continue;
            dp[i][j]=val[i][j]-g[i][j]*mid;
        }
    }
    /*
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            if (dp[i][j]>=0){
                cout << mid << " " << i << " " << j << " kjernkfin " << endl;
            }
        }
    }
    */
    for (int k=1;k<=n;k++){
        for (int i=1;i<=n;i++){
            for (int j=1;j<=n;j++){
                dp[i][j]=max(dp[i][j],dp[i][k]+dp[k][j]);
                dp[i][j]=min(dp[i][j],inf);
            }
        }
    }
    for (int i=1;i<=n;i++) if (dp[i][i]>=0) return 1;
    return 0;
}
int32_t main(){
    sync;
    cin >> n >> m >> k1;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=k1;j++){
            cin >> b[i][j] >> s[i][j] ;
        }
    }
    for (int i=0;i<N;i++) for (int j=0;j<N;j++) g[i][j]=(ll)1e12;
    for (int i=1;i<=n;i++) g[i][i]=0;
    for (int i=0;i<m;i++){
        ll v,u,w;
        cin >> v >> u >> w;
        g[v][u]=min(g[v][u],w);
    }
    for (int k=1;k<=n;k++){
        for (int i=1;i<=n;i++){
            for (int j=1;j<=n;j++){
                g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
            }
        }
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            for (int k=1;k<=k1;k++){
                if (b[i][k]==-1 || s[j][k]==-1) continue;
                val[i][j]=max(val[i][j],-b[i][k]+s[j][k]);
            }
        }
    }
    /*
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
          //  cout << i << " " << j << " " << g[i][j] << " " << val[i][j] << endl;
        }
    }
    */
    ll l=0,r=1e9+100;
    while(r-l>1){
          //  cout << r << " " << l << endl;
        ll mid=(r+l)/2;
        if (check(mid)) l=mid;
        else r=mid;
    }
    cout << l << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 3448 KB Output is correct
2 Correct 49 ms 1408 KB Output is correct
3 Correct 53 ms 1280 KB Output is correct
4 Correct 11 ms 896 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 12 ms 896 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 12 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 12 ms 1024 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 1784 KB Output is correct
2 Correct 114 ms 3960 KB Output is correct
3 Correct 54 ms 1536 KB Output is correct
4 Correct 58 ms 1912 KB Output is correct
5 Correct 58 ms 1856 KB Output is correct
6 Correct 54 ms 1536 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 13 ms 1024 KB Output is correct
10 Correct 12 ms 1024 KB Output is correct
11 Correct 12 ms 1024 KB Output is correct
12 Correct 12 ms 1024 KB Output is correct
13 Correct 12 ms 1024 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1024 KB Output is correct
2 Correct 11 ms 1024 KB Output is correct
3 Correct 12 ms 1024 KB Output is correct
4 Correct 11 ms 1024 KB Output is correct
5 Correct 12 ms 1024 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 11 ms 1024 KB Output is correct
8 Correct 12 ms 1024 KB Output is correct
9 Correct 11 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 12 ms 1152 KB Output is correct
13 Correct 12 ms 1024 KB Output is correct
14 Correct 12 ms 1024 KB Output is correct
15 Correct 13 ms 1024 KB Output is correct
16 Correct 12 ms 1024 KB Output is correct
17 Correct 61 ms 1784 KB Output is correct
18 Correct 114 ms 3960 KB Output is correct
19 Correct 54 ms 1536 KB Output is correct
20 Correct 58 ms 1912 KB Output is correct
21 Correct 58 ms 1856 KB Output is correct
22 Correct 54 ms 1536 KB Output is correct
23 Correct 12 ms 1024 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 13 ms 1024 KB Output is correct
26 Correct 12 ms 1024 KB Output is correct
27 Correct 12 ms 1024 KB Output is correct
28 Correct 12 ms 1024 KB Output is correct
29 Correct 12 ms 1024 KB Output is correct
30 Correct 58 ms 1408 KB Output is correct
31 Correct 54 ms 1664 KB Output is correct
32 Correct 69 ms 2688 KB Output is correct
33 Correct 58 ms 1664 KB Output is correct
34 Correct 61 ms 1664 KB Output is correct
35 Correct 56 ms 1664 KB Output is correct
36 Correct 127 ms 4216 KB Output is correct
37 Correct 5 ms 640 KB Output is correct
38 Correct 5 ms 640 KB Output is correct
39 Correct 52 ms 1408 KB Output is correct
40 Correct 54 ms 1536 KB Output is correct
41 Correct 53 ms 1536 KB Output is correct
42 Correct 53 ms 1660 KB Output is correct
43 Correct 52 ms 1408 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 14 ms 1152 KB Output is correct
46 Correct 14 ms 1152 KB Output is correct
47 Correct 14 ms 1152 KB Output is correct
48 Correct 118 ms 4216 KB Output is correct
49 Correct 118 ms 4196 KB Output is correct
50 Correct 5 ms 512 KB Output is correct
51 Correct 78 ms 3448 KB Output is correct
52 Correct 49 ms 1408 KB Output is correct
53 Correct 53 ms 1280 KB Output is correct
54 Correct 11 ms 896 KB Output is correct
55 Correct 11 ms 896 KB Output is correct
56 Correct 12 ms 896 KB Output is correct
57 Correct 12 ms 1024 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 12 ms 896 KB Output is correct
60 Correct 11 ms 896 KB Output is correct
61 Correct 11 ms 896 KB Output is correct
62 Correct 5 ms 640 KB Output is correct
63 Correct 12 ms 1024 KB Output is correct