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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-6
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define NM 100005
#define nm 6805
#define pi 3.1415926535897931
using namespace std;
const ll inf=1e18;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct P{
int x,y,z,v,ans;
bool operator<(const P&o)const{return y<=o.y;}
}a[NM],tmp[NM];
bool cmp(P a,P b){return a.x<b.x||(a.x==b.x&&(a.y<b.y||(a.y==b.y&&a.z<b.z)));}
int n,m,ans[NM],b[NM],c[NM*2],tot;
void add(int x,int t){for(;x<=m;x+=lowbit(x))c[x]+=t;}
int sum(int x,int s=0){for(;x;x-=lowbit(x))s+=c[x];return s;}
void clr(int x){for(;x<=m&&c[x];x+=lowbit(x))c[x]=0;}
void cdq(int l,int r){
if(l==r)return;
int mid=l+r>>1,cnt=l;
cdq(l,mid);cdq(mid+1,r);
for(int x=l,y=mid+1;x<=mid||y<=r;)if(x<=mid&&(y>r||a[x]<a[y])){
add(a[x].z,a[x].v);tmp[cnt++]=a[x++];
}else{
a[y].ans+=sum(a[y].z);tmp[cnt++]=a[y++];
}
inc(i,l,mid)clr(a[i].z);
inc(i,l,r)a[i]=tmp[i];
}
int main(){
n=read();m=read();
inc(i,1,n)a[i].x=read(),a[i].y=read(),a[i].z=read();
sort(a+1,a+1+n,cmp);
inc(i,1,n)if(a[i].x==a[tot].x&&a[i].y==a[tot].y&&a[i].z==a[tot].z)a[tot].v++;
else a[++tot]=a[i],a[tot].v=1;
cdq(1,tot);
inc(i,1,tot)b[a[i].ans+a[i].v-1]+=a[i].v;
inc(i,0,n-1)printf("%d\n",b[i]);
return 0;
}
|
