- 弱弱的战壕
- 2017-09-18 23:39:09 @
#include<cstdio>
#include<algorithm>
using namespace std;
template<class _T>inline void read(_T &_a)
{
bool f=0;int _ch=getchar();_a=0;
while(_ch<'0'||_ch>'9'){if(_ch=='-')f=1;_ch=getchar();}
while(_ch>='0'&&_ch<='9'){_a=(_a<<3)+(_a<<1)+_ch-'0';_ch=getchar();}
if(f)_a=-_a;
}
int n,x[15001],y[15001],ans[15000];
int main()
{
read(n);
for (register int i=1;i<=n;++i) read(x[i]),read(y[i]);
for (register int i=1;i<=n;++i)
{
int cnt=0;
for (register int v=1;v<=n;++v)
if(i!=v&&x[v]<=x[i]&&y[v]<=y[i]) ++cnt;
++ans[cnt];
}
for (register int i=0;i<n;++i) printf("%d\n",ans[i]);
return 0;
}
O2的锅?
0 条评论
目前还没有评论...