Comments

• 
  

  -8

  

  Bui_Quoc_Cuong  commented on July 10, 2024, 4:10 a.m.

  include <bits/stdc++.h>

  using namespace std ;

  define ll long long

  define pb push_back

  define all(a) a.begin(),a.end()

  define FOR(i,a,b) for(int i(a) ; i <= b ; i++)

  define FORD(i,a,b) for(int i(a) ; i >= b ; i--)

  define TIME 1.0 * clock() / CLOCKS_PER_SEC

  define _(x) (x & (-(x)))

  // Persistent BIT vector< pair<int,int> > bit[4100][4100];

  // Add val to cell (x, y) at time = time void update(int x, int y, int val, int time) { for(int u = x; u <= 4096; u += _(u)) for(int v = y; v <= 4096; v += _(v)) { if (bit[u][v].empty()) { bit[u][v].push_back(make_pair(time, val)); } else { int cur = bit[u][v][bit[u][v].size()-1].second; bit[u][v].push_back(make_pair(time, cur + val)); } } }

  // Get the sum of square (1,1) --> (x, y) at time = time int get(int time, int x, int y) { int res = 0; for(int u = x; u > 0; u -= _(u)) for(int v = y; v > 0; v -= _(v)) { if (bit[u][v].empty()) { } else if (bit[u][v][bit[u][v].size()-1].first <= time) { res += bit[u][v][bit[u][v].size()-1].second; } else { int pos = upper_bound(bit[u][v].begin(), bit[u][v].end(), make_pair(time, 2000111000))

                      - bit[u][v].begin() - 1;
              if (pos >= 0)
                  res += bit[u][v][pos].second;
          }
      }
  return res;

  }

  const int maxn = 1e5 + 5 ;

  signed main(void) {

  #define TASK ""
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);cout.tie(nullptr);
  if( fopen(TASK".INP","r") ) {
      freopen(TASK".INP","r",stdin) ; freopen(TASK".OUT","w",stdout);
  }
  
  cerr << endl << "watborhihi : " << TIME << "s  " << endl;
  return (0 ^ 0) ;

  }

  This comment is hidden due to too much negative feedback. Click here to view it.