Submission #341594

#	Time	Username	Problem	Language	Result	Execution time	Memory
341594		KoD	Bulldozer (JOI17_bulldozer)	C++17	25 / 100	296 ms	508 KiB

bulldozer

#line 1 "main.cpp"

/**
 * @title Template
 */

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

#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

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

class range {
  struct iter {
    std::size_t itr;
    constexpr iter(std::size_t pos) noexcept: itr(pos) { }
    constexpr void operator ++ () noexcept { ++itr; }
    constexpr bool operator != (iter other) const noexcept { return itr != other.itr; }
    constexpr std::size_t operator * () const noexcept { return itr; }
  };

  struct reviter {
    std::size_t itr;
    constexpr reviter(std::size_t pos) noexcept: itr(pos) { }
    constexpr void operator ++ () noexcept { --itr; }
    constexpr bool operator != (reviter other) const noexcept { return itr != other.itr; }
    constexpr std::size_t operator * () const noexcept { return itr; }
  };

  const iter first, last;

public:
  constexpr range(std::size_t first, std::size_t last) noexcept: first(first), last(std::max(first, last)) { }
  constexpr iter begin() const noexcept { return first; }
  constexpr iter end() const noexcept { return last; }
  constexpr reviter rbegin() const noexcept { return reviter(*last - 1); } 
  constexpr reviter rend() const noexcept { return reviter(*first - 1); } 
};

/**
 * @title Range
 */
#line 16 "main.cpp"

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr i32 inf32 = (u32) ~0 >> 2;
constexpr i64 inf64 = (u64) ~0 >> 2;

template <class T>
using Vec = std::vector<T>;

int main() {
  usize N;
  std::cin >> N;
  assert(N <= 100);
  Vec<i64> X(N), Y(N), W(N);
  for (auto i: range(0, N)) {
    std::cin >> X[i] >> Y[i] >> W[i];
  }
  if (std::count(Y.begin(), Y.end(), 0) == (isize) N) {
    std::map<i64, i64> map;
    for (auto i: range(0, N)) {
      map[X[i]] += W[i];
    }
    i64 ans = 0;
    i64 sum = 0;
    i64 min = 0;
    for (const auto [_, w]: map) {
      sum += w;
      min = std::min(min, sum);
      ans = std::max(ans, sum - min);
    }
    std::cout << ans << '\n';
    return 0;
  }
  i64 ans = 0;
  for (auto i: range(0, N)) {
    ans = std::max(ans, W[i]);
  }
  for (auto i: range(0, N)) {
    for (auto j: range(0, N)) {
      if (i == j) {
        continue;
      }
      const auto a = (Y[i] - Y[j]);
      const auto b = (X[j] - X[i]);
      {
        std::map<i64, i64> map;
        for (auto k: range(0, N)) {
          map[a * X[k] + b * Y[k]] += W[k];
        }
        i64 min = 0;
        i64 sum = 0;
        for (const auto [_, w]: map) {
          sum += w;
          ans = std::max(ans, sum - min);
          min = std::min(min, sum);
        }
      }
      {
        std::map<i64, i64> map;
        for (auto k: range(0, N)) {
          if (j != k) {
            map[a * X[k] + b * Y[k]] += W[k];
          }
        }
        Vec<std::pair<i64, i64>> vec;
        for (const auto p: map) {
          vec.emplace_back(p.first, p.second);
        }
        const usize idx = std::lower_bound(vec.begin(), vec.end(), std::make_pair(a * X[i] + b * Y[i], -inf64)) - vec.begin();
        {
          i64 sum = vec[idx].second;
          ans = std::max(ans, sum);
          for (auto x = idx; x --> 0;) {
            sum += vec[x].second;
            ans = std::max(ans, sum);
          }
        }
        {
          i64 sum = vec[idx].second;
          ans = std::max(ans, sum);
          for (auto x = idx; ++x < vec.size();) {
            sum += vec[x].second;
            ans = std::max(ans, sum);
          }
        }
      }
    }
  }
  std::cout << ans << '\n';
  return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 20 / 20
• Subtask 3: 0 / 35
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20