結果

問題 No.1495 パンの仕入れ
ユーザー kaage
提出日時 2021-04-25 01:36:05
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 6,916 bytes
コンパイル時間 8,559 ms
コンパイル使用メモリ 202,580 KB
最終ジャッジ日時 2025-01-21 00:48:23
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1 RE * 1
other AC * 3 WA * 1 RE * 42
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#line 2 "library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#ifndef __clang__
#ifdef ONLINE_JUDGE
#pragma GCC target("avx512f")
#elif defined EVAL
#else
#pragma GCC target("avx2")
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define REP(i, n) for (int i = 1; i <= int(n); i++)
#define all(V) V.begin(), V.end()
using i128 = __int128_t;
using u128 = __uint128_t;
using uint = unsigned int;
using lint = long long;
using ulint = unsigned long long;
using IP = std::pair<int, int>;
using LP = std::pair<lint, lint>;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
int popcount(uint x) {
#if __cplusplus >= 202002L
    return std::popcount(x);
#else
#ifndef __clang__
    return __builtin_popcount(x);
#endif
#endif
    x = (x & 0x55555555) + (x >> 1 & 0x55555555);
    x = (x & 0x33333333) + (x >> 2 & 0x33333333);
    x = (x & 0x0f0f0f0f) + (x >> 4 & 0x0f0f0f0f);
    x = (x & 0x00ff00ff) + (x >> 8 & 0x00ff00ff);
    return (x & 0x0000ffff) + (x >> 16 & 0x0000ffff);
}
template <class F>
inline constexpr decltype(auto) lambda_fix(F&& f) {
    return [f = std::forward<F>(f)](auto&&... args) {
        return f(f, std::forward<decltype(args)>(args)...);
    };
}
template <class T>
constexpr std::vector<T> make_vec(size_t n) {
    return std::vector<T>(n);
}
template <class T, class... Args>
constexpr auto make_vec(size_t n, Args&&... args) {
    return std::vector<decltype(make_vec<T>(args...))>(
        n, make_vec<T>(std::forward<Args>(args)...));
}
template <class T, class U>
std::istream& operator>>(std::istream& ist, std::pair<T, U>& x) {
    return ist >> x.first >> x.second;
}
template <class T, class U>
std::ostream& operator<<(std::ostream& ost, const std::pair<T, U>& x) {
    return ost << x.first << " " << x.second;
}
template <class T, class U>
constexpr inline bool chmax(T& lhs, const U& rhs) noexcept {
    if (lhs < rhs) {
        lhs = rhs;
        return true;
    }
    return false;
}
template <class T, class U>
constexpr inline bool chmin(T& lhs, const U& rhs) noexcept {
    if (lhs > rhs) {
        lhs = rhs;
        return true;
    }
    return false;
}
constexpr inline lint gcd(lint a, lint b) noexcept {
    while (b) {
        lint c = a;
        a = b;
        b = c % b;
    }
    return a;
}
inline lint lcm(lint a, lint b) noexcept { return a / gcd(a, b) * b; }
constexpr bool isprime(lint n) noexcept {
    if (n == 1) return false;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) return false;
    }
    return true;
}
template <class T>
constexpr T mypow(T a, lint b) noexcept {
    T res(1);
    while (true) {
        if (b & 1) res *= a;
        b >>= 1;
        if (!b) break;
        a *= a;
    }
    return res;
}
constexpr lint modpow(lint a, lint b, lint m) noexcept {
    a %= m;
    lint res(1);
    while (b) {
        if (b & 1) {
            res *= a;
            res %= m;
        }
        a *= a;
        a %= m;
        b >>= 1;
    }
    return res;
}
template <class T>
constexpr void printArray(const std::vector<T>& vec, char split = ' ') {
    rep(i, vec.size()) {
        std::cout << vec[i];
        std::cout << (i == (int)vec.size() - 1 ? '\n' : split);
    }
}
template <class InputIter>
constexpr void printArray(InputIter l, InputIter r, char split = ' ') {
    auto rprev = std::prev(r);
    for (auto i = l; i != r; i++) {
        std::cout << *i;
        std::cout << (i == rprev ? '\n' : split);
    }
}
LP extGcd(lint a, lint b) noexcept {
    if (b == 0) return {1, 0};
    LP s = extGcd(b, a % b);
    std::swap(s.first, s.second);
    s.second -= a / b * s.first;
    return s;
}
LP ChineseRem(const lint& b1, const lint& m1, const lint& b2,
              const lint& m2) noexcept {
    auto p = extGcd(m1, m2);
    lint g = gcd(m1, m2), l = m1 / g * m2;
    lint tmp = (b2 - b1) / g * p.first % (m2 / g);
    lint r = (b1 + m1 * tmp + l) % l;
    return {r, l};
}
int LCS(const std::string& a, const std::string& b) {
    auto dp = make_vec<int>(a.size() + 1, b.size() + 1);
    rep(i, a.size()) {
        rep(j, b.size()) {
            chmax(dp[i + 1][j], dp[i][j]);
            chmax(dp[i][j + 1], dp[i][j]);
            if (a[i] == b[j]) chmax(dp[i + 1][j + 1], dp[i][j] + 1);
        }
        chmax(dp[i + 1][b.size()], dp[i][b.size()]);
    }
    rep(j, b.size()) chmax(dp[a.size()][j + 1], dp[a.size()][j]);
    return dp[a.size()][b.size()];
}
template <class T, std::enable_if_t<std::is_convertible<int, T>::value,
                                    std::nullptr_t> = nullptr>
