結果

問題 No.703 ゴミ拾い Easy
ユーザー ei1333333ei1333333
提出日時 2021-10-22 14:48:56
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 502 ms / 1,500 ms
コード長 4,494 bytes
コンパイル時間 2,568 ms
コンパイル使用メモリ 206,512 KB
最終ジャッジ日時 2025-01-25 02:49:31
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 46
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /usr/include/c++/13/bits/stl_algobase.h:64,
                 from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from main.cpp:1:
In member function ‘std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::__conditional_t<std::__and_<std::is_move_assignable<_Tp>, std::is_move_assignable<_T2> >::value, std::pair<_T1, _T2>&&, std::__nonesuch&&>) [with _T1 = int; _T2 = long int]’,
    inlined from ‘monotone_minima<long int, std::less<long int> >(int, int, const std::function<long int(int, int)>&, const std::less<long int>&)::<lambda(int, int, int, int)>’ at dp/monotone-minima.cpp:21:14,
    inlined from ‘constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = monotone_minima<long int, std::less<long int> >(int, int, const std::function<long int(int, int)>&, const std::less<long int>&)::<lambda(int, int, int, int)>&; _Args = {int, int, int, int}]’ at /usr/include/c++/13/bits/invoke.h:61:36,
    inlined from ‘constexpr std::enable_if_t<is_invocable_r_v<_Res, _Callable, _Args ...>, _Res> std::__invoke_r(_Callable&&, _Args&& ...) [with _Res = void; _Callable = monotone_minima<long int, std::less<long int> >(int, int, const std::function<long int(int, int)>&, const std::less<long int>&)::<lambda(int, int, int, int)>&; _Args = {int, int, int, int}]’ at /usr/include/c++/13/bits/invoke.h:111:28,
    inlined from ‘static _Res std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_invoke(const std::_Any_data&, _ArgTypes&& ...) [with _Res = void; _Functor = monotone_minima<long int, std::less<long int> >(int, int, const std::function<long int(int, int)>&, const std::less<long int>&)::<lambda(int, int, int, int)>; _ArgTypes = {int, int, int, int}]’ at /usr/include/c++/13/bits/std_function.h:290:30:
/usr/include/c++/13/bits/stl_pair.h:744:16: warning: ‘ma’ may be used uninitialized [-Wmaybe-uninitialized]
  744 |

ソースコード

diff # 

#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template<typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template<typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template<typename... Args>
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template<typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}

#line 1 "dp/monotone-minima.cpp"

/**
 * @brief Monotone Minima
 * @docs docs/monotone-minima.md
 */
template<typename T, typename Compare = less<T> >
vector<pair<int, T> > monotone_minima(int H, int W, const function<T(int, int)> &f, const Compare &comp = Compare()) {
  vector<pair<int, T> > dp(H);
  function<void(int, int, int, int)> dfs = [&](int top, int bottom, int left, int right) {
    if (top > bottom) return;
    int line = (top + bottom) / 2;
    T ma;
    int mi = -1;
    for (int i = left; i <= right; i++) {
      T cst = f(line, i);
      if (mi == -1 || comp(cst, ma)) {
        ma = cst;
        mi = i;
      }
    }
    dp[line] = make_pair(mi, ma);
    dfs(top, line - 1, left, mi);
    dfs(line + 1, bottom, mi, right);
  };
  dfs(0, H - 1, 0, W - 1);
  return dp;
}

#line 2 "dp/online-offline-dp.cpp"

/**
 * @brief  Online Offline DP(オンライン・オフライン変換)
 * @docs docs/online-offline-dp.md
 */
template<typename T, typename Compare = less<T> >
vector<T> online_offline_dp(int W, const function<T(int, int)> &f, const T& INF, const Compare &comp = Compare()) {
  vector<T> dp(W + 1, INF);
  dp[0] = T();
  int y_base = -1, x_base = -1;
  function<T(int, int)> get_cost = [&](int y, int x) { // return dp[0, x+x_base)+f[x+x_base, y+y_base)
    if(dp[x + x_base] == INF) return INF;
    else return dp[x + x_base] + f(x + x_base, y + y_base);
  };
  function<void(int, int, int)> induce = [&](int l, int m, int r) { // dp[l, m) -> dp[m, r)
    x_base = l, y_base = m;
    auto ret = monotone_minima(r - m, m - l, get_cost, comp);
    for (int i = 0; i < ret.size(); i++) {
      if (comp(ret[i].second, dp[m + i])) {
        dp[m + i] = ret[i].second;
      }
    }
  };
  auto dfs = [&](auto dfs, int l, int r) -> void {
    if (l + 1 == r) {
      x_base = l, y_base = l;
      T cst = l ? get_cost(0, -1) : 0;
      if (comp(cst, dp[l])) dp[l] = cst;
    } else {
      int mid = (l + r) / 2;
      dfs(dfs, l, mid);
      induce(l, mid, r);
      dfs(dfs, mid, r);
    }
  };
  dfs(dfs, 0, W + 1);
  return dp;
};

int main() {
  int n;
  cin >> n;
  vector< int > a(n), x(n), y(n);
  for(int i = 0; i < n; i++) cin >> a[i];
  for(int i = 0; i < n; i++) cin >> x[i];
  for(int i = 0; i < n; i++) cin >> y[i];
  function< int64_t(int, int) > dist = [&](int i, int j) {
    assert(0 <= i && i < j && j <= n);
    int s = abs(a[j - 1] - x[i]);
    int t = abs(y[i]);
    return 1LL * s * s + 1LL * t * t;
  };
  cout << online_offline_dp< int64_t >(n, dist, 1ll<<60).back() << endl;
}
0