#956806 (C++23) No.2656 XOR Slimes

提出ソース

結果

問題	No.2656 XOR Slimes
ユーザー	iiljj
提出日時	2024-03-01 22:04:57
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	89 ms / 2,000 ms
コード長	12,934 bytes
コンパイル時間	2,122 ms
コンパイル使用メモリ	182,764 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-09-29 14:00:48
合計ジャッジ時間	7,616 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	2 ms 6,816 KB
testcase_06	AC	2 ms 6,820 KB
testcase_07	AC	2 ms 6,816 KB
testcase_08	AC	84 ms 6,816 KB
testcase_09	AC	85 ms 6,820 KB
testcase_10	AC	84 ms 6,816 KB
testcase_11	AC	85 ms 6,820 KB
testcase_12	AC	84 ms 6,820 KB
testcase_13	AC	84 ms 6,820 KB
testcase_14	AC	83 ms 6,816 KB
testcase_15	AC	83 ms 6,816 KB
testcase_16	AC	84 ms 6,820 KB
testcase_17	AC	85 ms 6,820 KB
testcase_18	AC	85 ms 6,820 KB
testcase_19	AC	85 ms 6,820 KB
testcase_20	AC	84 ms 6,816 KB
testcase_21	AC	84 ms 6,816 KB
testcase_22	AC	85 ms 6,816 KB
testcase_23	AC	85 ms 6,816 KB
testcase_24	AC	85 ms 6,816 KB
testcase_25	AC	84 ms 6,816 KB
testcase_26	AC	84 ms 6,820 KB
testcase_27	AC	85 ms 6,820 KB
testcase_28	AC	84 ms 6,816 KB
testcase_29	AC	85 ms 6,816 KB
testcase_30	AC	85 ms 6,816 KB
testcase_31	AC	85 ms 6,816 KB
testcase_32	AC	85 ms 6,820 KB
testcase_33	AC	85 ms 6,820 KB
testcase_34	AC	84 ms 6,816 KB
testcase_35	AC	85 ms 6,820 KB
testcase_36	AC	83 ms 6,816 KB
testcase_37	AC	83 ms 6,820 KB
testcase_38	AC	85 ms 6,816 KB
testcase_39	AC	85 ms 6,816 KB
testcase_40	AC	85 ms 6,816 KB
testcase_41	AC	85 ms 6,820 KB
testcase_42	AC	84 ms 6,816 KB
testcase_43	AC	83 ms 6,816 KB
testcase_44	AC	85 ms 6,816 KB
testcase_45	AC	86 ms 6,816 KB
testcase_46	AC	85 ms 6,816 KB
testcase_47	AC	85 ms 6,820 KB
testcase_48	AC	85 ms 6,816 KB
testcase_49	AC	84 ms 6,816 KB
testcase_50	AC	84 ms 6,816 KB
testcase_51	AC	85 ms 6,820 KB
testcase_52	AC	84 ms 6,816 KB
testcase_53	AC	85 ms 6,816 KB
testcase_54	AC	89 ms 6,820 KB
testcase_55	AC	84 ms 6,816 KB
testcase_56	AC	84 ms 6,816 KB
testcase_57	AC	83 ms 6,820 KB
testcase_58	AC	84 ms 6,820 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d)                                                   \
    for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d)                                                  \
    for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d)                                                       \
    for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d)                                                      \
    for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                \
    sort(ALL(c));                                                              \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T>
istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec)
        is >> x;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T>
ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm>
istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm>
ostream &operator<<(ostream &os,
                    const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end())
            os << ", ";
    }
    return os << "}";
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end())
            os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {
    return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) {
    return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty())
            os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args>
ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<< <N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) {
    operator<< <0, true>(std::cout, a);
}

void pprint() { std::cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    std::cout << head;
    if (sizeof...(Tail) > 0)
        std::cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0)
        DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                         \
    type __VA_ARGS__;                                                          \
    assert((std::cin >> __VA_ARGS__));

template <typename T> istream &operator,(istream &is, T &rhs) {
    return is >> rhs;
}
template <typename T> ostream &operator,(ostream &os, const T &rhs) {
    return os << ' ' << rhs;
}

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), std::cin.tie(nullptr),
            std::cout.tie(nullptr);
        std::cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH)
            std::cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { std::cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { std::cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i)
        v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i)
        v[i]++;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

