K - Triangle 计蒜客

K - Triangle 计蒜客 - 42405

题意：

给你一个三角形的三点，再给你三角形边上一个点，让你求另一个点(也要在三角形上)，使得平分三角形的面积

题解:

计算几何
三角形的三边ab，ac，bc
如果点p在ab上，离a点更近的话，另一个点在bc上，反之在ac上，如果在bc上，就开始二分bc上的点，二分个1000来遍差不多就能得到另一个点
计算几何要求熟练使用模板，整个代码基本上都是模板，就看你会不会用
在计算几何这方面我还需要多练练

代码：

#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n,m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n,m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sc(n) scanf("%c",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mod(x) ((x)%MOD)
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x&-x)
#define pii map<int,int>
#define mk make_pair
#define rtl rt<<1
#define rtr rt<<1|1typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
//const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
//const int inf = 0x3f3f3f3f;
inline int read()
{int ret = 0, sgn = 1;char ch = getchar();while(ch < '0' || ch > '9'){if(ch == '-')sgn = -1;ch = getchar();}while (ch >= '0' && ch <= '9'){ret = ret*10 + ch - '0';ch = getchar();}return ret*sgn;
}
inline void Out(int a)
{if(a>9) Out(a/10);putchar(a%10+'0');
}
int qpow(int m, int k, int mod)
{int res = 1, t = m;while (k){if (k&1)res = res * t % mod;t = t * t % mod;k >>= 1;}return res;
}
ll gcd(ll a,ll b){return b==0?a : gcd(b,a%b);}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
ll inv(ll x,ll m){return qpow(x,m-2,m)%m;}const int N = 5e5+10;
int n,m;
typedef double db;
const db eps = 1e-8;
const db inf = 1e20;
const db pi = acos(-1.0);int sgn(db x){if(fabs(x) < eps)return 0;if(x < 0)return -1;else return 1;
}struct Point{db x, y;Point(){}Point(db _x, db _y){x = _x;y = _y;}void input(){scanf("%lf%lf", &x, &y);}bool operator == (Point b)const{return sgn(x-b.x) == 0 && sgn(y-b.y) == 0;}Point operator -(const Point &b)const{return Point(x-b.x, y-b.y);}//叉积db operator ^(const Point &b)const{return x*b.y - y*b.x;}//点积db operator *(const Point &b)const{return x*b.x + y*b.y;}//返回两点的距离db dis(Point p){return hypot(x-p.x, y-p.y);}Point operator +(const Point &b)const{return Point(x+b.x, y+b.y);}Point operator *(const db &k)const{return Point(x*k, y*k);}Point operator /(const db &k)const{return Point(x/k, y/k);}
};struct Line{Point s,e;Line(){}Line(Point _s,Point _e){s = _s;e = _e;}// 点在线段上的判断bool pointonseg(Point p){return sgn((p-s)^(e-s)) == 0 && sgn((p-s) * (p-e)) <= 0;}// 求两直线的交点Point crosspoint(Line v){double a1 = (v.e-v.s)^(s-v.s);double a2 = (v.e-v.s)^(e-v.s);return Point((s.x*a2-e.x*a1)/(a2-a1),(s.y*a2-e.y*a1)/(a2-a1));}
};// 求点a和点b的中点
Point get_mid(Point a, Point b) {return (a + b) * 0.5;
}// 根据三个点计算三角形面积
double area(Point a,Point b,Point c)
{return fabs((b - a) ^ (c - a) * 0.5);
}signed main()
{int t = 1;Point a,b,c,p;Line ab,ac,bc;sd(t);while(t--){a.input(),b.input(),c.input(),p.input();ab = Line(a,b),ac = Line(a,c),bc = Line(b,c);db s2 = area(a,b,c)/2;if(!ab.pointonseg(p) && !ac.pointonseg(p) && !bc.pointonseg(p)){cout<<-1<<endl;continue;}if(ab.pointonseg(p))//如果p在ab上 {// 离a点更近 那么另一点在bc上 反之在ac上。if(a.dis(p) < b.dis(p))//说明另一点在bc上 {Point l = b,r = c;Point mid = get_mid(l,r);int time = 1000;while(time--){mid = get_mid(l,r);db s = area(mid,p,b);int flag = sgn(s-s2);//判断s和s2的面积 if(flag == 0)break;if(flag == 1)//s>s2，当S的面积更大，此时要缩小面积，说明终点在左侧 r = mid;elsel = mid;//s<s2}printf("%.10lf %.10lf\n",mid.x,mid.y);}else//另一个点在ac上 {Point l = a,r = c;Point mid = get_mid(l,r);int time = 1000;while(time--){mid = get_mid(l,r);db s = area(mid,p,a);int flag = sgn(s-s2);if(flag == 0)break;if(flag == 1)r = mid;elsel = mid;}printf("%.10lf %.10lf\n",mid.x,mid.y);}}else if(ac.pointonseg(p)){if(a.dis(p) < c.dis(p)){Point l = c,r = b;Point mid = get_mid(l,r);int time = 1000;while(time--){mid = get_mid(l,r);db s = area(mid,p,c);int flag = sgn(s-s2);if(flag == 0)break;if(flag == 1)r = mid;elsel = mid;}printf("%.10lf %.10lf\n",mid.x,mid.y);}else{Point l = a,r = b;Point mid = get_mid(l,r);int time = 1000;while(time--){mid = get_mid(l,r);db s = area(mid,p,a);int flag = sgn(s-s2);if(flag == 0)break;if(flag == 1)r = mid;elsel = mid;}printf("%.10lf %.10lf\n",mid.x,mid.y);}}else{if(b.dis(p) < c.dis(p)){Point l = c,r = a;Point mid = get_mid(l,r);int time = 1000;while(time--){mid = get_mid(l,r);db s = area(mid,p,c);int flag = sgn(s-s2);if(flag == 0)break;if(flag == 1)r = mid;elsel = mid;}printf("%.10lf %.10lf\n",mid.x,mid.y);}else{Point l = b,r = a;Point mid = get_mid(l,r);int time = 1000;while(time--){mid = get_mid(l,r);db s = area(mid,p,b);int flag = sgn(s-s2);if(flag == 0)break;if(flag == 1)r = mid;elsel = mid;}printf("%.10lf %.10lf\n",mid.x,mid.y);}}}return 0;
}

K - Triangle 计蒜客 - 42405相关推荐

计蒜客挑战难题爬楼梯
计蒜客挑战难题爬楼梯假设你现在正在爬楼梯,楼梯有n级.每次你只能爬1级或者2级,那么你有多少种方法爬到楼梯的顶部? 格式: 第一行输入一个数n(n<=50),代表楼梯的级数. 接下来一行输 ...
C - Digital Path 计蒜客 - 42397 05-29
C - Digital Path 计蒜客 - 42397 题意: 题意就是给出一个n ∗ m的数字矩阵每个矩阵元素之间只能上下左右走,而且下一个位置必须比当前位置的数字大1,入口和出口必须数边缘元素, ...
计蒜客 17115 2017 ICPC 西安网络赛 B Coin
Problem nanti.jisuanke.com/t/17115 Reference 关于二项展开式系数和 [二项式定理][推导]计蒜客17115 2017 ACM-ICPC 亚洲区(西安赛区)网 ...
12.计蒜客信息学题库：T1702 魔法宝石
12.计蒜客信息学题库:T1702 魔法宝石 Bessie 去珠宝商店想要买一些魔法宝石.商店里有 n 个宝石,每个宝石的重量为 wi,幸运值为 vi .Bessie 的购物车只能装重量之和不超过 m ...
计蒜客 2020 蓝桥杯大学 A 组省赛模拟赛（一）题目及解析
新手,欢迎交流,剩下D题不知如何下手,望大佬指教. 计蒜客 2020 蓝桥杯大学 B 组省赛模拟赛 (一)题目及解析文章目录 A. 结果填空:计算周长 B. 结果填空:七巧板 C. 结果填空:苹果 ...
计蒜客一月入门赛：《三个火枪手》题解
题目链接(https://nanti.jisuanke.com/t/52314) 有 n 个人,其中有 m 对相互认识的关系. 一个人的知名度定义为有多少人和他相互认识. 现在蒜头君需要从这 n ...
计蒜客题解——T1414：抠图
题目相关题目链接计蒜客,https://nanti.jisuanke.com/t/T1414. 我的 OJ,http://47.110.135.197/problem.php?id=4768. 题 ...
[计蒜客][二分]切割钢管
题目来源计蒜客程序设计竞赛基础课(蓝桥杯省赛) 算法标签二分题目描述思路我们要算最高数量,则要计算某一个高度,总共能被N个钢管切出K个来计算一个钢管能切出多少只需要a[i]/NUM 只要计 ...
计蒜客超级书架2题解
题目链接: https://nanti.jisuanke.com/t/T1736 首先这道题是一道典型的DFS题.我们需要用DFS枚举最小距离,就行了. 首先需要头文件和定义: #include< ...

K - Triangle 计蒜客 - 42405

题意：

题解:

代码：

K - Triangle 计蒜客 - 42405相关推荐

最新文章

热门文章