Submission #257383

#	Time	Username	Problem	Language	Result	Execution time	Memory
257383		KoD	Travelling Merchant (APIO17_merchant)	C++17	0 / 100	99 ms	3320 KiB

merchant

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <queue>
#include <cassert>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = typename std::decay<T>::type::reverse_iterator;

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 18 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  i32 N, M, K;
  std::cin >> N >> M >> K;
  std::vector<std::vector<i32>> buy(N, std::vector<i32>(K));
  std::vector<std::vector<i32>> sell(N, std::vector<i32>(K));
  for (auto i: range(0, N)) {
    for (auto k: range(0, K)) {
      std::cin >> buy[i][k] >> sell[i][k];
      if (i != 0) {
        assert(buy[i][k] == -1);
      }
    }
  }
  std::vector<std::vector<std::pair<i32, i32>>> graph(N);
  for (auto i: range(0, M)) {
    i32 u, v, c;
    std::cin >> u >> v >> c;
    graph[u].emplace_back(v, c);
  }
  auto dijkstra = [&](i32 src) { 
    std::vector<i32> dist(N, inf32);
    dist[src] = 0;
    std::priority_queue<std::pair<i32, i32>, std::vector<std::pair<i32, i32>>, std::greater<std::pair<i32, i32>>> que;
    que.emplace(dist[src], src);
    while (!que.empty()) {
      auto [d, u] = que.top();
      que.pop();
      for (auto [v, c]: graph[u]) {
        if (chmin(dist[v], dist[u] + c)) {
          que.emplace(dist[v], v);
        }
      }
    }
    return dist;
  };
  std::vector<std::vector<i32>> dist(N);
  for (auto i: range(0, N)) {
    dist[i] = dijkstra(i);
  }
  i32 max = 0;
  for (auto i: range(1, N)) {
    for (auto k: range(0, K)) {
      if (buy[0][k] != -1 && sell[i][k] != -1) {
        chmax(max, (sell[i][k] - buy[0][k]) / (dist[0][k] + dist[k][0]));
      }
    }
  }
  std::cout << max << '\n';
  return 0;
}

Compilation message (stderr)

main.cpp: In function 'int main()':
main.cpp:41:13: warning: unused variable 'i' [-Wunused-variable]
main.cpp: In lambda function:
main.cpp:52:17: warning: unused variable 'd' [-Wunused-variable]

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