oj.uz

답안 #653061

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
653061 2022-10-25T14:39:38 Z pauloamed 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 85 ms 2120 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int MAXN = 101;
const int MAXK = 1001;

int sell[MAXN][MAXK];
int buy[MAXN][MAXK];

int p1[MAXN][MAXN];
int best[MAXN][MAXN];

int p2[MAXN][MAXN];

const int INF = LLONG_MAX / 2;

int sum(int a, int b){
  return a + b;
}

bool test(int r, int n){
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < n; ++j){
      p2[i][j] = best[i][j] - r * min(p1[i][j], INF/r);
    }
  }

  for(int k = 0; k < n; k++){
    for(int i = 0; i < n; i++){
      for(int j = 0; j < n; j++){
        p2[i][j] = max(p2[i][j], sum(p2[i][k], p2[k][j]));
      }
    }
  }

  for(int i = 0; i < n; ++i){
    // cout << r << " : " << i << " : " << p2[i][i] << endl;
    if(p2[i][i] >= 0) return true;
  }
  return false;
}

int32_t main(){
  cin.tie(NULL)->sync_with_stdio(false);
  int n, m, k; cin >> n >> m >> k;
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < k; ++j){
      cin >> buy[i][j];
      cin >> sell[i][j];
    }
  }

  for(int i = 0; i < n; ++i){
    for(int j = 0; j < n; ++j){
      p1[i][j] = INF;
    }
  }

  for(int i = 0; i < m; ++i){
    int a, b, c; cin >> a >> b >> c;
    a--; b--;
    p1[a][b] = c;
  }


  for(int i = 0; i < n; ++i){
    for(int j = 0; j < n; ++j){
      for(int l = 0; l < k; ++l){
        if(buy[i][l] > -1 && sell[j][l] > -1){
          int prof = sell[j][l] - buy[i][l];
          best[i][j] = max(prof, best[i][j]);
        }
      }
    }
  }

  {
    for(int l = 0; l < n; l++){
      for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
          p1[i][j] = min(p1[i][j], sum(p1[i][l], p1[l][j]));
        }
      }
    }
  }

  int ans = 0;
  int pot = (1LL << 30);
  while(pot){
    int mans = ans + pot;
    if(test(mans, n)) ans = mans;
    pot /= 2;
  }
  cout << ans << "\n";
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 2004 KB Output is correct
2 Correct 34 ms 1236 KB Output is correct
3 Correct 34 ms 1236 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 6 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 5 ms 864 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 6 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 6 ms 852 KB Output is correct
21 Correct 5 ms 724 KB Output is correct
22 Correct 5 ms 800 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 5 ms 724 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 6 ms 892 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 5 ms 848 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 6 ms 892 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 5 ms 848 KB Output is correct
8 Correct 38 ms 1492 KB Output is correct
9 Correct 79 ms 2112 KB Output is correct
10 Correct 36 ms 1364 KB Output is correct
11 Correct 40 ms 1492 KB Output is correct
12 Correct 41 ms 1492 KB Output is correct
13 Correct 35 ms 1428 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 5 ms 864 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 5 ms 724 KB Output is correct
14 Correct 5 ms 800 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 38 ms 1492 KB Output is correct
18 Correct 79 ms 2112 KB Output is correct
19 Correct 36 ms 1364 KB Output is correct
20 Correct 40 ms 1492 KB Output is correct
21 Correct 41 ms 1492 KB Output is correct
22 Correct 35 ms 1428 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 6 ms 892 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 5 ms 848 KB Output is correct
30 Correct 54 ms 2004 KB Output is correct
31 Correct 34 ms 1236 KB Output is correct
32 Correct 34 ms 1236 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 36 ms 1364 KB Output is correct
44 Correct 37 ms 1512 KB Output is correct
45 Correct 50 ms 2112 KB Output is correct
46 Correct 34 ms 1500 KB Output is correct
47 Correct 37 ms 1504 KB Output is correct
48 Correct 36 ms 1492 KB Output is correct
49 Correct 83 ms 1992 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 37 ms 1236 KB Output is correct
53 Correct 37 ms 1236 KB Output is correct
54 Correct 34 ms 1364 KB Output is correct
55 Correct 33 ms 1380 KB Output is correct
56 Correct 33 ms 1332 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 8 ms 852 KB Output is correct
59 Correct 7 ms 928 KB Output is correct
60 Correct 7 ms 852 KB Output is correct
61 Correct 85 ms 2120 KB Output is correct
62 Correct 85 ms 2120 KB Output is correct
63 Correct 1 ms 340 KB Output is correct