template <typename T> struct Cumulative1D {
    using F = function<T(T, T)>;

    int n;
    vc<T> cum;
    F add, subtract;
    Cumulative1D(const vc<T> &data, const int n, F add, F subtract)
        : n(n), cum(n), add(add), subtract(subtract) {
        REP(i, 0, n) {
            if (i == 0) {
                cum[i] = data[i];
            } else {
                cum[i] = add(cum[i - 1], data[i]);
            }
        }
    }
    Cumulative1D() = default;

    // 0-indexed 半開区間
    T query(const int l, const int r) const {
        assert(0 <= l && l < n);
        assert(0 < r && r <= n);
        T ret = cum[r - 1];
        if (l > 0)
            ret = subtract(ret, cum[l - 1]);
        return ret;
    }
};

template <typename T> struct Cum {
    Cumulative1D<T> cum;

    Cum(const vc<T> &data,
        const int n) { // : cum(data, n, Cum::add, Cum::subtract)
        auto add = [](T a, T b) -> T { return a + b; };
        auto subtract = [](T a, T b) -> T { return a - b; };
        cum = Cumulative1D<T>(data, n, add, subtract);
    }
    Cum() = default;

    // 0-indexed 半開区間
    T query(const int l, const int r) const {
        if (l >= r)
            return 0;
        return cum.query(l, r);
    }
};

template <typename T> struct CumXor {
    Cumulative1D<T> cum;

    CumXor(const vc<T> &data,
           const int n) { // : cum(data, n, Cum::add, Cum::subtract)
        auto add = [](T a, T b) -> T { return a ^ b; };
        auto subtract = [](T a, T b) -> T { return a ^ b; };
        cum = Cumulative1D<T>(data, n, add, subtract);
    }
    CumXor() = default;

    // 0-indexed 半開区間
    T query(const int l, const int r) const {
        if (l >= r)
            return 0;
        return cum.query(l, r);
    }
};

// Problem
void solve() {
    VAR(ll, n);
    vll x(n), a(n);
    cin >> x, a;

    // x 昇順にソートする
    vc<pll> pairs(n);
    REP(i, 0, n) pairs[i] = {x[i], a[i]};
    sort(ALL(pairs));

    // vll data_x(n);
    vll data_a(n);
    REP(i, 0, n) {
        // data_x[i] = pairs[i].first;
        data_a[i] = pairs[i].second;
    }

    // 区間に分けるのが最善っぽい？
    // Cum<ll> cum_x(data_x, n);
    CumXor<ll> cum_a(data_a, n);

    auto cost = [&x](const ll l, const ll r) -> ll {
        if (r - l <= 1) {
            return 0;
        }
        return x[r - 1] - x[l];
    };

    // dp[i] := i番目までを使ったときの最小値
    vll dp(n + 1, INF);
    dp[0] = 0;
    REP(i, 0, n) {
        REPM(i_prev, 0, i) {
            const ll val =
                dp[i_prev] + cum_a.query(i_prev, i + 1) + cost(i_prev, i + 1);
            // dump(i, i_prev, val, cum_a.query(i_prev, i + 1),
            //  cost(i_prev, i + 1));
            chmin(dp[i + 1], val);
        }
        // dump(i, dp);
    }
    pprint(dp.back());

    // // xor は順番は関係ないので，C を最小化すれば良い．
    // // 左右からマージすることを繰り返せば良いので，中央で合流する．

    // // xor だけ先に計算する
    // ll s = 0;
    // for (const auto &ai : a) {
    //     s ^= ai;
    // }

    // ll c = 0;
    // sort(ALL(x));
    // deque<ll> que;
    // for (const auto &xi : x) {
    //     que.push_back((xi));
    // }

    // while (que.size() > 1ul) {
    //     // 先頭2個
    //     const ll fst = que.front();
    //     que.pop_front();
    //     const ll snd = que.front();
    //     que.pop_front();
    //     c += abs(snd - fst);
    //     que.push_front(snd);

    //     // あれば末尾2個
    //     if (que.size() > 1ul) {
    //         const ll fst = que.back();
    //         que.pop_back();
    //         const ll snd = que.back();
    //         que.pop_back();
    //         c += abs(snd - fst);
    //         que.push_back(snd);
    //     }
    // }
    // pprint(s + c);
}

// entry point
int main() {
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード