Блог пользователя Usu

Binary Indexed Trees 2D
Автор Usu, история, 7 лет назад, По-английски

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!

  • Проголосовать: нравится
  • +6
  • Проголосовать: не нравится

»
7 лет назад, # |
  Проголосовать: нравится +21 Проголосовать: не нравится

Topcoder has a great tutorial: https://www.topcoder.com/community/data-science/data-science-tutorials/binary-indexed-trees/

I know only one problem that can be solved using 2D BIT: http://codeforces.net/problemset/problem/869/E

→ Ответить
  • »
    »
    7 лет назад, # ^ |
      Проголосовать: нравится +10 Проголосовать: не нравится

    Thanks!

    → Ответить
  • »
    »
    7 лет назад, # ^ |
    ← Rev. 2   Проголосовать: нравится +8 Проголосовать: не нравится

    I know another one problem that can be solved using 3D BIT (100246B - B), 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]).

    → Ответить
    • »
      »
      »
      7 лет назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

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

      → Ответить
  • »
    »
    6 лет назад, # ^ |
    ← Rev. 2   Проголосовать: нравится +5 Проголосовать: не нравится

    I was reading 2D BIT, gfg implementation https://www.geeksforgeeks.org/two-dimensional-binary-indexed-tree-or-fenwick-tree/

    Please help me with some doubts, In the updateBit and getSum function inner "y" loop is not initialized again. Is it a mistake or is it meant to be that way?

    If it is meant to be that way can you explain how is it working and what is the need of outer loop as the same work can be done with the help of an "if" statement.

    Thanks in advance..

    → Ответить
    • »
      »
      »
      6 лет назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      That's probably a mistake, since I've tried it and it got WA. I always use 2D fenwick initializing the nested variable.

      → Ответить
»
7 лет назад, # |
← Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

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

→ Ответить