結果

問題 No.728 ギブ and テイク
ユーザー sak
提出日時 2020-07-23 18:58:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 704 ms / 3,000 ms
コード長 2,762 bytes
コンパイル時間 4,034 ms
コンパイル使用メモリ 200,624 KB
最終ジャッジ日時 2025-01-12 04:23:26
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
struct house {
  ll p, l, r, i;
  bool operator< (const house &x) const { return r<x.r; };
};
// ----------------------------------------------------------------------
// ----------------------------------------------------------------------
struct SegTree {
  int size;
  vector<ll> pos;
  SegTree(ll N) { size = 1; while(size<N) size<<=1; pos.resize(2*size,0); }
  ll operator[](const ll &x) const { return pos[x+size]; }
  void build() { per(i,size) operate(i); }
  void set(ll x, const ll v) { pos[x+size] = v; }
  void update(ll x, const ll v) { set(x,v); x+=size; while (x>>=1) operate(x); }
  ll query(ll a, ll b) {
    ll L = 0, R = 0;
    for (a+=size, b+=size; a<b; a>>=1, b>>=1) {
      if (a&1) { L = q(L,pos[a]); a++; }
      if (b&1) { b--; R = q(R,pos[b]); }
    }
    return q(L,R);
  }
  void operate(ll i) { pos[i] = pos[i*2] + pos[i*2+1]; }
  ll q(ll x, ll y) { return x + y; }
};
// ----------------------------------------------------------------------
// ----------------------------------------------------------------------
int main() {
  ll N; cin >> N;
  ll A[N]; rep(i,N) cin >> A[i];
  ll L[N], R[N]; rep(i,N) cin >> L[i] >> R[i];
  house h[N]; rep(i,N) { h[i].p = A[i]; h[i].l = A[i]-L[i]; h[i].r = A[i]+R[i]; h[i].i = i; }
  house hs[N]; rep(i,N) { hs[i].p = A[i]; hs[i].l = A[i]-L[i]; hs[i].r = A[i]+R[i]; hs[i].i = i; }
  sort(hs,hs+N);
  // rep(i,N) cout << hs[i].i << ": " << hs[i].l << " ~ " << hs[i].p << " ~ " << hs[i].r << endl;
  SegTree st(N);
  ll np = 0, result = 0; 
  rep(i,N) {
    while (np!=N&&hs[i].r>=h[np].p) {
      ll pos = lower_bound(A,A+N,h[np].l) - A;
      st.update(pos, st[pos]+1);
      np++;
    }
    ll count = st.query(0,hs[i].i+1) - (hs[i].i+1);
    // cout << hs[i].i << "->" << count << endl;
    result += count;
  }
  cout << result << endl;
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0