oj.uz

Submission #553388

# Submission time Handle Problem Language Result Execution time Memory
553388 2022-04-25T17:04:25 Z urosk Travelling Merchant (APIO17_merchant) C++14
100 / 100
 74 ms 5428 KB 
// __builtin_popcount(x)
// __builtin_popcountll(x)
#define here cerr<<"===========================================\n"
#include <bits/stdc++.h>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
using namespace std;
#define maxn 105
#define maxk 10005
ll n,m,k;
ll a[maxn][maxk];
ll b[maxn][maxk];
ll p[maxn][maxk];
ll d[maxn][maxn];
ll c[maxn][maxn];
bool moe(ll x){
    for(ll i = 1;i<=n;i++) for(ll j = 1;j<=n;j++) c[i][j] = x*min(llinf/x,d[i][j]) - p[i][j];
    for(ll f = 1;f<=n;f++) for(ll i = 1;i<=n;i++) for(ll j = 1;j<=n;j++) c[i][j] = min(c[i][j],c[i][f]+c[f][j]);
    for(ll i = 1;i<=n;i++) if(c[i][i]<=0) return 1;
    return 0;
}
ll bs(){
    ll l = 1,r = 1000000000,mid,rez;
    while(l<=r){
        mid = (l+r)/2;
        if(moe(mid)){
            l = mid + 1;
            rez = mid;
        }else r = mid - 1;
    }
    return rez;
}
int main(){
	ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
    cin >> n >> m >> k;
    for(ll i = 1;i<=n;i++) for(ll j = 1;j<=n;j++) d[i][j] = llinf;
    //for(ll i = 1;i<=n;i++) d[i][i] = 0;
    for(ll i = 1;i<=n;i++) for(ll j = 1;j<=k;j++) cin >> a[i][j] >> b[i][j];
    for(ll f = 1;f<=k;f++) for(ll i = 1;i<=n;i++) for(ll j = 1;j<=n;j++) if(a[i][f]!=-1&&b[j][f]!=-1) p[i][j] = max(p[i][j],b[j][f]-a[i][f]);
    for(ll i = 1;i<=m;i++){
        ll x,y; cin >> x >> y;
        cin >> d[x][y];
    }
    for(ll f = 1;f<=n;f++){
        for(ll i = 1;i<=n;i++){
            for(ll j = 1;j<=n;j++){
                d[i][j] = min(d[i][j],d[i][f] + d[f][j]);
            }
        }
    }
    cout<<bs()<<endl;
	return 0;
}

Compilation message

merchant.cpp: In function 'long long int bs()':
merchant.cpp:45:12: warning: 'rez' may be used uninitialized in this function [-Wmaybe-uninitialized]
   45 |     return rez;
      |            ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 2892 KB Output is correct
2 Correct 34 ms 1340 KB Output is correct
3 Correct 50 ms 1384 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 8 ms 852 KB Output is correct
7 Correct 8 ms 852 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 6 ms 848 KB Output is correct
10 Correct 6 ms 864 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 6 ms 980 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 852 KB Output is correct
2 Correct 8 ms 852 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 6 ms 848 KB Output is correct
5 Correct 6 ms 864 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 980 KB Output is correct
9 Correct 6 ms 980 KB Output is correct
10 Correct 8 ms 852 KB Output is correct
11 Correct 8 ms 1116 KB Output is correct
12 Correct 7 ms 988 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 6 ms 940 KB Output is correct
16 Correct 7 ms 1120 KB Output is correct
17 Correct 8 ms 956 KB Output is correct
18 Correct 9 ms 992 KB Output is correct
19 Correct 7 ms 1108 KB Output is correct
20 Correct 6 ms 1108 KB Output is correct
21 Correct 6 ms 980 KB Output is correct
22 Correct 6 ms 980 KB Output is correct
23 Correct 7 ms 1108 KB Output is correct
24 Correct 6 ms 844 KB Output is correct
25 Correct 6 ms 1108 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 7 ms 1108 KB Output is correct
28 Correct 10 ms 1108 KB Output is correct
29 Correct 10 ms 1092 KB Output is correct
30 Correct 6 ms 980 KB Output is correct
31 Correct 5 ms 980 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1108 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 7 ms 1108 KB Output is correct
4 Correct 10 ms 1108 KB Output is correct
5 Correct 10 ms 1092 KB Output is correct
6 Correct 6 ms 980 KB Output is correct
7 Correct 5 ms 980 KB Output is correct
8 Correct 42 ms 1952 KB Output is correct
9 Correct 70 ms 4968 KB Output is correct
10 Correct 37 ms 1884 KB Output is correct
11 Correct 46 ms 2168 KB Output is correct
12 Correct 47 ms 2132 KB Output is correct
13 Correct 36 ms 1876 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 980 KB Output is correct
2 Correct 8 ms 852 KB Output is correct
3 Correct 8 ms 1116 KB Output is correct
4 Correct 7 ms 988 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 940 KB Output is correct
8 Correct 7 ms 1120 KB Output is correct
9 Correct 8 ms 956 KB Output is correct
10 Correct 9 ms 992 KB Output is correct
11 Correct 7 ms 1108 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 6 ms 980 KB Output is correct
14 Correct 6 ms 980 KB Output is correct
15 Correct 7 ms 1108 KB Output is correct
16 Correct 6 ms 844 KB Output is correct
17 Correct 42 ms 1952 KB Output is correct
18 Correct 70 ms 4968 KB Output is correct
19 Correct 37 ms 1884 KB Output is correct
20 Correct 46 ms 2168 KB Output is correct
21 Correct 47 ms 2132 KB Output is correct
22 Correct 36 ms 1876 KB Output is correct
23 Correct 6 ms 1108 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 7 ms 1108 KB Output is correct
26 Correct 10 ms 1108 KB Output is correct
27 Correct 10 ms 1092 KB Output is correct
28 Correct 6 ms 980 KB Output is correct
29 Correct 5 ms 980 KB Output is correct
30 Correct 63 ms 2892 KB Output is correct
31 Correct 34 ms 1340 KB Output is correct
32 Correct 50 ms 1384 KB Output is correct
33 Correct 6 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 8 ms 852 KB Output is correct
36 Correct 8 ms 852 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 6 ms 848 KB Output is correct
39 Correct 6 ms 864 KB Output is correct
40 Correct 6 ms 852 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 6 ms 980 KB Output is correct
43 Correct 35 ms 1492 KB Output is correct
44 Correct 37 ms 2032 KB Output is correct
45 Correct 52 ms 3520 KB Output is correct
46 Correct 41 ms 1876 KB Output is correct
47 Correct 50 ms 1984 KB Output is correct
48 Correct 37 ms 1876 KB Output is correct
49 Correct 70 ms 5300 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 35 ms 1440 KB Output is correct
53 Correct 36 ms 1492 KB Output is correct
54 Correct 36 ms 1748 KB Output is correct
55 Correct 36 ms 1492 KB Output is correct
56 Correct 36 ms 1364 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 6 ms 1108 KB Output is correct
59 Correct 7 ms 1236 KB Output is correct
60 Correct 7 ms 1168 KB Output is correct
61 Correct 74 ms 5428 KB Output is correct
62 Correct 71 ms 5420 KB Output is correct
63 Correct 1 ms 340 KB Output is correct