Submission #38421598

---

Source Code Expand

#include <bits/stdc++.h>
#define st first
#define nd second
#define db double
#define re register
#define pb push_back
#define mk make_pair
#define int long long
#define ldb long double
#define pii pair<int, int>
#define ull unsigned long long
#define mst(a, b) memset(a, b, sizeof(a))
using namespace std;
const int N = 2e5 + 10, lim = 1e9, INF = 2e9;
inline int read()
{
  int s = 0, w = 1;
  char ch = getchar();
  while(ch < '0' || ch > '9') { if(ch == '-') w *= -1; ch = getchar(); }
  while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
  return s * w;
}
int n, Q, rt;
int a[N], b[N];
#define mid ((l + r) >> 1)
struct SegmentTree{
  int tot, ls[100 * N], rs[100 * N];
  int cnt[100 * N], val[100 * N];
  inline void update(int &k, int l, int r, int x, int v){
    if(!k) k = ++tot, cnt[k] = val[k] = 0;
    if(l == r && l == x) { cnt[k] += v, val[k] += x * v; return; }
    if(x <= mid) update(ls[k], l, mid, x, v);
    else update(rs[k], mid + 1, r, x, v);
    cnt[k] = min(INF, cnt[ls[k]] + cnt[rs[k]]), val[k] = val[ls[k]] + val[rs[k]];
  }
  inline int query(int k, int l, int r, int x, int y){
    if(!k) return 0;
    if(l >= x && r <= y) return cnt[k];
    if(y <= mid) return query(ls[k], l, mid, x, y);
    else if(x > mid) return query(rs[k], mid + 1, r, x, y);
    else return query(ls[k], l, mid, x, mid) + query(rs[k], mid + 1, r, mid + 1, y);
  }
  inline int ask(int k, int l, int r, int x, int y){
    if(!k) return 0;
    if(l >= x && r <= y) return val[k];
    if(y <= mid) return ask(ls[k], l, mid, x, y);
    else if(x > mid) return ask(rs[k], mid + 1, r, x, y);
    else return ask(ls[k], l, mid, x, mid) + ask(rs[k], mid + 1, r, mid + 1, y);
  }
}T;
signed main()
{
  n = read();
  for(re int i = 1; i <= n; i++)
    a[i] = read(), b[i] = read(), T.update(rt, 0, lim, a[i], b[i]);
  Q = read();
  while(Q--){
    int op = read(), x, y;
    if(op == 1){
      x = read(), y = read(), T.update(rt, 0, lim, a[x], -b[x]);
      a[x] = y, T.update(rt, 0, lim, a[x], b[x]);
    }
    if(op == 2){
      x = read(), y = read(), T.update(rt, 0, lim, a[x], -b[x]);
      b[x] = y, T.update(rt, 0, lim, a[x], b[x]);
    }
    if(op == 3){
      x = read();
      if(T.cnt[rt] < x) { puts("-1"); continue; }
      int l = 0, r = lim, res;
      while(l <= r){
        if(T.query(1, 0, lim, mid, lim) >= x) res = mid, l = mid + 1;
        else r = mid - 1;
      }
      int all = T.query(1, 0, lim, res, lim);
      int ans = T.ask(1, 0, lim, res, lim) - (all - x) * res;
      printf("%lld\n", ans);
    }
  }
  return 0;
}
/*
3
10 1   
2 2   
3 3 
1
3 4
*/

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:54:14: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   54 |   for(re int i = 1; i <= n; i++)
      |              ^
./Main.cpp:76:56: warning: ‘res’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   76 |       int ans = T.ask(1, 0, lim, res, lim) - (all - x) * res;
      |                                              ~~~~~~~~~~^~~~~

Judge Result