ZOJ 2777 Visible Lattice Points

我的想法是打表 求所有线段(0,0) (x,y)的斜率,有重复说明就是挡住了,用了map判重,运行了近1s,弱爆了.

#include <cstdio>
#include <iostream>
#include <memory.h>
#include <cmath>
#include <map>
using namespace std;
int n;
map<double, bool>exi;
double getK(int x1, int x2, int y1, int y2){
	return ((double)y2 - y1) / ((double)x2 - x1);
}
int ans[1001];
int main(){
	int tmp = 0;
	for(int k = 0; k <= 1000; ++k){
		for(int i = 1; i <= k; ++i){
			double  kv = getK(0, i, 0, k);
			if(!exi[kv]){
				exi[kv] = 1;
				tmp ++;
			}
			kv = getK(0, k, 0, i);
			if(!exi[kv]){
				exi[kv] = 1;
				tmp++;
			}
		}
		ans[k] = tmp + 2;
	}
	
	int T, cas = 1;
	scanf("%d", &T);
	while(T--){
		scanf("%d", &n);
		printf("%d %d %d\n", cas++, n, ans[n]);
	}
	return 0;
}