Stars (poj 2352 tree array)

Stars (poj 2352 tree array)

 

Language:DefaultStars Time Limit:1000 MS   Memory Limit:65536 K Total Submissions:35169   Accepted:15259 Description Astequalmers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. let the level of a star be an amount of the stars that are not higher and not to the right of the given star. astpolicmers want to know the distribution of the levels of the stars. For example, look at the map shown on the figure above. level of the star number 5 is equal to 3 (it's formed by three stars with a numbers 1, 2 and 4 ). and the levels of the stars numbered by 2 and 4 are 1. at this map there are only one star of the level 0, two stars of the level 1, one star of the level 2, and one star of the level 3. You are to write a program that will count the amounts of the stars of each level on a given map. Input The first line of the input file contains a number of stars N (1 <= N <= 15000 ). the following N lines describe coordinates of stars (two integers X and Y per line separated by a space, 0 <= X, Y <= 32000 ). there can be only one star at one point of the plane. stars are listed in ascending order of Y coordinate. stars with equal Y coordinates are listed in ascending order of X coordinate. Output The output shoshould contain N lines, one number per line. the first line contains amount of stars of the level 0, the second does amount of stars of the level 1 and so on, the last line contains amount of stars of the level N-1. Sample Input 51 15 17 13 35 5 Sample Output 12110 Hint This problem has huge input data, use scanf () instead of cin to read data to avoid time limit exceed. Source Ural Collegiate Programming Contest 1999

 

There are n stars in coordinates. If the coordinate of a star is (x, y), its bottom left is: (x0, y0 ), x0 <= x and y0 <= y. If there is a star in the lower left, it indicates that the star Belongs to level x.
Increment by y. If y is the same, x is incremented to give n stars and obtain the number of all levels.

Idea: The most typical tree array, first made ..

Code:

 

# Include
 
  
# Include
  
   
# Include
   
    
# Include
    
     
# Include
     
      
# Include
      # Include
       
         # Include
        
          # Include
         
           # Include
          
            # Pragma comment (linker, "/STACK: 102400000,102400000") # define maxn 32005 # define MAXN 2005 # define mod 1000000009 # define INF 0x3f3f3f # define pi acos (-1.0) # define eps 1e-6 # define lson rt <1, l, mid # define rson rt <1 | 1, mid + 1, r # define FRE (I, a, B) for (I = a; I <= B; I ++) # define FREE (I, a, B) for (I = a; I> = B; I --) # define FRL (I, a, B) for (I = a; I <B; I ++) # define FRLL (I, a, B) for (I =; i> B; I --) # define mem (t, v) memset (t), v, sizeof (t) # define sf (n) scanf ("% d", & n) # define sff (a, B) scanf ("% d", & a, & B) # define sfff (, b, c) scanf ("% d", & a, & B, & c) # define pf printf # define DBG pf ("Hi \ n ") typedef long ll; using namespace std; int bit [maxn]; int ans [maxn/2]; int lowbit (int k) {return k & (-k );} int sum (int I) {int s = 0; while (I> 0) {s + = bit [I]; I-= lowbit (I) ;}return s ;} void add (int I, int x) {while (I