usureluflorianr's blog

By usureluflorianr, history, 4 months ago, In English,

Hey guys, can you please give me some sources with easy BIT 2D implementation? I would be grateful also for some problems using this from easy to hard. Thanks in advance!

 
 
 
 
  • Vote: I like it  
  • +6
  • Vote: I do not like it  

»
4 months ago, # |
  Vote: I like it +21 Vote: I do not like it
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +10 Vote: I do not like it

    Thanks!

  • »
    »
    4 months ago, # ^ |
    Rev. 2   Vote: I like it +8 Vote: I do not like it

    I know another one problem that can be solved using 3D BIT (100246B - Звёзды), but its statement only available in russian. But i can try to translate it.

    You are given a cube (coordinates of points in a cube is 0-indexed) with a side n (1 ≤ n ≤ 128) and 2 types of queries. Each query starts with its type (1 or 2). Type 1 is followed by 4 integers x, y, z, k (x, y, z — coordinates, k ( - 2·104 ≤ k ≤ 2·104) — the number of appeared/lost stars in this point (i don't know that i wrote it understandable) (i.e. that query means such operation: cube[x][y][z] +  = k). Type 2 query is followed by 6 integers x1, y1, z1, x2, y2, z2 — coordinates of subcube, you have to count number of stars in it (i.e. for x in[x1; x2]: for y in[y1; y2]: for z in[z1; z2]: res +  = cube[x][y][z]).

    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      So, in conclusion, no matter how many dimensions we have, always we can apply BIT (if the statement ask for it)

»
3 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Hello, i use the implementation of BIT 2D present in this notebook. I hope helps! :) Sorry the codes are in english, but the comments are in portuguese.

https://github.com/Gabriel123Duarte/maratona-final/blob/master/Notebook/100%5Eo.pdf