oj.uz

답안 #743720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743720 2023-05-17T18:56:40 Z grogu 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 75 ms 5400 KB 
#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 ok(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] = max(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(ok(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:44:10: warning: 'rez' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |   return rez;
      |          ^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 4100 KB Output is correct
2 Correct 33 ms 1340 KB Output is correct
3 Correct 32 ms 1236 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 5 ms 916 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 844 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 7 ms 844 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 5 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 916 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 844 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 7 ms 844 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 980 KB Output is correct
10 Correct 5 ms 848 KB Output is correct
11 Correct 6 ms 984 KB Output is correct
12 Correct 5 ms 980 KB Output is correct
13 Correct 8 ms 1108 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 5 ms 940 KB Output is correct
16 Correct 5 ms 1112 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 7 ms 860 KB Output is correct
19 Correct 6 ms 1156 KB Output is correct
20 Correct 7 ms 1116 KB Output is correct
21 Correct 5 ms 984 KB Output is correct
22 Correct 6 ms 1008 KB Output is correct
23 Correct 6 ms 1108 KB Output is correct
24 Correct 6 ms 852 KB Output is correct
25 Correct 6 ms 1132 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 6 ms 1108 KB Output is correct
28 Correct 6 ms 1112 KB Output is correct
29 Correct 6 ms 1108 KB Output is correct
30 Correct 5 ms 984 KB Output is correct
31 Correct 8 ms 1064 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1132 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 6 ms 1108 KB Output is correct
4 Correct 6 ms 1112 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 5 ms 984 KB Output is correct
7 Correct 8 ms 1064 KB Output is correct
8 Correct 39 ms 2088 KB Output is correct
9 Correct 65 ms 4972 KB Output is correct
10 Correct 34 ms 2004 KB Output is correct
11 Correct 38 ms 2168 KB Output is correct
12 Correct 41 ms 2164 KB Output is correct
13 Correct 41 ms 1944 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 980 KB Output is correct
2 Correct 5 ms 848 KB Output is correct
3 Correct 6 ms 984 KB Output is correct
4 Correct 5 ms 980 KB Output is correct
5 Correct 8 ms 1108 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 5 ms 940 KB Output is correct
8 Correct 5 ms 1112 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 7 ms 860 KB Output is correct
11 Correct 6 ms 1156 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 5 ms 984 KB Output is correct
14 Correct 6 ms 1008 KB Output is correct
15 Correct 6 ms 1108 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 39 ms 2088 KB Output is correct
18 Correct 65 ms 4972 KB Output is correct
19 Correct 34 ms 2004 KB Output is correct
20 Correct 38 ms 2168 KB Output is correct
21 Correct 41 ms 2164 KB Output is correct
22 Correct 41 ms 1944 KB Output is correct
23 Correct 6 ms 1132 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 6 ms 1108 KB Output is correct
26 Correct 6 ms 1112 KB Output is correct
27 Correct 6 ms 1108 KB Output is correct
28 Correct 5 ms 984 KB Output is correct
29 Correct 8 ms 1064 KB Output is correct
30 Correct 72 ms 4100 KB Output is correct
31 Correct 33 ms 1340 KB Output is correct
32 Correct 32 ms 1236 KB Output is correct
33 Correct 6 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 852 KB Output is correct
36 Correct 5 ms 916 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 844 KB Output is correct
39 Correct 6 ms 852 KB Output is correct
40 Correct 7 ms 844 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 34 ms 1500 KB Output is correct
44 Correct 34 ms 2004 KB Output is correct
45 Correct 51 ms 3524 KB Output is correct
46 Correct 33 ms 1876 KB Output is correct
47 Correct 36 ms 1876 KB Output is correct
48 Correct 36 ms 1980 KB Output is correct
49 Correct 75 ms 5240 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 32 ms 1364 KB Output is correct
53 Correct 34 ms 1492 KB Output is correct
54 Correct 38 ms 1752 KB Output is correct
55 Correct 32 ms 1492 KB Output is correct
56 Correct 31 ms 1364 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 7 ms 1232 KB Output is correct
59 Correct 6 ms 1112 KB Output is correct
60 Correct 6 ms 1172 KB Output is correct
61 Correct 65 ms 5348 KB Output is correct
62 Correct 64 ms 5400 KB Output is correct
63 Correct 1 ms 340 KB Output is correct