#751684 (C++23(draft)) No.1874 Minimum of Sum of Rectangles

提出ソース

結果

問題	No.1874 Minimum of Sum of Rectangles
ユーザー	👑 hitonanode
提出日時	2022-04-04 01:42:18
言語	C++23(draft) (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	105 ms / 3,000 ms
コード長	6,868 bytes
コンパイル時間	2,085 ms
コンパイル使用メモリ	193,148 KB
実行使用メモリ	22,720 KB
最終ジャッジ日時	2023-08-16 01:48:21
合計ジャッジ時間	9,565 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	1 ms 4,380 KB
testcase_04	AC	2 ms 4,376 KB
testcase_05	AC	58 ms 22,308 KB
testcase_06	AC	58 ms 22,216 KB
testcase_07	AC	58 ms 22,380 KB
testcase_08	AC	64 ms 22,204 KB
testcase_09	AC	74 ms 22,068 KB
testcase_10	AC	76 ms 22,268 KB
testcase_11	AC	74 ms 22,224 KB
testcase_12	AC	73 ms 22,120 KB
testcase_13	AC	74 ms 22,172 KB
testcase_14	AC	102 ms 22,140 KB
testcase_15	AC	101 ms 22,476 KB
testcase_16	AC	102 ms 22,468 KB
testcase_17	AC	101 ms 22,428 KB
testcase_18	AC	104 ms 22,548 KB
testcase_19	AC	102 ms 22,268 KB
testcase_20	AC	103 ms 22,276 KB
testcase_21	AC	104 ms 22,008 KB
testcase_22	AC	105 ms 22,364 KB
testcase_23	AC	102 ms 22,168 KB
testcase_24	AC	103 ms 22,460 KB
testcase_25	AC	101 ms 21,972 KB
testcase_26	AC	102 ms 22,216 KB
testcase_27	AC	103 ms 22,468 KB
testcase_28	AC	104 ms 22,720 KB
testcase_29	AC	103 ms 22,296 KB
testcase_30	AC	101 ms 22,300 KB
testcase_31	AC	101 ms 22,396 KB
testcase_32	AC	103 ms 22,336 KB
testcase_33	AC	100 ms 22,440 KB
testcase_34	AC	1 ms 4,380 KB
testcase_35	AC	2 ms 4,380 KB
testcase_36	AC	1 ms 4,376 KB
testcase_37	AC	75 ms 22,420 KB
testcase_38	AC	74 ms 22,184 KB
testcase_39	AC	75 ms 22,260 KB
testcase_40	AC	74 ms 22,236 KB
testcase_41	AC	75 ms 22,440 KB

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

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif

#include <atcoder/segtree>

struct S {
    lint a, b;  // ax + b
    int n;
    lint eval(lint x) const { return a * x + b; }
};
S op(S l, S r) { return S{l.a + r.a, l.b + r.b, l.n + r.n}; }
S e() { return S{0, 0, 0}; }

int main() {
    int N;
    cin >> N;
    if (N <= 2) {
        puts("0");
        return 0;
    }
    vector<plint> XY(N);
    for (auto &[x, y] : XY) cin >> x >> y;
    sort(XY.begin(), XY.end());

    vector<int> ids(N);
    REP(i, N) ids[i] = i;
    sort(ids.begin(), ids.end(), [&](int i, int j) { return XY[i].second < XY[j].second; });
    vector<S> init0, init1;
    for (auto [x, y] : XY) {
        init0.push_back(S{-1, y, 1});
        init1.push_back(S{-x, x * y, 1});
    }

    atcoder::segtree<S, op, e> tree0(init0), tree1(init1);

    lint ret = 1LL << 62;
    for (auto i : ids) {
        lint x, y;
        std::tie(x, y) = XY[i];
        tree0.set(i, S{1, -y, 1});
        tree1.set(i, S{x, -x * y, 1});

        auto all0 = tree0.all_prod();
        auto area0 = all0.eval(y);
        dbg(make_pair(x, y));
        dbg(area0);
        int l = tree0.max_right(0, [&](S s) { return s.eval(y) * 2 <= area0; });
        for (int j : {l - 1, l}) {
            if (j < 0 or j >= N) continue;
            auto [xj, yj] = XY[j];

            auto all1 = tree1.all_prod();
            auto left0 = tree0.prod(0, j);
            auto left1 = tree1.prod(0, j);
            lint tmp = (all1.eval(y) - left1.eval(y)) - (all0.eval(y) - left0.eval(y)) * xj + left0.eval(y) * xj - left1.eval(y);
            dbg(make_tuple(j, xj, yj, all0.eval(y), all1.eval(y), tmp));
            chmin(ret, tmp);
        }
    }
    cout << ret << '\n';
}

yukicoder

結果

テストケース

ソースコード