csp 回收站选址

stl map

#include <bits/stdc++.h>
using namespace std;
int n;
int a[5];
map<pair<long long,long long>,int> m;
long long x,y;
struct point{
	long long x,y;
}p[1005];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>x>>y;
		m[make_pair(x,y)]=1;
		p[i].x=x;
		p[i].y=y;
	}
	for(int i=1;i<=n;i++){
		x=p[i].x;
		y=p[i].y;
		int count = 0;
		if(m[make_pair(x,y-1)]==1&&m[make_pair(x,y+1)]==1&&m[make_pair(x-1,y)]==1&&m[make_pair(x+1,y)]==1){
			if(m[make_pair(x+1,y+1)]==1) count++;
			if(m[make_pair(x+1,y-1)]==1) count++;
			if(m[make_pair(x-1,y-1)]==1) count++;
			if(m[make_pair(x-1,y+1)]==1) count++;
			a[count]++;
		}
	}
	for(int i=0;i<5;i++){
		cout<<a[i]<<endl;
	}
	return 0;
}