oj.uz

답안 #257524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257524 2020-08-04T11:31:03 Z KoD 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 224 ms 3320 KB 
#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];
    }
  }
  std::vector<std::vector<i32>> gain(N, std::vector<i32>(N));
  for (auto i: range(0, N)) {
    for (auto j: range(0, N)) {
      for (auto k: range(0, K)) {
        if (sell[j][k] != -1 && buy[i][k] != -1) {
          chmax(gain[i][j], - buy[i][k] + sell[j][k]);
        }
      }
    }
  }

  std::vector<std::vector<i32>> cost(N, std::vector<i32>(N, inf32));
  for (auto i: range(0, N)) {
    cost[i][i] = 0;
  }
  for (auto i: range(0, M)) {
    i32 u, v, c;
    std::cin >> u >> v >> c;
    --u; --v;
    cost[u][v] = c;
  }
  for (auto k: range(0, N)) {
    for (auto i: range(0, N)) {
      for (auto j: range(0, N)) {
        chmin(cost[i][j], cost[i][k] + cost[k][j]);
      }
    }
  }

  i64 ok = 0, ng = (i64) inf32;
  while (ng - ok > 1) {
    i64 md = (ok + ng) / 2;
    std::vector<std::vector<i64>> dist(N, std::vector<i64>(N, -inf64));
    for (auto i: range(0, N)) {
      for (auto j: range(0, N)) {
        if (cost[i][j] != inf32 && i != j) {
          dist[i][j] = gain[i][j] - md * cost[i][j];
        }
      }
    }
    for (auto k: range(0, N)) {
      for (auto i: range(0, N)) {
        for (auto j: range(0, N)) {
          chmax(dist[i][j], dist[i][k] + dist[k][j]);
        }
      }
    }
    bool flag = false;
    for (auto i: range(0, N)) {
      if (dist[i][i] >= 0) {
        flag = true;
        break;
      }
    }
    (flag ? ok : ng) = md;
  }
  std::cout << ok << '\n';
  return 0;
}

Compilation message

main.cpp: In function 'int main()':
main.cpp:54:13: warning: unused variable 'i' [-Wunused-variable]

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 1316 KB Output is correct
2 Correct 35 ms 512 KB Output is correct
3 Correct 33 ms 512 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 8 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 8 ms 384 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 616 KB Output is correct
2 Correct 224 ms 1144 KB Output is correct
3 Correct 85 ms 512 KB Output is correct
4 Correct 122 ms 632 KB Output is correct
5 Correct 118 ms 768 KB Output is correct
6 Correct 54 ms 640 KB Output is correct
7 Correct 17 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 18 ms 452 KB Output is correct
10 Correct 12 ms 384 KB Output is correct
11 Correct 11 ms 384 KB Output is correct
12 Correct 8 ms 384 KB Output is correct
13 Correct 7 ms 384 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 14 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 10 ms 384 KB Output is correct
12 Correct 10 ms 384 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 8 ms 384 KB Output is correct
15 Correct 12 ms 512 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 108 ms 616 KB Output is correct
18 Correct 224 ms 1144 KB Output is correct
19 Correct 85 ms 512 KB Output is correct
20 Correct 122 ms 632 KB Output is correct
21 Correct 118 ms 768 KB Output is correct
22 Correct 54 ms 640 KB Output is correct
23 Correct 17 ms 384 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 18 ms 452 KB Output is correct
26 Correct 12 ms 384 KB Output is correct
27 Correct 11 ms 384 KB Output is correct
28 Correct 8 ms 384 KB Output is correct
29 Correct 7 ms 384 KB Output is correct
30 Correct 40 ms 572 KB Output is correct
31 Correct 44 ms 616 KB Output is correct
32 Correct 88 ms 1656 KB Output is correct
33 Correct 40 ms 640 KB Output is correct
34 Correct 41 ms 640 KB Output is correct
35 Correct 41 ms 640 KB Output is correct
36 Correct 198 ms 3192 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 38 ms 512 KB Output is correct
40 Correct 43 ms 640 KB Output is correct
41 Correct 37 ms 512 KB Output is correct
42 Correct 36 ms 512 KB Output is correct
43 Correct 36 ms 512 KB Output is correct
44 Correct 0 ms 256 KB Output is correct
45 Correct 13 ms 512 KB Output is correct
46 Correct 13 ms 512 KB Output is correct
47 Correct 12 ms 512 KB Output is correct
48 Correct 182 ms 3316 KB Output is correct
49 Correct 188 ms 3320 KB Output is correct
50 Correct 1 ms 256 KB Output is correct
51 Correct 134 ms 1316 KB Output is correct
52 Correct 35 ms 512 KB Output is correct
53 Correct 33 ms 512 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 8 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 8 ms 384 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 6 ms 384 KB Output is correct
61 Correct 6 ms 384 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 8 ms 384 KB Output is correct