#653137 (C++17) No.1495 パンの仕入れ

提出ソース

結果

問題	No.1495 パンの仕入れ
ユーザー	haruki_K
提出日時	2021-05-01 12:53:55
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,901 bytes
コンパイル時間	2,637 ms
コンパイル使用メモリ	208,164 KB
実行使用メモリ	12,660 KB
最終ジャッジ日時	2024-07-19 20:10:22
合計ジャッジ時間	9,453 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	3 ms 5,376 KB
testcase_02	AC	166 ms 5,376 KB
testcase_03	AC	163 ms 5,376 KB
testcase_04	AC	163 ms 5,376 KB
testcase_05	AC	163 ms 5,376 KB
testcase_06	AC	164 ms 5,376 KB
testcase_07	AC	164 ms 5,376 KB
testcase_08	AC	163 ms 5,376 KB
testcase_09	AC	164 ms 5,376 KB
testcase_10	AC	164 ms 5,376 KB
testcase_11	AC	164 ms 5,376 KB
testcase_12	AC	44 ms 5,376 KB
testcase_13	AC	43 ms 5,376 KB
testcase_14	AC	44 ms 5,376 KB
testcase_15	AC	44 ms 5,376 KB
testcase_16	AC	44 ms 5,376 KB
testcase_17	AC	44 ms 5,376 KB
testcase_18	AC	44 ms 5,376 KB
testcase_19	AC	44 ms 5,376 KB
testcase_20	AC	44 ms 5,376 KB
testcase_21	AC	44 ms 5,376 KB
testcase_22	AC	242 ms 12,660 KB
testcase_23	AC	244 ms 12,488 KB
testcase_24	AC	32 ms 5,376 KB
testcase_25	AC	32 ms 5,376 KB
testcase_26	AC	32 ms 5,376 KB
testcase_27	AC	32 ms 5,376 KB
testcase_28	AC	240 ms 12,560 KB
testcase_29	AC	238 ms 12,560 KB
testcase_30	AC	36 ms 5,376 KB
testcase_31	AC	35 ms 5,376 KB
testcase_32	AC	35 ms 5,376 KB
testcase_33	AC	36 ms 5,376 KB
testcase_34	AC	35 ms 5,376 KB
testcase_35	AC	49 ms 5,376 KB
testcase_36	AC	45 ms 5,376 KB
testcase_37	AC	45 ms 5,376 KB
testcase_38	AC	65 ms 5,376 KB
testcase_39	AC	47 ms 5,376 KB
testcase_40	WA	-
testcase_41	WA	-
testcase_42	AC	36 ms 5,376 KB
testcase_43	WA	-
testcase_44	AC	35 ms 5,376 KB
testcase_45	AC	2 ms 5,376 KB
testcase_46	AC	3 ms 5,376 KB
testcase_47	AC	2 ms 5,376 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
vector<int> &operator--(vector<int> &v) { for (int &x : v) --x; return v; }
vector<int> &operator++(vector<int> &v) { for (int &x : v) ++x; return v; }
// <<<

auto solve() {
    int n, m, k; cin >> n >> m >> k;
    vector<__int128_t> a(n), b(n), c(n);
    rep (i, m) {
        int x, y; cin >> x >> y; --x;
        a[x] += 1;
        b[x] += -2*y;
        c[x] += y*y;
    }
    dump(a);
    dump(b);
    dump(c);

    int cnt = 0;
    __int128_t sum = 0;
    bool found = false;
    rep (i, n) {
        if (a[i] != 0) {
            int M = div_floor(-b[i], 2*a[i]);
            __int128_t mi = INF;
            int memo = -1;
            loop (B, M-3, <= M+3) if (B >= 0) {
                if (chmin(mi, a[i]*B*B + b[i]*B + c[i])) {
                    memo = B;
                }
            }
            cnt += memo;
            sum += mi;
        } else {
            found = true;
        }
    }
    dump(cnt, sum);
    if (found and cnt <= k) {
        cout << (int)sum << '\n';
        return;
    }

    auto f = [&](int i, int x) -> int {
        if (a[i] == 0) {
            return 0;
        } else {
            return max<int>(0, div_floor(x-(a[i]+b[i]), 2*a[i]) + 1);
        }
    };

    auto check = [&](int x) {
        int cnt = 0;
        rep (i, n) cnt += f(i, x);
        return cnt;
    };

    int l = -INF, r = INF;
    while (l+1 < r) {
        auto mid = (l+r)/2;
        (check(mid) <= k ? l : r) = mid;
    }
    int x = l;
    dump(x);

    cnt = 0;
    sum = 0;
    rep (i, n) {
        int B = f(i, x);
        auto val = a[i]*B*B + b[i]*B + c[i];
        cnt += B;
        sum += val;
    }
    sum += (x+1)*(k-cnt);
    cout << (int)sum << '\n';


}

int32_t main() {
    int t; cin >> t;
    while (t--) {
        solve();
//        cout << (solve() ? "YES" : "NO") << '\n';
        debug { cerr << endl; }
    }
}

yukicoder

結果

テストケース

ソースコード