oj.uz

Submission #252903

# Submission time Handle Problem Language Result Execution time Memory
252903 2020-07-26T12:22:43 Z khangal Travelling Merchant (APIO17_merchant) C++14
100 / 100
 225 ms 33764 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long , long long > pl;
const int N=1e6+1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll sz,n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<ll> v[1234567];
ll B[123][1234],S[123][1234],D[123][123],C[123][123],c1[123][123];
bool check(ll val){
    rep(i,1,n){
        rep(j,1,n){
            C[i][j] = val * c1[i][j] - D[i][j];
        }
    }
    rep(k,1,n){
        rep(i,1,n){
            rep(j,1,n){
                C[i][j] = min(C[i][j], C[i][k] + C[k][j]);
            }
        }
    }
    rep(i,1,n)
        if(C[i][i] <= 0)
            return 1;
    return 0;
}
int main(){
    cin>>n>>m>>k;
    rep(i,1,n){
        rep(j,1,k){
            cin>>x>>y;
            B[i][j]=x;
            S[i][j]=y;    
        }
    }
    rep(i,1,n){
        rep(j,1,n)c1[i][j]=ll(1e9);
    }
    while(m--){
        cin>>x>>y>>z;
        c1[x][y]=z;
    }
    rep(k,1,n){
        rep(i,1,n){
            rep(j,1,n){
                c1[i][j]=min(c1[i][j] , c1[i][k] + c1[k][j]);
            }
        }
    }
    rep(i,1,n){
        rep(j,1,n){
            rep(o,1,k){
                if(B[i][o] != -1 && S[j][o] != -1)
                    D[i][j] = max(D[i][j], S[j][o] - B[i][o]);
            }
        }
    }
    ans=0;
    per(i,0,30){
        if(check(ans + (1ll<<i))==1)ans+=(1ll<<i);
    }
    cout<<ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 31492 KB Output is correct
2 Correct 56 ms 30328 KB Output is correct
3 Correct 53 ms 30328 KB Output is correct
4 Correct 23 ms 29824 KB Output is correct
5 Correct 24 ms 29952 KB Output is correct
6 Correct 23 ms 29824 KB Output is correct
7 Correct 26 ms 29824 KB Output is correct
8 Correct 17 ms 29440 KB Output is correct
9 Correct 23 ms 29824 KB Output is correct
10 Correct 24 ms 29824 KB Output is correct
11 Correct 27 ms 29816 KB Output is correct
12 Correct 25 ms 29440 KB Output is correct
13 Correct 29 ms 29824 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 29952 KB Output is correct
2 Correct 26 ms 29952 KB Output is correct
3 Correct 33 ms 29952 KB Output is correct
4 Correct 27 ms 29952 KB Output is correct
5 Correct 26 ms 29952 KB Output is correct
6 Correct 21 ms 29440 KB Output is correct
7 Correct 23 ms 29824 KB Output is correct
8 Correct 25 ms 29952 KB Output is correct
9 Correct 23 ms 29952 KB Output is correct
10 Correct 24 ms 29952 KB Output is correct
11 Correct 28 ms 30080 KB Output is correct
12 Correct 26 ms 29952 KB Output is correct
13 Correct 25 ms 29952 KB Output is correct
14 Correct 24 ms 29952 KB Output is correct
15 Correct 29 ms 30076 KB Output is correct
16 Correct 23 ms 29824 KB Output is correct
17 Correct 29 ms 29952 KB Output is correct
18 Correct 23 ms 29440 KB Output is correct
19 Correct 26 ms 29952 KB Output is correct
20 Correct 28 ms 29916 KB Output is correct
21 Correct 26 ms 29952 KB Output is correct
22 Correct 30 ms 29952 KB Output is correct
23 Correct 23 ms 29952 KB Output is correct
24 Correct 23 ms 29824 KB Output is correct
25 Correct 26 ms 29824 KB Output is correct
26 Correct 17 ms 29440 KB Output is correct
27 Correct 23 ms 29824 KB Output is correct
28 Correct 24 ms 29824 KB Output is correct
29 Correct 27 ms 29816 KB Output is correct
30 Correct 25 ms 29440 KB Output is correct
31 Correct 29 ms 29824 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 30644 KB Output is correct
2 Correct 198 ms 31608 KB Output is correct
3 Correct 74 ms 30464 KB Output is correct
4 Correct 76 ms 30584 KB Output is correct
5 Correct 71 ms 30584 KB Output is correct
6 Correct 61 ms 30456 KB Output is correct
7 Correct 29 ms 29952 KB Output is correct
8 Correct 23 ms 29440 KB Output is correct
9 Correct 26 ms 29952 KB Output is correct
10 Correct 28 ms 29916 KB Output is correct
11 Correct 26 ms 29952 KB Output is correct
12 Correct 30 ms 29952 KB Output is correct
13 Correct 23 ms 29952 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 29952 KB Output is correct
2 Correct 26 ms 29952 KB Output is correct
3 Correct 33 ms 29952 KB Output is correct
4 Correct 27 ms 29952 KB Output is correct
5 Correct 26 ms 29952 KB Output is correct
6 Correct 21 ms 29440 KB Output is correct
7 Correct 23 ms 29824 KB Output is correct
8 Correct 25 ms 29952 KB Output is correct
9 Correct 23 ms 29952 KB Output is correct
10 Correct 24 ms 29952 KB Output is correct
11 Correct 28 ms 30080 KB Output is correct
12 Correct 26 ms 29952 KB Output is correct
13 Correct 25 ms 29952 KB Output is correct
14 Correct 24 ms 29952 KB Output is correct
15 Correct 29 ms 30076 KB Output is correct
16 Correct 23 ms 29824 KB Output is correct
17 Correct 66 ms 30644 KB Output is correct
18 Correct 198 ms 31608 KB Output is correct
19 Correct 74 ms 30464 KB Output is correct
20 Correct 76 ms 30584 KB Output is correct
21 Correct 71 ms 30584 KB Output is correct
22 Correct 61 ms 30456 KB Output is correct
23 Correct 29 ms 29952 KB Output is correct
24 Correct 23 ms 29440 KB Output is correct
25 Correct 26 ms 29952 KB Output is correct
26 Correct 28 ms 29916 KB Output is correct
27 Correct 26 ms 29952 KB Output is correct
28 Correct 30 ms 29952 KB Output is correct
29 Correct 23 ms 29952 KB Output is correct
30 Correct 55 ms 30464 KB Output is correct
31 Correct 61 ms 30720 KB Output is correct
32 Correct 109 ms 32120 KB Output is correct
33 Correct 60 ms 30720 KB Output is correct
34 Correct 66 ms 30712 KB Output is correct
35 Correct 60 ms 30840 KB Output is correct
36 Correct 209 ms 33528 KB Output is correct
37 Correct 18 ms 29440 KB Output is correct
38 Correct 18 ms 29440 KB Output is correct
39 Correct 69 ms 30584 KB Output is correct
40 Correct 65 ms 30600 KB Output is correct
41 Correct 60 ms 30584 KB Output is correct
42 Correct 57 ms 30456 KB Output is correct
43 Correct 60 ms 30496 KB Output is correct
44 Correct 18 ms 29440 KB Output is correct
45 Correct 30 ms 30080 KB Output is correct
46 Correct 29 ms 30080 KB Output is correct
47 Correct 33 ms 30080 KB Output is correct
48 Correct 219 ms 33656 KB Output is correct
49 Correct 225 ms 33764 KB Output is correct
50 Correct 18 ms 29440 KB Output is correct
51 Correct 150 ms 31492 KB Output is correct
52 Correct 56 ms 30328 KB Output is correct
53 Correct 53 ms 30328 KB Output is correct
54 Correct 23 ms 29824 KB Output is correct
55 Correct 24 ms 29952 KB Output is correct
56 Correct 23 ms 29824 KB Output is correct
57 Correct 26 ms 29824 KB Output is correct
58 Correct 17 ms 29440 KB Output is correct
59 Correct 23 ms 29824 KB Output is correct
60 Correct 24 ms 29824 KB Output is correct
61 Correct 27 ms 29816 KB Output is correct
62 Correct 25 ms 29440 KB Output is correct
63 Correct 29 ms 29824 KB Output is correct