#969298 (C++23) No.2698 Many Asakatsu

提出ソース

結果

問題	No.2698 Many Asakatsu
ユーザー	hitonanode
提出日時	2024-04-05 21:14:34
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	8,819 bytes
コンパイル時間	2,096 ms
コンパイル使用メモリ	189,456 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-10-01 01:30:24
合計ジャッジ時間	8,099 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	2 ms 5,248 KB
testcase_04	AC	1 ms 5,248 KB
testcase_05	AC	2 ms 5,248 KB
testcase_06	AC	2 ms 5,248 KB
testcase_07	AC	3 ms 5,248 KB
testcase_08	AC	3 ms 5,248 KB
testcase_09	AC	3 ms 5,248 KB
testcase_10	AC	3 ms 5,248 KB
testcase_11	AC	5 ms 5,248 KB
testcase_12	AC	4 ms 5,248 KB
testcase_13	AC	4 ms 5,248 KB
testcase_14	AC	4 ms 5,248 KB
testcase_15	AC	3 ms 5,248 KB
testcase_16	AC	3 ms 5,248 KB
testcase_17	AC	4 ms 5,248 KB
testcase_18	AC	5 ms 5,248 KB
testcase_19	AC	15 ms 5,248 KB
testcase_20	AC	15 ms 5,248 KB
testcase_21	AC	14 ms 5,248 KB
testcase_22	AC	244 ms 6,132 KB
testcase_23	AC	276 ms 6,136 KB
testcase_24	AC	294 ms 6,136 KB
testcase_25	AC	245 ms 6,140 KB
testcase_26	AC	281 ms 6,140 KB
testcase_27	AC	293 ms 6,136 KB
testcase_28	AC	469 ms 5,248 KB
testcase_29	WA	-
testcase_30	AC	94 ms 6,268 KB
testcase_31	AC	442 ms 5,248 KB
testcase_32	AC	325 ms 6,264 KB
testcase_33	AC	15 ms 5,248 KB
testcase_34	AC	316 ms 6,260 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 <memory>
#include <numeric>
#include <optional>
#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> 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; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class 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 <class 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 <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::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) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


int main() {
    int N, M;
    cin >> N >> M;
    vector<int> A(N), B(N);
    REP(i, N) cin >> A.at(i) >> B.at(i);

    auto f = [&](int i_, lint x) -> __int128 {
        const lint a = A.at(i_), b = B.at(i_);
        // a, a + b, ..., a + b * (M - 1)
        // |a - x| + |a + b - x| + ... + |a + b * (M - 1) - x|

        if (b == 0) return __int128(abs(a - x)) * M;

        assert(b > 0);

        // a + bi >= x
        const int i = std::clamp<lint>(floor_div(x - a + b - 1, b), 0, M);

        __int128 ret = __int128(x) * i - ((a + a + b * (i - 1)) * i) / 2;
        ret += ((a + b * i + a + b * (M - 1)) * (M - i)) / 2 - __int128(x) * (M - i);

        return ret;
    };

    constexpr lint LB = -1, UB = (1LL << 30) -1;

    auto g = [&](int i, int j) -> lint {

        // f(i, x) > f(j, x) を満たす最初の x を返す
        assert(i <= j);
        if (f(i, LB) > f(j, LB)) return LB;

        lint ng = LB, ok = UB;
        while (ok - ng > 1) {
            const lint mid = (ok + ng) / 2;
            if (f(i, mid) > f(j, mid)) ok = mid;
            else ng = mid;
        }

        return ok;
    };

    std::vector<pair<int, lint>> is;
    REP(i, N) {
        while (is.size() > 1) {
            auto [prpr, x0] = is.at(is.size() - 2);
            auto [prv, x1] = is.back();
            const auto x2 = g(prv, i);
            if (x2 <= x1) {
                is.pop_back();
            } else {
                break;
            }
        }
        if (is.empty()) {
            is.emplace_back(i, LB);
        } else {
            is.emplace_back(i, g(is.back().first, i));
        }
    }
    dbg(is);

    int Q;
    long long X;
    cin >> Q >> X;

    vector<int> C(N);
    cin >> C;

    int cur = 0;

    REP(_, Q) {
        while (cur + 1 < (int)is.size()) {
            auto [idx, x] = is.at(cur + 1);
            if (X >= x) {
                ++cur;
            } else {
                break; 
            }
        }
        int argmin = is.at(cur).first;
        auto e = f(argmin, X);
        // while (cur + 1 < (int)is.size() and chmin(e, f(is.at(cur + 1), X))) argmin = is.at(++cur);

        cout << argmin + 1 << ' ';
        X += C.at(argmin);
    }

    cout << '\n';
}

yukicoder

結果

テストケース

ソースコード