結果

問題 No.1008 Bench Craftsman
ユーザー MayimgMayimg
提出日時 2020-03-07 02:57:53
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 184 ms / 2,000 ms
コード長 2,847 bytes
コンパイル時間 2,021 ms
コンパイル使用メモリ 195,392 KB
最終ジャッジ日時 2025-01-09 05:41:34
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
constexpr long long INF = 1LL << 60;
constexpr int geta = 2e5;
constexpr int N = 505050, M = 101010;
long long a[N], x[M], w[M];
long long imos[N];
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  int n, m;
  cin >> n >> m;
  fill(a, a + N, INF);
  for (int i = 1; i <= n; i++) cin >> a[i + geta];
  long long sum = 0;
  for (int i = 0; i < m; i++) {
    cin >> x[i] >> w[i];
    x[i] += geta;
    sum += w[i];
  }
  bool zero = true;
  for (int i = 0; i < N; i++) {
    if (a[i] <= sum) zero = false;
  }
  if (zero) {
    cout << 0 << endl;
    return 0;
  }
  auto judge = [&] (long long d) {
    for (int i = 0; i < N; i++) imos[i] = 0;
    for (int i = 0; i < m; i++) {
      long long pos_fi = x[i] - w[i] / d;
      long long pos_la = x[i];
      if (pos_fi < pos_la) {
        imos[pos_fi + 1] += d;
      }
      if (pos_fi < pos_la) {
        imos[pos_la + 1] -= d;
      }
    }
    for (int i = 0; i < m; i++) {
      long long fi = max(0LL, w[i] - d);
      long long pos_fi = x[i] + 1;
      long long pos_la = x[i] + 1 + fi / d;
      if (pos_fi < pos_la) {
        imos[pos_fi + 1] += -d;
      }
      if (pos_fi < pos_la) {
        imos[pos_la + 1] -= -d;
      }
    }
    // cerr << d << endl;
    // for (int i = 0; i <= n; i++) cerr << imos[i + geta] << " ";
    // cerr << endl;
    for (int i = 1; i < N; i++) imos[i] += imos[i - 1];
    // cerr << d << endl;
    // for (int i = 0; i <= n; i++) cerr << imos[i + geta] << " ";
    // cerr << endl;
    for (int i = 0; i < m; i++) {
      long long fi = w[i] % d;
      long long pos_fi = x[i] - w[i] / d;
      long long pos_la = x[i];
      imos[pos_fi] += fi;
      imos[pos_la + 1] -= fi;
      if (pos_fi < pos_la) {
        imos[pos_la + 1] -= d * (pos_la - pos_fi);
      }
    }
    // cerr << d << endl;
    // for (int i = 0; i <= n; i++) cerr << imos[i + geta] << " ";
    // cerr << endl;
    for (int i = 0; i < m; i++) {
      long long fi = max(0LL, w[i] - d);
      long long pos_fi = x[i] + 1;
      long long pos_la = x[i] + 1 + fi / d;
      imos[pos_fi] += fi;
      imos[pos_la + 1] -= fi;
      if (pos_fi < pos_la) {
        imos[pos_la + 1] -= -d * (pos_la - pos_fi);
      }
    }
    // cerr << d << endl;
    // for (int i = 0; i <= n; i++) cerr << imos[i + geta] << " ";
    // cerr << endl;
    for (int i = 1; i < N; i++) imos[i] += imos[i - 1];
    // cerr << d << endl;
    // for (int i = 0; i <= n; i++) cerr << imos[i + geta] << " ";
    // cerr << endl;
    for (int i = 0; i < N; i++) {
      if (a[i] <= imos[i]) return false;
    }
    return true;
  };
  long long lo = 0, hi = 2e5;
  while (hi - lo > 1) {
    long long mid = (lo + hi) >> 1;
    if (judge(mid)) hi = mid;
    else lo = mid;
  }
  cout << (hi == 2e5 ? -1 : hi) << endl;
  return 0;
}
0