Submission #259541

#	Time	Username	Problem	Language	Result	Execution time	Memory
259541		KoD	Palembang Bridges (APIO15_bridge)	C++17	31 / 100	2076 ms	4452 KiB

bridge

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#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 2 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp"

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

template <class Func>
struct fix_point_impl: private Func {
  explicit constexpr fix_point_impl(Func &&func): Func(std::forward<Func>(func)) { }
  template <class... Args>
  constexpr decltype(auto) operator () (Args &&... args) const {
    return Func::operator()(*this, std::forward<Args>(args)...);
  }
};

template <class Func>
constexpr decltype(auto) fix_point(Func &&func) {
  return fix_point_impl<Func>(std::forward<Func>(func));
}

/**
 * @title Lambda Recursion
 */
#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 K, N;
  std::cin >> K >> N;
  i64 base_ans = 0;
  std::vector<std::pair<i32, i32>> place;
  std::vector<i32> coord;
  for (auto i: range(0, N)) {
    char z1, z2;
    i32 p1, p2;
    std::cin >> z1 >> p1 >> z2 >> p2;
    if (p1 > p2) {
      std::swap(p1, p2);
    }
    if (z1 == z2) {
      base_ans += p2 - p1;
    }
    else {
      place.emplace_back(p1, p2);
      coord.push_back(p1);
      coord.push_back(p2);
      base_ans += p2 - p1 + 1;
    }
  }
  std::sort(coord.begin(), coord.end());
  if (place.empty()) {
    std::cout << base_ans << '\n';
    return 0;
  }
  if (K == 1) {
    i32 x = coord[coord.size() / 2];
    i64 add_ans = 0;
    for (auto [p, q]: place) {
      i64 min = inf64;
      if (p <= x && x <= q) {
        chmin(min, 0);
      }
      if (x < p) {
        chmin(min, 2 * (p - x));
      }
      if (x > q) {
        chmin(min, 2 * (x - q));
      }
      add_ans += min;
    }
    std::cout << base_ans + add_ans << '\n';
    return 0;
  }
  else {
    i64 add_ans = inf64;
    for (auto i: range(0, coord.size())) {
      for (auto j: range(0, i)) {
        i64 sum = 0;
        for (auto [p, q]: place) {
          i64 min = inf64;
          for (auto x: { coord[j], coord[i] }) {
            if (p <= x && x <= q) {
              chmin(min, 0);
            }
            if (x < p) {
              chmin(min, 2 * (p - x));
            }
            if (x > q) {
              chmin(min, 2 * (x - q));
            }
          }
          sum += min;
        }
        chmin(add_ans, sum);
      }
    }
    std::cout << base_ans + add_ans << '\n';
    return 0;
  }
  return 0;
}

Compilation message (stderr)

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

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 9 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37