oj.uz

Submission #200994

# Submission time Handle Problem Language Result Execution time Memory
200994 2020-02-09T04:31:28 Z Nordway Travelling Merchant (APIO17_merchant) C++14
100 / 100
 114 ms 3320 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define up_b upper_bound
#define low_b lower_bound
#define nl '\n'

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;

const int N=101;
const int M=1001;
const int W=1e3+11;
const int inf=1e9;
const ll INF=1e18;
const ll mod=1e9+7;
const ld EPS=1e-9;

int b[N][M],s[N][M];
ll dist[N][N],adj[N][N];
int profit[N][N];

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0),cout.tie(0);
  int n,m,K;
  cin>>n>>m>>K;
  for(int i=1;i<=n;i++){
    for(int j=1;j<=K;j++){
      cin>>b[i][j]>>s[i][j];
    }
  }
  for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++){
      dist[i][j]=INF;
    }
    dist[i][i]=0;
  }
  for(int i=1;i<=m;i++){
    int u,v,w;
    cin>>u>>v>>w;
    dist[u][v]=w;
  }
  for(int k=1;k<=n;k++){
    for(int i=1;i<=n;i++){
      for(int j=1;j<=n;j++){
        dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
      }
    }
  }
  for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++){
      for(int k=1;k<=K;k++){
        if(b[i][k]==-1||s[j][k]==-1)continue;
        profit[i][j]=max(profit[i][j],s[j][k]-b[i][k]);
      }
    }
  }
  int l=1,r=inf;
  int ans=0;
  while(l<=r){
    int mid=(l+r)/2;
    for(int i=1;i<=n;i++){
      for(int j=1;j<=n;j++){
        if(dist[i][j]==INF)adj[i][j]=INF;
        else adj[i][j]=dist[i][j]*1ll*mid-profit[i][j];
      }
      adj[i][i]=INF;
    }
    for(int k=1;k<=n;k++){
      for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
          adj[i][j]=min(adj[i][j],adj[i][k]+adj[k][j]);
        }
      }
    }
    int w=0;
    for(int i=1;i<=n;i++){
      if(adj[i][i]<=0)w=1;
    }
    if(w)ans=mid,l=mid+1;
    else r=mid-1;
  }
  cout<<ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 2552 KB Output is correct
2 Correct 43 ms 1272 KB Output is correct
3 Correct 51 ms 1272 KB Output is correct
4 Correct 11 ms 888 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 10 ms 888 KB Output is correct
7 Correct 11 ms 888 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 12 ms 888 KB Output is correct
10 Correct 10 ms 888 KB Output is correct
11 Correct 10 ms 888 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 11 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 888 KB Output is correct
2 Correct 10 ms 888 KB Output is correct
3 Correct 11 ms 816 KB Output is correct
4 Correct 10 ms 760 KB Output is correct
5 Correct 12 ms 888 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 10 ms 888 KB Output is correct
8 Correct 11 ms 888 KB Output is correct
9 Correct 11 ms 888 KB Output is correct
10 Correct 10 ms 888 KB Output is correct
11 Correct 11 ms 888 KB Output is correct
12 Correct 11 ms 888 KB Output is correct
13 Correct 11 ms 888 KB Output is correct
14 Correct 11 ms 880 KB Output is correct
15 Correct 12 ms 888 KB Output is correct
16 Correct 10 ms 888 KB Output is correct
17 Correct 12 ms 888 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 12 ms 888 KB Output is correct
20 Correct 12 ms 888 KB Output is correct
21 Correct 11 ms 888 KB Output is correct
22 Correct 10 ms 888 KB Output is correct
23 Correct 10 ms 888 KB Output is correct
24 Correct 10 ms 888 KB Output is correct
25 Correct 11 ms 888 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 12 ms 888 KB Output is correct
28 Correct 10 ms 888 KB Output is correct
29 Correct 10 ms 888 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 11 ms 888 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1528 KB Output is correct
2 Correct 102 ms 3064 KB Output is correct
3 Correct 44 ms 1400 KB Output is correct
4 Correct 49 ms 1500 KB Output is correct
5 Correct 48 ms 1528 KB Output is correct
6 Correct 42 ms 1400 KB Output is correct
7 Correct 12 ms 888 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 12 ms 888 KB Output is correct
10 Correct 12 ms 888 KB Output is correct
11 Correct 11 ms 888 KB Output is correct
12 Correct 10 ms 888 KB Output is correct
13 Correct 10 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 888 KB Output is correct
2 Correct 10 ms 888 KB Output is correct
3 Correct 11 ms 816 KB Output is correct
4 Correct 10 ms 760 KB Output is correct
5 Correct 12 ms 888 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 10 ms 888 KB Output is correct
8 Correct 11 ms 888 KB Output is correct
9 Correct 11 ms 888 KB Output is correct
10 Correct 10 ms 888 KB Output is correct
11 Correct 11 ms 888 KB Output is correct
12 Correct 11 ms 888 KB Output is correct
13 Correct 11 ms 888 KB Output is correct
14 Correct 11 ms 880 KB Output is correct
15 Correct 12 ms 888 KB Output is correct
16 Correct 10 ms 888 KB Output is correct
17 Correct 48 ms 1528 KB Output is correct
18 Correct 102 ms 3064 KB Output is correct
19 Correct 44 ms 1400 KB Output is correct
20 Correct 49 ms 1500 KB Output is correct
21 Correct 48 ms 1528 KB Output is correct
22 Correct 42 ms 1400 KB Output is correct
23 Correct 12 ms 888 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 12 ms 888 KB Output is correct
26 Correct 12 ms 888 KB Output is correct
27 Correct 11 ms 888 KB Output is correct
28 Correct 10 ms 888 KB Output is correct
29 Correct 10 ms 888 KB Output is correct
30 Correct 43 ms 1272 KB Output is correct
31 Correct 46 ms 1400 KB Output is correct
32 Correct 64 ms 1784 KB Output is correct
33 Correct 44 ms 1400 KB Output is correct
34 Correct 46 ms 1400 KB Output is correct
35 Correct 45 ms 1400 KB Output is correct
36 Correct 112 ms 3320 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 45 ms 1272 KB Output is correct
40 Correct 44 ms 1408 KB Output is correct
41 Correct 43 ms 1400 KB Output is correct
42 Correct 43 ms 1272 KB Output is correct
43 Correct 43 ms 1272 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 13 ms 888 KB Output is correct
46 Correct 20 ms 888 KB Output is correct
47 Correct 13 ms 888 KB Output is correct
48 Correct 114 ms 3320 KB Output is correct
49 Correct 112 ms 3320 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 75 ms 2552 KB Output is correct
52 Correct 43 ms 1272 KB Output is correct
53 Correct 51 ms 1272 KB Output is correct
54 Correct 11 ms 888 KB Output is correct
55 Correct 10 ms 760 KB Output is correct
56 Correct 10 ms 888 KB Output is correct
57 Correct 11 ms 888 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 12 ms 888 KB Output is correct
60 Correct 10 ms 888 KB Output is correct
61 Correct 10 ms 888 KB Output is correct
62 Correct 5 ms 376 KB Output is correct
63 Correct 11 ms 888 KB Output is correct