Red Huang

Red Huang

uva 10060

多角形の面積計算

//====================================================================||  
//                                                                    ||  
//                                                                    ||  
//                         Author : GCA                               ||  
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||  
//====================================================================||  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
using namespace std;  
#ifdef ONLINE\_JUDGE  
#define ll "%lld"  
#else  
#define ll "%I64d"  
#endif  
typedef unsigned int uint;  
typedef long long int Int;  
#define Set(a,s) memset(a,s,sizeof(a))  
#define Write(w) freopen(w,"w",stdout)  
#define Read(r) freopen(r,"r",stdin)  
#define Pln() printf("\\n")  
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()  
#define De(x)printf(#x"%d\\n",x)  
#define For(i,x)for(int i=0;i<x;i++)  
#define CON(x,y) x##y  
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\  
    printf("%d ",dp\[htx\]\[hty\]);}Pln();}  
#define M 55  
#define PII pair<int,int\>  
#define PB push\_back  
#define oo INT\_MAX  
#define Set\_oo 0x3f  
#define Is\_debug true  
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)  
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)  
#define eps 1e-6  
bool xdy(double x,double y){return x>y+eps;}  
bool xddy(double x,double y){return x>y-eps;}  
bool xcy(double x,double y){return x<y-eps;}  
bool xcdy(double x,double y){return x<y+eps;}  
int min3(int x,int y,int z){  
    int tmp=min(x,y);  
    return min(tmp,z);  
}  
int max3(int x,int y,int z){  
    int tmp=max(x,y);  
    return max(tmp,z);  
}  
int n;  
double pi=acos(-1);  
struct polys{  
    double px\[2000\];  
    double py\[2000\];  
    double th;  
    int pn;  
    polys(){  
        pn=0;  
    }  
}poly\[20000\];  
char str\[20000\];  
double cal(int a){  
    double ans=0;  
    for(int i=2;i<poly\[a\].pn;i++){  
        double x=poly\[a\].px\[i-1\]-poly\[a\].px\[0\];  
        double y=poly\[a\].py\[i-1\]-poly\[a\].py\[0\];  
        double x2=poly\[a\].px\[i\]-poly\[a\].px\[0\];  
        double y2=poly\[a\].py\[i\]-poly\[a\].py\[0\];  
        ans+=(x\*y2-x2\*y);  
//        debug("%lf\\n",ans);  
    }  
    ans=fabs(ans);  
    ans\*=poly\[a\].th;  
    ans/=2.00;  
    return ans;  
}  
void clear(){  
    for(int i=0;i<n;i++)poly\[i\].pn=0;  
}  
int main() {  
    ios\_base::sync\_with\_stdio(0);  
    while(~scanf("%d%\*c",&n)&&n){  
        double r,th;  
        for(int i=0;i<n;i++){  
            gets(str);  
            int j,t;  
            sscanf(str,"%lf%n",&poly\[i\].th,&j);  
            while(~sscanf(str+j,"%lf%lf%n",&poly\[i\].px\[poly\[i\].pn\],&poly\[i\].py\[poly\[i\].pn\],&t)){  
//                debug("%lf %lf\\n",poly\[i\].px\[poly\[i\].pn\],poly\[i\].py\[poly\[i\].pn\]);  
                poly\[i\].pn++;  
                j+=t;  
            }  
        }  
        scanf("%lf%lf",&r,&th);  
        double ans=0;  
        for(int i=0;i<n;i++)ans+=cal(i);  
//        debug("%lf %lf\\n",ans,(r\*r\*pi\*th));  
        printf("%d\\n",(int)(ans/(r\*r\*pi\*th)));  
        clear();  
//        printf("ook");  
    }  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
}  

読み込み中...
文章は、創作者によって署名され、ブロックチェーンに安全に保存されています。