Sicily 1088. Cows

1088. Cows

Constraints

Time Limit: 3 secs, Memory Limit: 32 MB

Description

Farmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his field is particularly good. 

Farmer John has N cows (we number the cows from 1 to N). Each of Farmer John's N cows has a range of clover that she particularly likes (these ranges might overlap). The ranges are defined by a closed interval [S,E]. 

But some cows are strong and some are weak. Given two cows: cow_i and cow_j, their favourite clover range is [S_i, E_i] and [S_j, E_j]. If S_i <= S_j and E_j <= E_i and E_i - S_i > E_j- S_j, we say that cow_i is stronger than cow_j.

For each cow, how many cows are stronger than her? Farmer John needs your help!

Input

The input contains multiple test cases.
For each test case, the first line is an integer N (1 <= N <= 10⁵), which is the number of cows. Then come N lines, the i-th of which contains two integers: S and E(0 <= S < E <= 10⁵) specifying the start end location respectively of a range preferred by some cow. Locations are given as distance from the start of the ridge.

The end of the input contains a single 0.

Output

For each test case, output n lines containing n  integers, the i-th of which specifying the number of cows that are stronger than cow_i.

Sample Input

3
1 2
0 3
3 4

0

Sample Output

1
0
0
// Problem#: 1088
// Submission#: 3410083
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <functional>
#include <map>
#include <string.h>
#include <math.h>
#include <list>
using namespace std;

const int MAX = 100005;

struct range {
    int s, e, id;
};

int N;
range ori[MAX];
int C[MAX];
int ans[MAX];

inline bool cmp(const range & ra1, const range & ra2) {
    if (ra1.e != ra2.e) return ra1.e < ra2.e;
    else return ra1.s > ra2.s;
}

inline int Lowbit(int m) {return m & (-m);}

inline int Getsum(int k) {
    int sum = 0;
    while (k > 0) {
        sum += C[k];
        k -= Lowbit(k);
    }
    return sum;
}

inline void Change(int k, int m, int n) {
    while (k <= n) {
        C[k] += m;
        k += Lowbit(k);
    }
}

int main() {

    //std::ios::sync_with_stdio(false);

    while (1) {

        scanf("%d", &N);
        if (!N) break;
        int maxS = -1;
        for (int i = 0; i < N; i++) {
            scanf("%d%d", &ori[i].s, &ori[i].e);
            ori[i].id = i;
            ori[i].s++;
            ori[i].e++;
            if (ori[i].s > maxS) maxS = ori[i].s;
        }
        sort(ori, ori + N, cmp);
        memset(C, 0, sizeof(int) * (maxS + 1));
        for (int i = N - 1; i >= 0; i--) {
            if (i != N - 1 && ori[i].e == ori[i + 1].e && ori[i].s == ori[i + 1].s)
                ans[ori[i].id] = ans[ori[i + 1].id];
            else
                ans[ori[i].id] = Getsum(ori[i].s);
            Change(ori[i].s, 1, maxS);
        }
        for (int i = 0; i < N; i++) printf("%d\n", ans[i]);
    }

    return 0;
}