uva 10556 - Biometrics(几何)
2015-08-17 21:23
330 查看
题目链接:uva 10556 - Biometrics
旋转角度可长度比例相同即可,注意精度。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
struct Point {
ll x, y;
void read() { scanf("%lld%lld", &x, &y); }
Point (ll x = 0, ll y = 0): x(x), y(y) {}
Point operator + (const Point& u) { return Point(x+u.x,y+u.y); }
Point operator - (const Point& u) { return Point(x-u.x,y-u.y); }
ll operator * (const Point& u) { return x*u.y - y*u.x; }
};
const int maxn = 20;
int N;
Point A[maxn], B[maxn];
ll dis(Point u) {
return u.x*u.x + u.y*u.y;
}
bool judge () {
if (N <= 2)
return true;
ll rad = (A[1]-A[0]) * (B[1] - B[0]);
ll lenA = dis(A[1]-A[0]), lenB = dis(B[1]-B[0]);
for (int i = 2; i < N; i++) {
ll trad = (A[i]-A[0]) * (B[i]-B[0]);
ll tlenA = dis(A[i]-A[0]), tlenB = dis(B[i]-B[0]);
if (tlenA*lenB != tlenB*lenA || trad*trad*lenA*lenB != rad*rad*tlenA*tlenB)
return false;
}
return true;
}
int main () {
while (scanf("%d", &N) == 1 && N) {
for (int i = 0; i < N; i++) A[i].read();
for (int i = 0; i < N; i++) B[i].read();
printf("%s\n", judge() ? "similar" : "dissimilar");
}
return 0;
}
旋转角度可长度比例相同即可,注意精度。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
struct Point {
ll x, y;
void read() { scanf("%lld%lld", &x, &y); }
Point (ll x = 0, ll y = 0): x(x), y(y) {}
Point operator + (const Point& u) { return Point(x+u.x,y+u.y); }
Point operator - (const Point& u) { return Point(x-u.x,y-u.y); }
ll operator * (const Point& u) { return x*u.y - y*u.x; }
};
const int maxn = 20;
int N;
Point A[maxn], B[maxn];
ll dis(Point u) {
return u.x*u.x + u.y*u.y;
}
bool judge () {
if (N <= 2)
return true;
ll rad = (A[1]-A[0]) * (B[1] - B[0]);
ll lenA = dis(A[1]-A[0]), lenB = dis(B[1]-B[0]);
for (int i = 2; i < N; i++) {
ll trad = (A[i]-A[0]) * (B[i]-B[0]);
ll tlenA = dis(A[i]-A[0]), tlenB = dis(B[i]-B[0]);
if (tlenA*lenB != tlenB*lenA || trad*trad*lenA*lenB != rad*rad*tlenA*tlenB)
return false;
}
return true;
}
int main () {
while (scanf("%d", &N) == 1 && N) {
for (int i = 0; i < N; i++) A[i].read();
for (int i = 0; i < N; i++) B[i].read();
printf("%s\n", judge() ? "similar" : "dissimilar");
}
return 0;
}
相关文章推荐
- BNU Training 2015.08.17
- 删除百度搜索结果页山寨网站排名的方法
- Swing图形界面程序—同学通讯录系统(1)
- scanf
- 小P寻宝记——好基友一起走
- 大数据算法学习笔记(七):外存算法
- uva 10335 - Ray Inside a Polygon(几何)
- qq好友列表 模拟
- 小P寻宝记——粗心的基友
- POJ 2187 Beauty Contest(凸包求最远点距离)
- Buy or Build
- ZOJ3822——概率DP——Domination
- Office导入导出组件权限配置汇总
- Linux rpmbuild命令
- 解密谷歌的大数据技术
- 接口
- POJ 1182 食物链(带权并查集)
- HDU1811-Rank of Tetris
- POJ3468 A Simple Problem with Integers 【段树】+【成段更新】
- 洛谷1514 引水入城