結果

問題 No.1008 Bench Craftsman
ユーザー haruki_Kharuki_K
提出日時 2020-03-06 23:02:10
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 96 ms / 2,000 ms
コード長 4,955 bytes
コンパイル時間 1,507 ms
コンパイル使用メモリ 170,336 KB
実行使用メモリ 7,132 KB
最終ジャッジ日時 2023-08-04 12:42:34
合計ジャッジ時間 4,759 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 96 ms
7,064 KB
testcase_06 AC 40 ms
5,676 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 6 ms
4,380 KB
testcase_09 AC 48 ms
4,572 KB
testcase_10 AC 94 ms
7,132 KB
testcase_11 AC 93 ms
7,008 KB
testcase_12 AC 95 ms
7,064 KB
testcase_13 AC 94 ms
7,064 KB
testcase_14 AC 94 ms
7,116 KB
testcase_15 AC 89 ms
7,044 KB
testcase_16 AC 92 ms
7,100 KB
testcase_17 AC 93 ms
6,952 KB
testcase_18 AC 94 ms
7,000 KB
testcase_19 AC 94 ms
7,072 KB
testcase_20 AC 36 ms
4,856 KB
testcase_21 AC 35 ms
4,660 KB
testcase_22 AC 49 ms
5,000 KB
testcase_23 AC 71 ms
5,892 KB
testcase_24 AC 64 ms
5,616 KB
testcase_25 AC 37 ms
5,528 KB
testcase_26 AC 28 ms
4,704 KB
testcase_27 AC 40 ms
4,580 KB
testcase_28 AC 53 ms
5,460 KB
testcase_29 AC 79 ms
6,364 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#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) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
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> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T 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(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<

int32_t main() {
    int n,m; cin >> n >> m;
    vector<int> a(n); cin >> a;
    vector<int> x(m),w(m);
    rep (i,m) cin >> x[i] >> w[i], x[i]--;

    auto check = [&](int c) {
        if (c == 0) {
            int sum = sumof(all(w));
            int mi = *min_element(all(a));
            return mi > sum;
        }

        vector<int> v0(n+1),v1(n+1);
        auto add = [&](auto &v, int l, int r, int val) {
            v[l] += val;
            v[r] -= val;
        };
        rep (j,m) {
            int l = max(0LL, x[j] - w[j]/c), r = min(n-1, x[j]+w[j]/c)+1;
            add(v0, l, x[j], w[j]-x[j]*c);
            add(v0, x[j], r, w[j]+x[j]*c);

            add(v1, l, x[j], +c);
            add(v1, x[j], r, -c);
        }
        rep (i,n) v0[i+1] += v0[i];
        rep (i,n) v1[i+1] += v1[i];
        rep (i,n) v0[i] += i*v1[i];

        rep (i,n) if (v0[i] >= a[i]) return false;
        return true;
    };

    int inf = 1e6;
    int l = -1, r = inf;
    while (l+1 < r) {
        int mid = (l+r)/2;
        (check(mid) ? r : l) = mid;
    }
    cout << (r == inf ? -1 : r) << endl;

}
0