CCF CSP201912-2 回收站选址(c++100)

CCF CSP201912-2 回收站选址

看测试用例约定发现暴力法并不会超时

#include<iostream>
#include<vector>
using namespace std;
struct Node{
	int x,y;
}node; 
vector<Node>G,V;
int ans[5];
int main(){
	int n;
	cin>>n;
	for(int i = 0; i < n; i++){
		cin>>node.x>>node.y;
		G.push_back(node);
	}
	for(int i = 0; i < n; i++){
		int count = 0;
		for(int j = 0; j < n; j++){
			if((G[i].x == G[j].x&&G[i].y-1 == G[j].y) || (G[i].x == G[j].x&&G[i].y+1 == G[j].y) 
			|| (G[i].x-1 == G[j].x&&G[i].y == G[j].y) || (G[i].x+1 == G[j].x&&G[i].y == G[j].y)){
				count++;
			}
			if(count == 4) break;			
		}
		if(count == 4){
			V.push_back(G[i]);
		}
	}
	for(int i = 0; i < V.size(); i++){
		int count = 0;
		for(int j = 0; j < G.size(); j++){
			if((V[i].x-1 == G[j].x&&V[i].y-1 == G[j].y) || (V[i].x-1 == G[j].x&&V[i].y+1 == G[j].y) 
			|| (V[i].x+1 == G[j].x&&V[i].y-1 == G[j].y) || (V[i].x+1 == G[j].x&&V[i].y+1 == G[j].y)){
				count++;
			}
			if(count == 4) break;
		}
		ans[count]++;
	}
	for(int i = 0; i < 5; i++){
		cout<<ans[i]<<endl;
	}
	return 0;
}
//7
//1 2
//2 1
//0 0
//1 1 
//1 0
//2 0
//0 1
//
//2
//0 0
//-100000 10
//
//11
//9 10
//10 10
//11 10
//12 10
//13 10
//11 9
//11 8
//12 9
//10 9
//10 11 
//12 11