栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

zoj 3027 Roll

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

zoj 3027 Roll

#include <cstdlib> #include <cmath>#include <cstdio>#include <algorithm>using namespace std;int sx, sy, ex, ey;int minx, maxx, miny, maxy, h;inline int sign(int x){    if (x > 0) return 1;    else if (x < 0) return -1;    else return 0;}inline int xmult(int x1, int y1, int x2, int y2){    return x1 * y2 - y1 * x2;}inline bool sameside(int x1, int y1, int x2, int y2, int xa, int ya, int xb, int yb){    int x = xa - xb, y = ya - yb;    return sign(xmult(x1 - xb, y1 - yb, x, y)) * sign(xmult(x2 - xb, y2 - yb, x, y)) > 0;}inline bool diffside(int x1, int y1, int x2, int y2, int xa, int ya, int xb, int yb){    int x = xa - xb, y = ya - yb;    return sign(xmult(x1 - xb, y1 - yb, x, y)) * sign(xmult(x2 - xb, y2 - yb, x, y)) < 0;}inline bool intersect(int x1, int y1, int x2, int y2, int xa, int ya, int xb, int yb){    return diffside(x1, y1, x2, y2, xa, ya, xb, yb) && diffside(xa, ya, xb, yb, x1, y1, x2, y2);}inline double dis(int x1, int y1, int x2, int y2){    return hypot(x1 - x2, y1 - y2);}double distoseg(int xx, int yy, int x1, int y1, int x2, int y2){    int x = xx + y1 - y2, y = yy + x2 - x1;    if (sameside(x1, y1, x2, y2, x, y, xx, yy)) {        return min(dis(x1, y1, xx, yy), dis(x2, y2, xx, yy));    }    else {        return fabs(xmult(xx - x2, yy - y2, x1 - x2, y1 - y2) / dis(x1, y1, x2, y2));    }}inline bool inRect(int x, int y){    return minx <= x && x <= maxx && miny <= y && y <= maxy;}inline double getR(int h, double d){    if (d <= h) {        return d;    }    else {        return (h * h + d * d) / (2 * h);    }}double gao(){    static const int n[4] = {1, 2, 3, 0};    static int p[4][2];    double ret = 1024.0;    if (inRect(sx, sy) || inRect(ex, ey)) {        return 0.0;    }    p[0][0] = minx, p[0][1] = miny;    p[1][0] = minx, p[1][1] = maxy;    p[2][0] = maxx, p[2][1] = maxy;    p[3][0] = maxx, p[3][1] = miny;    for (int i = 0; i < 4; i++) {        if (intersect(sx, sy, ex, ey, p[i][0], p[i][1], p[n[i]][0], p[n[i]][1])) { return 0.0;        }    }    for (int i = 0; i < 4; i++) {        ret = ret < getR(h, distoseg(sx, sy, p[i][0], p[i][1], p[n[i]][0], p[n[i]][1])) ? ret : getR(h, distoseg(sx, sy, p[i][0], p[i][1], p[n[i]][0], p[n[i]][1]));        ret = ret < getR(h, distoseg(ex, ey, p[i][0], p[i][1], p[n[i]][0], p[n[i]][1])) ? ret : getR(h, distoseg(ex, ey, p[i][0], p[i][1], p[n[i]][0], p[n[i]][1]));    }    if (sx != ex || sy != ey) {        for (int i = 0; i < 4; i++) { ret = ret < getR(h, distoseg(p[i][0], p[i][1], sx, sy, ex, ey)) ? ret : getR(h, distoseg(p[i][0], p[i][1], sx, sy, ex, ey));        }    }    return ret;}int main(){    int n;    double ans;    while (scanf("%d", &n) != EOF && n > 0) {        scanf("%d%d%d%d", &sx, &sy, &ex, &ey);        ans = 1024.0;for (int i = 0; i < n; i++) { scanf("%d%d%d%d%d", &minx, &miny, &maxx, &maxy, &h); ans = ans < gao() ? ans : gao();        }        printf("%.6lfn", ans);    }    return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/370495.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号