Gym - 101480H[期望概率+半平面交面积]

题目链接:http://fastvj.rainng.com/problem/Gym-101480H

 

解题思路:

实际上概率问题很容易就看的出来，不过要注意骰子那块是不能算的。然后就是算y = 0.5,y = -0.5,x = 0.5,x = -0.5的直线和底面正方形的面积交，然后还有一个5朝上的概率就更好求了，实际上最主要的就是求面积交。

#include<math.h>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef long long ll;
const int mx = 1e5 + 10;
int n,top;
double erea;
struct node
{
	double x,y;
}s[mx],tu[mx],w;
double judge(node p1,node p2,node p0) 
{
	double ans = (p1.x-p0.x)*(p2.y-p0.y) - (p2.x-p0.x)*(p1.y-p0.y);
	return ans;
}
bool cmp(node a,node b)
{
	double c = judge(w,b,a); 
	if(!c) return pow(a.x-w.x,2)+pow(a.y-w.y,2) < pow(b.x-w.x,2)+pow(b.y-w.y,2);
	return c < 0;
}
void sortbeg(int n){
	int p = 0;
	for(int i=0;i<n;i++){
		if(tu[i].y<tu[p].y) p = i;
		else if(tu[i].y==tu[p].y&&tu[i].x<tu[p].x) p = i;
	}
	swap(tu[0],tu[p]),w.x = tu[0].x,w.y = tu[0].y;
	sort(tu+1,tu+n,cmp);
}
double get(node A,node B,int len)
{
	tu[len++] = A,tu[len++] = B;
	sortbeg(len);
	double ret = 0;
	for(int i=1;i<len-1;i++)
	ret += fabs(judge(tu[0],tu[i],tu[i+1]));
	return ret / 2;
}
double getx(node A,node B,double y)
{
	return (y-A.y)*(B.x-A.x)/(B.y-A.y) + A.x;
}
double gety(node A,node B,double x)
{
	return (x-A.x)*(B.y-A.y)/(B.x-A.x) + A.y;
}
int main()
{
	for(int i=0;i<4;i++)
	scanf("%lf%lf",&s[i].x,&s[i].y);
	node A[2];
	double ans = 0;
	int siz,i,id;
	A[0].y = A[1].y = 0.5;
	for(id=i=0;i<4;i++){
		if(s[i].y==A[0].y) A[id++] = s[i];
		else if((s[i].y-A[0].y)*(s[(i+1)%4].y-A[0].y)<0)
		A[id++].x = getx(s[i],s[(i+1)%4],A[0].y); 
	} 
	for(siz=i=0;i<4;i++) if(s[i].y>A[0].y)
	tu[siz++] = s[i];
	ans += 6*get(A[0],A[1],siz);
	A[0].y = A[1].y = -0.5;
	for(id=i=0;i<4;i++){
		if(s[i].y==A[0].y) A[id++] = s[i];
		else if((s[i].y-A[0].y)*(s[(i+1)%4].y-A[0].y)<0)
		A[id++].x = getx(s[i],s[(i+1)%4],A[0].y); 
	} 
	for(siz=i=0;i<4;i++) if(s[i].y<A[0].y)
	tu[siz++] = s[i];
	ans += get(A[0],A[1],siz);
	A[0].x = A[1].x = 0.5;
	for(id=i=0;i<4;i++){
		if(s[i].x==A[0].x) A[id++] = s[i];
		else if((s[i].x-A[0].x)*(s[(i+1)%4].x-A[0].x)<0)
		A[id++].y = gety(s[i],s[(i+1)%4],A[0].x); 
	} 
	for(siz=i=0;i<4;i++) if(s[i].x>A[0].x)
	tu[siz++] = s[i];
	ans += 3*get(A[0],A[1],siz);
	A[0].x = A[1].x = -0.5;
	for(id=i=0;i<4;i++){
		if(s[i].x==A[0].x) A[id++] = s[i];
		else if((s[i].x-A[0].x)*(s[(i+1)%4].x-A[0].x)<0)
		A[id++].y = gety(s[i],s[(i+1)%4],A[0].x); 
	} 
	for(siz=i=0;i<4;i++) if(s[i].x<A[0].x)
	tu[siz++] = s[i];
	ans += 4*get(A[0],A[1],siz);
	printf("%.10lf\n",(ans+1.0*5*5*4)*5.0/124.0);
	return 0;
}