結果

問題 No.1008 Bench Craftsman
ユーザー hitonanodehitonanode
提出日時 2020-03-06 22:08:19
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,873 bytes
コンパイル時間 1,721 ms
コンパイル使用メモリ 172,660 KB
実行使用メモリ 8,096 KB
最終ジャッジ日時 2024-10-14 07:12:45
合計ジャッジ時間 6,371 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 228 ms
7,968 KB
testcase_06 AC 91 ms
6,820 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 14 ms
6,820 KB
testcase_09 AC 127 ms
6,820 KB
testcase_10 AC 221 ms
7,968 KB
testcase_11 WA -
testcase_12 AC 223 ms
7,972 KB
testcase_13 AC 224 ms
7,972 KB
testcase_14 WA -
testcase_15 AC 30 ms
6,820 KB
testcase_16 WA -
testcase_17 AC 30 ms
6,816 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 79 ms
6,816 KB
testcase_21 AC 79 ms
6,820 KB
testcase_22 AC 121 ms
6,816 KB
testcase_23 AC 163 ms
6,816 KB
testcase_24 AC 154 ms
6,816 KB
testcase_25 AC 85 ms
6,816 KB
testcase_26 AC 64 ms
6,820 KB
testcase_27 AC 99 ms
6,820 KB
testcase_28 AC 122 ms
6,820 KB
testcase_29 AC 183 ms
6,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/



int main()
{
    int N, M;
    cin >> N >> M;
    vector<lint> A(N);
    cin >> A;
    vector<lint> X(M), W(M);
    REP(i, M) cin >> X[i] >> W[i];
    REP(i, M) X[i]--;
    vector<lint> mini(N);
    REP(i, M) mini[X[i]] += W[i];
    REP(i, N) if (mini[i] >= A[i]) {
        puts("-1");
        return 0;
    }
    lint lo = -1, hi = 1e18;
    while (hi - lo > 1) {
        lint c = (lo + hi) / 2;
        vector<lint> imos1(N + 1);
        vector<lint> imos2(N + 1);
        REP(m, M)
        {
            lint w = W[m], x = X[m];
            if (c == 0)
            {
                imos1[0] += w;
                continue;
            }
            lint d = w / c;
            lint l = max(x - d, 0LL);
            lint r = min<lint>(x + d, N);
            lint b = w - (x - l) * c;
            imos2[l + 1] += c;
            imos2[x] -= c;
            imos1[x] -= c * (x - l - 1);

            imos2[x + 1] -= c;
            imos2[r] += c;
            imos1[r] += c * (r - x - 1);

            imos1[l] += b;
            imos1[x] -= b;

            imos1[x] += w;
            imos1[r] -= w;
        }
        REP(i, N) imos1[i + 1] += imos1[i];
        REP(_, 2) REP(i, N) imos2[i + 1] += imos2[i];
        bool f = true;
        REP(i, N) if (imos1[i] + imos2[i] >= A[i]) {
            f = false;
        }
        (f ? hi : lo) = c;
    }

    cout << hi << endl;
}
0