Submission #49583

# Submission time Handle Problem Language Result Execution time Memory
49583 2018-05-31T14:44:10 Z model_code Travelling Merchant (APIO17_merchant) C++17
100 / 100
237 ms 1792 KB
#include <iostream>
#include <vector>
#include <climits>

using namespace std;

int N, M, K;
vector<vector<long long>> dist;
vector<vector<long long>> grid;

vector<vector<int>> buy;
vector<vector<int>> sell;

vector<vector<int>> earn;


bool test(long long salary) {
  grid = vector<vector<long long>>(N, vector<long long>(N, LLONG_MAX/2));

  for (int i=0;i<N;i++) {
    for (int j=0;j<N;j++) {
      if (dist[i][j] < LLONG_MAX/2) {
        grid[i][j] = dist[i][j] * salary - earn[i][j];
      }
    }
  }

  for (int k=0;k<N;k++) {
    for (int i=0;i<N;i++) {
      for (int j=0;j<N;j++) {
        grid[i][j] = min(grid[i][j], grid[i][k] + grid[k][j]);
      }
    }
  }

  for (int i=0;i<N;i++) {
    if (grid[i][i] <= 0) return true;
  }
  return false;
}

int bsearch(int mn, int mx) {
  if (mn == mx) return mn;

  int md = (mn+mx+1)/2;

  if (test(md)) {
    return bsearch(md,mx);
  }
  else {
    return bsearch(mn,md-1);
  }
}

