제출 #775625

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775625		vjudge1	여행하는 상인 (APIO17_merchant)	C++17	12 / 100	13 ms	1108 KiB

merchant

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "C:\GCC\debug.h"
#else
#define debug(...) void(42)
#endif

const long long inf = 1000000000000000;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n, m, k;
  cin >> n >> m >> k;

  vector<vector<int>> b(n, vector<int> (k));
  vector<vector<int>> s(n, vector<int> (k));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < k; j++) {
      cin >> b[i][j] >> s[i][j];
    }
  }

  vector<vector<array<int, 2>>> adj(n);
  for (int i = 0; i < m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    --u, --v;
    adj[u].push_back({v, w});
  }

  auto Dijkstra = [&](int start) {
    vector<long long> d(n, inf);
    d[start] = 0;

    priority_queue<array<long long, 2>, vector<array<long long, 2>>, greater<array<long long, 2>>> pQue;
    pQue.push({d[start], start});

    while (!pQue.empty()) {
      auto x = pQue.top();
      pQue.pop();

      int u = x[1];
      long long dist = x[0];

      if (d[u] != dist) {
        continue;
      }

      for (auto v : adj[u]) {
        if (d[v[0]] > dist + v[1]) {
          d[v[0]] = dist + v[1];
          pQue.push({d[v[0]], v[0]});
        }
      }
    }
    return d;
  };

  vector<vector<long long>> ds(n);
  for (int i = 0; i < n; i++) {
    ds[i] = Dijkstra(i);
  }

  long long res = 0;

  for (int j = 0; j < k; j++) {
    if (b[0][j] == -1) {
      continue;
    }
    for (int i = 1; i < n; i++) {
      if (s[i][j] > -1) {
        res = max(res, (s[i][j] - b[0][j]) / (ds[0][i] + ds[i][0]));
      }
    }
  }
  cout << res << '\n';

  return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 21
• Subtask 3: 0 / 33
• Subtask 4: 0 / 34