1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
| #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#define DBG(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long LL;
const int N = 32000 + 16;
struct Point {
int x, y;
Point() {}
Point(int x, int y): x(x), y(y) {}
bool operator < (const Point &rhs) const { return x < rhs.x || (x == rhs.x && y < rhs.y); }
void read() { scanf("%d%d", &x, &y); ++x, ++y; }
} P[N];
struct Bit {
int C[N];
int n;
void init(int n) {
this->n = n;
fill(C, C + n + 1, 0);
}
int lowbit(int x) { return x & -x; }
void add(int x, int v) {
for(; x <= n; x += lowbit(x)) C[x] += v;
}
int sum(int x) {
int res = 0;
for(; x; x -= lowbit(x)) res += C[x];
return res;
}
int sum(int l, int r) {
return sum(r) - sum(l - 1);
}
} bit;
int ans[N];
int main(int argc, char **argv) {
int n;
while(~scanf("%d", &n)) {
for(int i = 0; i < n; ++i) P[i].read();
fill(ans, ans + n, 0);
sort(P, P + n);
bit.init(N - 1);
for(int i = 0; i < n; ++i) {
++ans[bit.sum(P[i].y)];
bit.add(P[i].y, 1);
}
for(int i = 0; i < n; ++i) printf("%d\n", ans[i]);
}
return 0;
}
|