結果

問題 No.1008 Bench Craftsman
ユーザー PachicobuePachicobue
提出日時 2020-03-06 22:48:43
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 70 ms / 2,000 ms
コード長 6,724 bytes
コンパイル時間 3,860 ms
コンパイル使用メモリ 203,684 KB
実行使用メモリ 6,368 KB
最終ジャッジ日時 2023-08-04 12:25:31
合計ジャッジ時間 4,957 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,384 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,384 KB
testcase_03 AC 1 ms
4,384 KB
testcase_04 AC 2 ms
4,384 KB
testcase_05 AC 70 ms
6,156 KB
testcase_06 AC 33 ms
5,472 KB
testcase_07 AC 1 ms
4,384 KB
testcase_08 AC 3 ms
4,384 KB
testcase_09 AC 28 ms
4,380 KB
testcase_10 AC 67 ms
6,196 KB
testcase_11 AC 66 ms
6,140 KB
testcase_12 AC 66 ms
6,368 KB
testcase_13 AC 63 ms
6,272 KB
testcase_14 AC 66 ms
6,144 KB
testcase_15 AC 64 ms
6,268 KB
testcase_16 AC 65 ms
6,164 KB
testcase_17 AC 64 ms
6,196 KB
testcase_18 AC 65 ms
6,132 KB
testcase_19 AC 66 ms
6,272 KB
testcase_20 AC 28 ms
4,820 KB
testcase_21 AC 26 ms
4,384 KB
testcase_22 AC 33 ms
4,380 KB
testcase_23 AC 48 ms
5,316 KB
testcase_24 AC 43 ms
4,952 KB
testcase_25 AC 30 ms
5,332 KB
testcase_26 AC 24 ms
4,612 KB
testcase_27 AC 27 ms
4,380 KB
testcase_28 AC 39 ms
5,292 KB
testcase_29 AC 56 ms
5,720 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
// created [2020/03/06] 22:34:49
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T>
using max_heap = std::priority_queue<T>;
template<typename T>
using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

int out() { return 0; }
template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
int outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
    const auto N = in<int>(), M = in<int>();
    const auto as = in_v<ll>({N});
    std::vector<int> xs(M);
    std::vector<int> ws(M);
    for (int i = 0; i < M; i++) { xs[i] = in<int>() - 1, ws[i] = in<int>(); }
    const ll W = std::accumulate(ws.begin(), ws.end(), 0LL);
    if (*std::min_element(as.begin(), as.end()) > W) { return outln(0); }
    int inf = 0, sup = 100001;
    auto ok = [&](const int c) -> bool {
        std::vector<ll> cs(N + 1, 0);
        std::vector<ll> ts(N + 1, 0);
        for (int i = 0; i < M; i++) {
            const int x     = xs[i];
            const int w     = ws[i];
            const int r     = w / c;
            const int left  = std::max(x - r, 0);
            const int right = std::min(x + r + 1, N);
            cs[left] += c, cs[x] -= c;
            cs[x] -= c, cs[right] += c;
            ts[left] += (ll)w - (ll)c * x, ts[x] -= (ll)w - (ll)c * x;
            ts[x] += (ll)w + (ll)c * x, ts[right] -= (ll)w + (ll)c * x;
        }
        for (int i = 1; i <= N; i++) { cs[i] += cs[i - 1], ts[i] += ts[i - 1]; }
        for (int i = 0; i < N; i++) {
            const ll load = cs[i] * i + ts[i];
            if (load >= as[i]) { return false; }
        }
        return true;
    };
    while (sup - inf > 1) {
        const int mid         = (inf + sup) / 2;
        (ok(mid) ? sup : inf) = mid;
    }
    outln(sup == 100001 ? -1 : sup);
    return 0;
}
0