oj.uz

Submission #57338

# Submission time Handle Problem Language Result Execution time Memory
57338 2018-07-14T15:00:14 Z joaogui1 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 184 ms 2588 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define INF (1LL << 57)

using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pii;

int n;
bool reach[128][128];
pii itens[128][1024];
ll g[128][128], dist[128][128], profit[128][128];

void fw(){
  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]);
        reach[i][j] |= (reach[i][k] && reach[k][j]);
      }
}


bool fw(ll r){

  for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= n; ++j)
      if(reach[i][j])
        dist[i][j] = r*g[i][j] - profit[i][j];

  for(int k = 1; k <= n; ++k)
    for(int i = 1; i <= n; ++i)
      for(int j = 1; j <= n; ++j){
        if(!reach[i][k] || !reach[k][j])  continue;
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }

  for(int i = 1; i <= n; ++i)
    if(dist[i][i] <= 0)  return 1;
  return 0;
}

void pre_calc(int k){
  for(int l = 1; l <= n; ++l)
    for(int i = 1; i <= n; ++i)
      for(int j = 1; j <= k; ++j)
        if((itens[i][j].ss != -1) && (itens[l][j].ff != -1))
          profit[l][i] = max(profit[l][i], itens[i][j].ss - itens[l][j].ff);
}

ll bin_search(ll ini, ll fim){
  ll m, ans = 0;
  while(fim - ini > 1){
    m = (fim + ini)/2;
    if(fw(m)){
      ans = m;
      ini = m;
    }
    else  fim = m;
  }
  return ans;
}


int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int m, k, a, b;
  ll ans = 0, test = 0, c;
  cin >> n >> m >> k;
  for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= n; ++j)
      g[i][j] = INF, dist[i][j] = INF;

  for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= k; ++j)
      cin >> itens[i][j].ff >> itens[i][j].ss;


  pre_calc(k);

  for(int i = 0; i < m; ++i){
    cin >> a >> b >> c;
    g[a][b] = c;
    reach[a][b] = 1;
  }
  fw();
  for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= n; ++j)
      test = max(test, profit[i][j]);
  //cout << test << "\n";
  ans = bin_search(0, test + 1);
  cout << ans << "\n";

  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 2296 KB Output is correct
2 Correct 88 ms 2296 KB Output is correct
3 Correct 73 ms 2296 KB Output is correct
4 Correct 12 ms 2296 KB Output is correct
5 Correct 13 ms 2296 KB Output is correct
6 Correct 4 ms 2296 KB Output is correct
7 Correct 11 ms 2296 KB Output is correct
8 Correct 2 ms 2296 KB Output is correct
9 Correct 11 ms 2296 KB Output is correct
10 Correct 11 ms 2296 KB Output is correct
11 Correct 11 ms 2296 KB Output is correct
12 Correct 3 ms 2296 KB Output is correct
13 Correct 13 ms 2296 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 2296 KB Output is correct
2 Correct 122 ms 2588 KB Output is correct
3 Correct 73 ms 2588 KB Output is correct
4 Correct 87 ms 2588 KB Output is correct
5 Correct 87 ms 2588 KB Output is correct
6 Correct 65 ms 2588 KB Output is correct
7 Correct 9 ms 2296 KB Output is correct
8 Correct 3 ms 2296 KB Output is correct
9 Correct 13 ms 2296 KB Output is correct
10 Correct 18 ms 2296 KB Output is correct
11 Correct 13 ms 2296 KB Output is correct
12 Correct 14 ms 2296 KB Output is correct
13 Correct 11 ms 2296 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2296 KB Output is correct
2 Correct 12 ms 2296 KB Output is correct
3 Correct 8 ms 2296 KB Output is correct
4 Correct 7 ms 2296 KB Output is correct
5 Correct 11 ms 2296 KB Output is correct
6 Correct 3 ms 2296 KB Output is correct
7 Correct 6 ms 2296 KB Output is correct
8 Correct 7 ms 2296 KB Output is correct
9 Correct 9 ms 2296 KB Output is correct
10 Correct 10 ms 2296 KB Output is correct
11 Correct 17 ms 2296 KB Output is correct
12 Correct 11 ms 2296 KB Output is correct
13 Correct 11 ms 2296 KB Output is correct
14 Correct 11 ms 2296 KB Output is correct
15 Correct 14 ms 2296 KB Output is correct
16 Correct 18 ms 2296 KB Output is correct
17 Correct 57 ms 2296 KB Output is correct
18 Correct 122 ms 2588 KB Output is correct
19 Correct 73 ms 2588 KB Output is correct
20 Correct 87 ms 2588 KB Output is correct
21 Correct 87 ms 2588 KB Output is correct
22 Correct 65 ms 2588 KB Output is correct
23 Correct 9 ms 2296 KB Output is correct
24 Correct 3 ms 2296 KB Output is correct
25 Correct 13 ms 2296 KB Output is correct
26 Correct 18 ms 2296 KB Output is correct
27 Correct 13 ms 2296 KB Output is correct
28 Correct 14 ms 2296 KB Output is correct
29 Correct 11 ms 2296 KB Output is correct
30 Correct 85 ms 2588 KB Output is correct
31 Correct 84 ms 2588 KB Output is correct
32 Correct 107 ms 2588 KB Output is correct
33 Correct 96 ms 2588 KB Output is correct
34 Correct 92 ms 2588 KB Output is correct
35 Correct 82 ms 2588 KB Output is correct
36 Correct 135 ms 2588 KB Output is correct
37 Correct 2 ms 2588 KB Output is correct
38 Correct 3 ms 2588 KB Output is correct
39 Correct 65 ms 2588 KB Output is correct
40 Correct 60 ms 2588 KB Output is correct
41 Correct 33 ms 2588 KB Output is correct
42 Correct 83 ms 2588 KB Output is correct
43 Correct 74 ms 2588 KB Output is correct
44 Correct 3 ms 2588 KB Output is correct
45 Correct 17 ms 2588 KB Output is correct
46 Correct 14 ms 2588 KB Output is correct
47 Correct 13 ms 2588 KB Output is correct
48 Correct 134 ms 2588 KB Output is correct
49 Correct 184 ms 2588 KB Output is correct
50 Correct 2 ms 2588 KB Output is correct
51 Correct 148 ms 2296 KB Output is correct
52 Correct 88 ms 2296 KB Output is correct
53 Correct 73 ms 2296 KB Output is correct
54 Correct 12 ms 2296 KB Output is correct
55 Correct 13 ms 2296 KB Output is correct
56 Correct 4 ms 2296 KB Output is correct
57 Correct 11 ms 2296 KB Output is correct
58 Correct 2 ms 2296 KB Output is correct
59 Correct 11 ms 2296 KB Output is correct
60 Correct 11 ms 2296 KB Output is correct
61 Correct 11 ms 2296 KB Output is correct
62 Correct 3 ms 2296 KB Output is correct
63 Correct 13 ms 2296 KB Output is correct