hdu 1724 Ellipse(自适应Simpson积分) (模板)
来源:互联网 发布:金博宝芝林软件破解版 编辑:程序博客网 时间:2024/05/16 15:55
传送门
Simpson积分。
这道题中椭圆公式为(x/a)^2+(y/b)^2=1 因此f(x)=2*b*sqrt(1-x^2/a^2)
//china no.1#pragma comment(linker, "/STACK:1024000000,1024000000")#include <vector>#include <iostream>#include <string>#include <map>#include <stack>#include <cstring>#include <queue>#include <list>#include <stdio.h>#include <set>#include <algorithm>#include <cstdlib>#include <cmath>#include <iomanip>#include <cctype>#include <sstream>#include <functional>#include <stdlib.h>#include <time.h>#include <bitset>using namespace std;#define pi acos(-1)#define s_1(x) scanf("%d",&x)#define s_2(x,y) scanf("%d%d",&x,&y)#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)#define S_1(x) scan_d(x)#define S_2(x,y) scan_d(x),scan_d(y)#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)#define PI acos(-1)#define endl '\n'#define srand() srand(time(0));#define me(x,y) memset(x,y,sizeof(x));#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)#define close() ios::sync_with_stdio(0); cin.tie(0);#define FOR(x,n,i) for(int i=x;i<=n;i++)#define FOr(x,n,i) for(int i=x;i<n;i++)#define fOR(n,x,i) for(int i=n;i>=x;i--)#define fOr(n,x,i) for(int i=n;i>x;i--)#define W while#define sgn(x) ((x) < 0 ? -1 : (x) > 0)#define bug printf("***********\n");#define db double#define ll long long#define mp make_pair#define pb push_backtypedef long long LL;typedef pair <int, int> ii;const int INF=0x3f3f3f3f;const LL LINF=0x3f3f3f3f3f3f3f3fLL;const int dx[]={-1,0,1,0,1,-1,-1,1};const int dy[]={0,1,0,-1,-1,1,-1,1};const int maxn=4e3+10;const int maxx=4e5+10;const double EPS=1e-8;const double eps=1e-8;const int mod=1e9+7;template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}template <class T>inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}if(IsN) num=-num;return true;}void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}void print(LL a){ Out(a),puts("");}//freopen( "in.txt" , "r" , stdin );//freopen( "data.txt" , "w" , stdout );//cerr << "run time is " << clock() << endl;double a,b,L,R;double F(double x){ return 2*b*sqrt((double)1-x*x/(a*a));}double simpson(double a,double b){ double c = a + (b-a)/2; return (F(a) + 4*F(c) + F(b))*(b-a)/6;}double asr(double a,double b,double eps,double A){ double c = a + (b-a)/2; double L = simpson(a,c); double R = simpson(c,b); if(fabs(L+R-A) <= 15*eps)return L+R+(L+R-A)/15; return asr(a,c,eps/2,L) + asr(c,b,eps/2,R);}double asr(double a,double b,double eps){ return asr(a,b,eps,simpson(a,b));}int n;int main(){ double k; scanf("%d",&n); while(n--) { scanf("%lf%lf%lf%lf",&a,&b,&L,&R); k=asr(L,R,1e-6); printf("%.3f\n",k); } return 0;}
阅读全文
0 0
- hdu 1724 Ellipse(自适应Simpson积分) (模板)
- HDU 1724 Ellipse 【自适应Simpson积分】
- 【自适应Simpson积分】hdu 1724 Ellipse
- hdu 1724 Ellipse simpson积分
- HDU-#1724 Ellipse(自适应Simpson法+数值积分)
- hdoj-1724 Ellipse(自适应Simpson积分)
- HDOJ 1724 Ellipse(自适应simpson积分)
- HDU 1724 Ellipse 自适应simpson函数模板题(二)
- hdu 1724 Ellipse(simpson求积分)
- hdu 1724 Ellipse(Simpson积分法)
- HDU 1724 Ellipse (自适应辛普森积分模板题)
- hdu 1724 Ellipse (自适应辛普森求积分 模板题)
- 【HDU1724】Ellipse-自适应Simpson积分法
- HDU 1724 Ellipse (simpson公式,求积分)
- HDOJ 1724 Ellipse 自适应Simpson
- Hdu 1724 Ellipse (自适应辛普森积分法)
- HDU 1724 Ellipse 自适应辛普森积分
- HDU 1724 Ellipse (自适应辛普森积分)
- 【UVA 673 Parentheses】 & 栈
- leetcode 347. Top K Frequent Elements 使用HashMap计数
- < 笔记 > Python
- 【UVa12265】Selling Land 贩卖土地
- 集合的整数表示
- hdu 1724 Ellipse(自适应Simpson积分) (模板)
- Progress of 96Board Camera MIPI Mezzanine
- SoftMax回归简介及python代码实现
- 大学生职业生涯规划
- luogu3009 [USACO11JAN]利润Profits
- Bilibili Spider 经验总结
- UVa213 Message Decoding
- qsort
- RMQ与用RMQ做LCA