結果

問題 No.1008 Bench Craftsman
ユーザー ningenMeningenMe
提出日時 2020-03-16 22:53:02
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,204 bytes
コンパイル時間 1,850 ms
コンパイル使用メモリ 174,208 KB
実行使用メモリ 8,832 KB
最終ジャッジ日時 2024-11-28 04:23:37
合計ジャッジ時間 5,745 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 2 ms
5,248 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 99 ms
5,248 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 31 ms
6,656 KB
testcase_16 WA -
testcase_17 AC 30 ms
6,656 KB
testcase_18 AC 178 ms
8,704 KB
testcase_19 AC 168 ms
8,576 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    SPEED
    ll N,M; cin >> N >> M;
    vector<ll> A(N+2,LOWINF),B;
    for(int i = 1; i <= N; ++i) cin >> A[i];
    vector<ll> X(M),W(M);
    for(int i = 0; i < M; ++i) cin >> X[i] >> W[i];
    ll sum = accumulate(ALL(W),0LL);
    B = A;
    for(int i = 0; i < M; ++i) B[X[i]] -= W[i];
    for(int i = 1; i <= N; ++i) corner(B[i]<=0,-1);
    int flg = 1;
    for(int i = 0; i < N; ++i) if(A[i]<=sum) flg = 0;
    corner(flg,0);
    ll ok = 1e11,ng = 0,md;

    vector<ll> L(N+2,0),R(N+2,0),C(N+2,0);
    while(ok-ng>1){
        md = (ok+ng)>>1LL;
        for(int i = 0; i <= N+1; ++i) L[i] = R[i] = 0;
        for(int i = 0; i < M; ++i){
            ll n = W[i]/md;
            if(n){
                L[X[i]+1] += md;
                L[min(X[i]+1+n,N+1)] += -n*md;
                R[X[i]-1] += md;
                R[max(0LL,X[i]-n-1)] += -n*md;
            }
        }
        for(int i = 1; i <= N; ++i) L[i] += L[i-1];
        for(int i = N; 1 <= i; --i) R[i] += R[i+1];
        for(int i = 0; i < M; ++i){
            ll n = W[i]/md;
            L[min(X[i]+1+n,N+1)] += W[i]-n*md;
            R[max(0LL,X[i]-n-1)] += W[i]-n*md;
        }
        for(int i = 1; i <= N; ++i) L[i] += L[i-1];
        for(int i = N; 1 <= i; --i) R[i] += R[i+1];
        int flg = 1;
        for(int i = 1; i <= N; ++i){
            C[i] = sum - (L[i] + R[i]);
            if(C[i]>=A[i]) flg = 0;
        }
        (flg?ok:ng)=md;
    }
    cout << ok << endl;
    return 0;
}
0