#709725 (C++23) No.1715 Dinner 2

提出ソース

結果

問題	No.1715 Dinner 2
ユーザー	hitonanode
提出日時	2021-10-22 23:09:51
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	349 ms / 2,000 ms
コード長	8,064 bytes
コンパイル時間	2,327 ms
コンパイル使用メモリ	187,720 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-23 07:35:36
合計ジャッジ時間	6,294 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	3 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	218 ms 6,940 KB
testcase_12	AC	241 ms 6,944 KB
testcase_13	AC	286 ms 6,940 KB
testcase_14	AC	212 ms 6,944 KB
testcase_15	AC	259 ms 6,944 KB
testcase_16	AC	174 ms 6,944 KB
testcase_17	AC	112 ms 6,940 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	4 ms 6,940 KB
testcase_21	AC	3 ms 6,944 KB
testcase_22	AC	5 ms 6,944 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	4 ms 6,940 KB
testcase_26	AC	3 ms 6,940 KB
testcase_27	AC	4 ms 6,944 KB
testcase_28	AC	3 ms 6,944 KB
testcase_29	AC	3 ms 6,940 KB
testcase_30	AC	3 ms 6,940 KB
testcase_31	AC	4 ms 6,944 KB
testcase_32	AC	348 ms 6,944 KB
testcase_33	AC	347 ms 6,944 KB
testcase_34	AC	349 ms 6,940 KB
testcase_35	AC	347 ms 6,940 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	5 ms 6,944 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

// ごめんなさい

int main() {
    int N, D;
    cin >> N >> D;

    vector<lint> P(N), Q(N);
    REP(i, N) cin >> P[i] >> Q[i];
    lint ret = -(1LL << 60);

    constexpr lint INF = 1LL << 60;

    if (N <= 5) {
        lint ok = -(1LL << 60), ng = 0;
        while (abs(ng - ok) > 1) {
            const lint th = -((abs(ok) + abs(ng)) / 2);

            vector<lint> dp(N, 0);
            REP(day, D) {
                vector<lint> nxt(N, -INF);
                REP(i, N) {
                    if (dp[i] == -INF) continue;
                    REP(j, N) {
                        if (i == j) continue;
                        if (dp[i] - P[j] < th) continue;
                        chmax(nxt[j], dp[i] - P[j] + Q[j]);
                    }
                }
                dp = nxt;
            }
            (dp != vector<lint>(N, -INF) ? ok : ng) = th;
        }
        chmax(ret, ok);
    }

    vector<plint> p2i;
    REP(i, N) p2i.emplace_back(P[i], i);
    sort(ALL(p2i));
    if (p2i.size() > 40) p2i.resize(40);

    REP(i, N) REP(j, N) {
        if (i == j) continue;
        lint ans = 0;
        lint a = 0;

        a -= P[i];
        chmin(ans, a);
        a += Q[i];
        a -= P[j];
        chmin(ans, a);
        a += Q[j];

        a = (-P[i] + Q[i] - P[j] + Q[j]) * ((D / 2) - 1);
        a -= P[i];
        chmin(ans, a);
        a += Q[i];
        int last = i;
        if (D % 2) {
            a -= P[j];
            chmin(ans, a);
            a += Q[j];
            last = j;
        }
        lint red = P[i ^ j ^ last];
        p2i.emplace_back(P[i], i);
        p2i.emplace_back(P[j], j);
        for (auto [p, k] : p2i) {
            if (k != last) chmin(red, p);
        }
        p2i.pop_back();
        p2i.pop_back();
        chmin(ans, a - red);
        chmax(ret, ans);
    }

    p2i.clear();
    REP(i, N) if (Q[i] > P[i]) p2i.emplace_back(P[i], i);
    sort(ALL(p2i));
    if (p2i.size() > 40) p2i.resize(40);

    REP(i, N) REP(j, N) {
        if (i == j) continue;
        for (auto [p, k] : p2i) {
            if (k == i) continue;
            lint ans = -P[k];
            lint a = -P[k] + Q[k];

            a -= P[i];
            chmin(ans, a);
            a += Q[i];
            if (D > 2) {
                a -= P[j];
                chmin(ans, a);
                a += Q[j];
            }
            if (D > 3) {
                a = (-P[i] + Q[i] - P[j] + Q[j]) * (((D - 1) / 2) - 1) - P[k] + Q[k];
                a -= P[i];
                chmin(ans, a);
                a += Q[i];
                a -= P[j];
                chmin(ans, a);
                a += Q[j];
                if (D % 2 == 0) {
                    a -= P[i];
                    chmin(ans, a);
                    a += Q[i];
                }
            }
            chmax(ret, ans);
        }
    }
    cout << ret << '\n';
}

yukicoder

結果

テストケース

ソースコード