結果

問題 No.705 ゴミ拾い Hard
ユーザー snrnsidy
提出日時 2025-10-14 00:50:18
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 530 ms / 1,500 ms
コード長 2,658 bytes
コンパイル時間 1,957 ms
コンパイル使用メモリ 206,640 KB
実行使用メモリ 13,184 KB
最終ジャッジ日時 2025-10-14 00:50:31
合計ジャッジ時間 12,185 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 40
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 main.cpp:23: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 |         second

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

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;
}

template <typename T, typename Compare = less<T> >
vector<T> online_offline_dp(int W, const function<T(int, int)>& f,
                            const Compare& comp = Compare()) {
  vector<T> dp(W + 1);
  vector<int> isset(W + 1);
  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)
        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 (!isset[m + i] || comp(ret[i].second, dp[m + i])) {
        isset[m + i] = true;
        dp[m + i] = ret[i].second;
      }
    }
  };
  function<void(int, int)> dfs = [&](int l, int r) {
    if (l + 1 == r) {
      x_base = l, y_base = l;
      T cst = l ? get_cost(0, -1) : 0;
      if (!isset[l] || comp(cst, dp[l])) {
        isset[l] = true;
        dp[l] = cst;
      }
    } else {
      int mid = (l + r) / 2;
      dfs(l, mid);
      induce(l, mid, r);
      dfs(mid, r);
    }
  };
  dfs(0, W + 1);
  return dp;
};

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);
    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 * s + 1LL * t * t * t;
    };
    cout << online_offline_dp(n, dist).back() << '\n';
	return 0;
}
0