void compress(std::vector<T>& vec) {
    auto tmp = vec;
    std::sort(all(tmp));
    tmp.erase(std::unique(all(tmp)), tmp.end());
    for (T& i : vec) i = std::lower_bound(all(tmp), i) - tmp.begin();
}
template <class T>
void compress(T* l, T* r) {
    std::vector<T> tmp(l, r);
    std::sort(all(tmp));
    tmp.erase(std::unique(all(tmp)), tmp.end());
    for (auto i = l; i < r; i++) {
        *i = std::lower_bound(all(tmp), *i) - tmp.begin();
    }
}
template <class InputIter>
void compress(InputIter l, InputIter r) {
    std::vector<typename InputIter::value_type> tmp(l, r);
    std::sort(all(tmp));
    tmp.erase(std::unique(all(tmp)), tmp.end());
    for (auto i = l; i < r; i++) {
        *i = std::lower_bound(all(tmp), *i) - tmp.begin();
    }
}
#line 2 "main.cpp"
int T, N, M, K, x[200010], y[200010];
LP f[200010];
bool used[200010];
int main() {
    std::cin >> T;
    rep(i, T) {
        std::cin >> N >> M >> K;
        rep(j, N) f[j] = {0, 0};
        std::fill(used, used + N, false);
        rep(j, M) {
            std::cin >> x[j] >> y[j];
            x[j]--;
            used[x[j]] = true;
            f[x[j]].first += 2, f[x[j]].second += 1 - 2 * y[j];
        }
        bool free = std::count(used, used + N, false);
        lint min = -LINF, max = LINF;
        while (min + 1 < max) {
            lint mid = (min + max) / 2, cnt = 0;
            rep(j, N) {
                if (f[j].first) {
                    lint a = (mid - f[j].second) / f[j].first;
                    if ((min - f[j].second) % f[j].first) a++;
                    chmax(a, 0);
                    cnt += a;
                }
            }
            if (K < cnt)
                max = mid;
            else if (free && 0 < mid)
                max = mid;
            else
                min = mid;
        }
        lint ans = 0, sum = 0;
        rep(j, M) {
            lint a = (min - f[x[j]].second) / f[x[j]].first;
            if ((min - f[x[j]].second) % f[x[j]].first) a++;
            chmax(a, 0);
            ans += (a - y[j]) * (a - y[j]);
        }
        rep(j, N) {
            if (f[j].first) {
                lint a = (min - f[j].second) / f[j].first;
                if ((min - f[j].second) % f[j].first) a++;
                chmax(a, 0);
                sum += a;
            }
        }
        if (min <= 0)
            ans += min * (K - sum);
        else if (!free)
            ans += min * (K - sum);
        std::cout << ans << std::endl;
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0