int main() {
  cin >> N >> M >> K;

  dist = vector<vector<long long>>(N, vector<long long>(N, LLONG_MAX/2));
  buy = vector<vector<int>>(N, vector<int>(K, -1));
  sell = vector<vector<int>>(N, vector<int>(K, -1));
  earn = vector<vector<int>>(N, vector<int>(N, 0));

  for (int i=0;i<N;i++) {
    //dist[i][i] = 0;
    for (int j=0;j<K;j++) {
      cin >> buy[i][j] >> sell[i][j];
    }
  }

  for (int i=0;i<M;i++) {
    int V, W, T;

    cin >> V >> W >> T;
    V--;
    W--;

    dist[V][W] = min<long long>(dist[V][W], T);
  }

  for (int k=0;k<N;k++) {
    for (int i=0;i<N;i++) {
      for (int j=0;j<N;j++) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }
  
  for (int i=0;i<N;i++) {
    for (int j=0;j<N;j++) {
      for (int k=0;k<K;k++) {
        if (sell[j][k] != -1 && buy[i][k] != -1) {
          earn[i][j] = max(earn[i][j], sell[j][k] - buy[i][k]);
        }
      }
    }
  }

  cout << bsearch(0, 1000000000) << endl;

  
}
# Verdict Execution time Memory Grader output
1 Correct 151 ms 1460 KB Output is correct
2 Correct 46 ms 1460 KB Output is correct
3 Correct 45 ms 1460 KB Output is correct
4 Correct 8 ms 1460 KB Output is correct
5 Correct 8 ms 1460 KB Output is correct
6 Correct 8 ms 1460 KB Output is correct
7 Correct 10 ms 1460 KB Output is correct
8 Correct 2 ms 1460 KB Output is correct
9 Correct 9 ms 1460 KB Output is correct
10 Correct 8 ms 1460 KB Output is correct
11 Correct 8 ms 1460 KB Output is correct
12 Correct 2 ms 1460 KB Output is correct
13 Correct 11 ms 1460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 1460 KB Output is correct
2 Correct 9 ms 1460 KB Output is correct
3 Correct 16 ms 1460 KB Output is correct
4 Correct 9 ms 1460 KB Output is correct
5 Correct 12 ms 1460 KB Output is correct
6 Correct 3 ms 1460 KB Output is correct
7 Correct 14 ms 1460 KB Output is correct
8 Correct 11 ms 1460 KB Output is correct
9 Correct 9 ms 1460 KB Output is correct
10 Correct 9 ms 1460 KB Output is correct
11 Correct 10 ms 1460 KB Output is correct
12 Correct 19 ms 1460 KB Output is correct
13 Correct 12 ms 1460 KB Output is correct
14 Correct 10 ms 1460 KB Output is correct
15 Correct 13 ms 1460 KB Output is correct
16 Correct 14 ms 1460 KB Output is correct
17 Correct 10 ms 1460 KB Output is correct
18 Correct 2 ms 1460 KB Output is correct
19 Correct 12 ms 1460 KB Output is correct
20 Correct 11 ms 1460 KB Output is correct
21 Correct 12 ms 1460 KB Output is correct
22 Correct 13 ms 1460 KB Output is correct
23 Correct 8 ms 1460 KB Output is correct
24 Correct 8 ms 1460 KB Output is correct
25 Correct 10 ms 1460 KB Output is correct
26 Correct 2 ms 1460 KB Output is correct
27 Correct 9 ms 1460 KB Output is correct
28 Correct 8 ms 1460 KB Output is correct
29 Correct 8 ms 1460 KB Output is correct
30 Correct 2 ms 1460 KB Output is correct
31 Correct 11 ms 1460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 58 ms 1460 KB Output is correct
2 Correct 237 ms 1664 KB Output is correct
3 Correct 50 ms 1664 KB Output is correct
4 Correct 61 ms 1664 KB Output is correct
5 Correct 61 ms 1664 KB Output is correct
6 Correct 49 ms 1664 KB Output is correct
7 Correct 10 ms 1460 KB Output is correct
8 Correct 2 ms 1460 KB Output is correct
9 Correct 12 ms 1460 KB Output is correct
10 Correct 11 ms 1460 KB Output is correct
11 Correct 12 ms 1460 KB Output is correct
12 Correct 13 ms 1460 KB Output is correct
13 Correct 8 ms 1460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 1460 KB Output is correct
2 Correct 9 ms 1460 KB Output is correct
3 Correct 16 ms 1460 KB Output is correct
4 Correct 9 ms 1460 KB Output is correct
5 Correct 12 ms 1460 KB Output is correct
6 Correct 3 ms 1460 KB Output is correct
7 Correct 14 ms 1460 KB Output is correct
8 Correct 11 ms 1460 KB Output is correct
9 Correct 9 ms 1460 KB Output is correct
10 Correct 9 ms 1460 KB Output is correct
11 Correct 10 ms 1460 KB Output is correct
12 Correct 19 ms 1460 KB Output is correct
13 Correct 12 ms 1460 KB Output is correct
14 Correct 10 ms 1460 KB Output is correct
15 Correct 13 ms 1460 KB Output is correct
16 Correct 14 ms 1460 KB Output is correct
17 Correct 58 ms 1460 KB Output is correct
18 Correct 237 ms 1664 KB Output is correct
19 Correct 50 ms 1664 KB Output is correct
20 Correct 61 ms 1664 KB Output is correct
21 Correct 61 ms 1664 KB Output is correct
22 Correct 49 ms 1664 KB Output is correct
23 Correct 10 ms 1460 KB Output is correct
24 Correct 2 ms 1460 KB Output is correct
25 Correct 12 ms 1460 KB Output is correct
26 Correct 11 ms 1460 KB Output is correct
27 Correct 12 ms 1460 KB Output is correct
28 Correct 13 ms 1460 KB Output is correct
29 Correct 8 ms 1460 KB Output is correct
30 Correct 46 ms 1664 KB Output is correct
31 Correct 51 ms 1664 KB Output is correct
32 Correct 86 ms 1664 KB Output is correct
33 Correct 47 ms 1664 KB Output is correct
34 Correct 49 ms 1664 KB Output is correct
35 Correct 46 ms 1664 KB Output is correct
36 Correct 173 ms 1792 KB Output is correct
37 Correct 2 ms 1792 KB Output is correct
38 Correct 2 ms 1792 KB Output is correct
39 Correct 45 ms 1792 KB Output is correct
40 Correct 55 ms 1792 KB Output is correct
41 Correct 43 ms 1792 KB Output is correct
42 Correct 43 ms 1792 KB Output is correct
43 Correct 41 ms 1792 KB Output is correct
44 Correct 2 ms 1792 KB Output is correct
45 Correct 19 ms 1792 KB Output is correct
46 Correct 16 ms 1792 KB Output is correct
47 Correct 16 ms 1792 KB Output is correct
48 Correct 213 ms 1792 KB Output is correct
49 Correct 177 ms 1792 KB Output is correct
50 Correct 2 ms 1792 KB Output is correct
51 Correct 151 ms 1460 KB Output is correct
52 Correct 46 ms 1460 KB Output is correct
53 Correct 45 ms 1460 KB Output is correct
54 Correct 8 ms 1460 KB Output is correct
55 Correct 8 ms 1460 KB Output is correct
56 Correct 8 ms 1460 KB Output is correct
57 Correct 10 ms 1460 KB Output is correct
58 Correct 2 ms 1460 KB Output is correct
59 Correct 9 ms 1460 KB Output is correct
60 Correct 8 ms 1460 KB Output is correct
61 Correct 8 ms 1460 KB Output is correct
62 Correct 2 ms 1460 KB Output is correct
63 Correct 11 ms 1460 KB Output is correct