oj.uz

답안 #57325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57325 2018-07-14T14:43:09 Z joaogui1 여행하는 상인 (APIO17_merchant) C++14
12 / 100
 124 ms 2532 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define INF (1LL << 32)

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

int n;
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]);
}


bool fw(ll r){

  for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= n; ++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){
        //dist[i][j] |= (dist[i][k] && dist[k][j]);
        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)
        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);
  ll ans = 0, test = 0;
  int m, k, a, b, c;
  cin >> n >> m >> k;
  memset(dist, 0, sizeof dist);
  for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= n; ++j)
      g[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;
      if(itens[i][j].ff == -1)  itens[i][j].ff = INF;
      if(itens[i][j].ss == -1)  itens[i][j].ss = -INF;
    }
  }
  pre_calc(k);

  for(int i = 0; i < m; ++i){
    cin >> a >> b >> c;
    g[a][b] = c;
  }
  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);
  cout << ans << "\n";

  return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 2296 KB Output is correct
2 Correct 46 ms 2296 KB Output is correct
3 Correct 84 ms 2296 KB Output is correct
4 Correct 11 ms 2296 KB Output is correct
5 Correct 14 ms 2296 KB Output is correct
6 Correct 3 ms 2296 KB Output is correct
7 Correct 8 ms 2296 KB Output is correct
8 Correct 2 ms 2296 KB Output is correct
9 Correct 10 ms 2296 KB Output is correct
10 Correct 12 ms 2296 KB Output is correct
11 Correct 10 ms 2296 KB Output is correct
12 Correct 3 ms 2296 KB Output is correct
13 Correct 9 ms 2296 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2296 KB Output is correct
2 Correct 8 ms 2296 KB Output is correct
3 Correct 6 ms 2296 KB Output is correct
4 Correct 5 ms 2296 KB Output is correct
5 Correct 9 ms 2296 KB Output is correct
6 Correct 2 ms 2296 KB Output is correct
7 Correct 5 ms 2296 KB Output is correct
8 Correct 7 ms 2296 KB Output is correct
9 Correct 10 ms 2296 KB Output is correct
10 Correct 10 ms 2296 KB Output is correct
11 Correct 10 ms 2296 KB Output is correct
12 Correct 8 ms 2296 KB Output is correct
13 Correct 8 ms 2296 KB Output is correct
14 Correct 11 ms 2296 KB Output is correct
15 Correct 9 ms 2296 KB Output is correct
16 Correct 8 ms 2296 KB Output is correct
17 Correct 7 ms 2296 KB Output is correct
18 Correct 3 ms 2296 KB Output is correct
19 Incorrect 10 ms 2296 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 2296 KB Output is correct
2 Correct 103 ms 2532 KB Output is correct
3 Correct 49 ms 2532 KB Output is correct
4 Correct 56 ms 2532 KB Output is correct
5 Incorrect 47 ms 2532 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2296 KB Output is correct
2 Correct 8 ms 2296 KB Output is correct
3 Correct 6 ms 2296 KB Output is correct
4 Correct 5 ms 2296 KB Output is correct
5 Correct 9 ms 2296 KB Output is correct
6 Correct 2 ms 2296 KB Output is correct
7 Correct 5 ms 2296 KB Output is correct
8 Correct 7 ms 2296 KB Output is correct
9 Correct 10 ms 2296 KB Output is correct
10 Correct 10 ms 2296 KB Output is correct
11 Correct 10 ms 2296 KB Output is correct
12 Correct 8 ms 2296 KB Output is correct
13 Correct 8 ms 2296 KB Output is correct
14 Correct 11 ms 2296 KB Output is correct
15 Correct 9 ms 2296 KB Output is correct
16 Correct 8 ms 2296 KB Output is correct
17 Correct 53 ms 2296 KB Output is correct
18 Correct 103 ms 2532 KB Output is correct
19 Correct 49 ms 2532 KB Output is correct
20 Correct 56 ms 2532 KB Output is correct
21 Incorrect 47 ms 2532 KB Output isn't correct
22 Halted 0 ms 0 KB -