zoukankan      html  css  js  c++  java
  • IEEEXtreme 10.0

    这是 meelo 原创的 IEEEXtreme极限编程大赛题解

    Xtreme 10.0 - Ellipse Art

    题目来源 第10届IEEE极限编程大赛

    https://www.hackerrank.com/contests/ieeextreme-challenges/challenges/ellipse-art

    In IEEEXtreme 9.0, you met the famous artist, I.M. Blockhead. This year we want to introduce you to another famous artist, Ivy Lipps. Unlike I.M., Ivy makes her art by painting one or more ellipses on a canvas. All of her canvases measure 100 by 100 cms.

    She needs your help. When she is done with the painting, she would like to know how much of the canvas is unpainted.

    Input Format

    The first line of input contains t, 1 ≤ t ≤ 8, which gives the number of test cases.

    Each test case begins with a single integer, n, 1 ≤ n ≤ 40, which indicates the number of ellipses that Ivy has drawn.

    The following n lines give the dimensions of each ellipse, in the following format:

    x1 y1 x2 y2 r
    

    Where:

    • (x1y1) and (x2y2) are positive integers representing the location of the foci of the ellipse in cms, considering the center of the canvas to be the origin, as in the image below.

    • r is a positive integer giving the length of the ellipse's major axis

    You can refer to the Wikipedia webpage for background information on ellipses.

    Coordinate system for the canvas.

    Constraints

    -100 ≤ x1y1x2y2 ≤ 100

    r ≤ 200

    r ≥ ((x2 - x1)2 + (y2 - y1)2)1/2 + 1

    Note that these constraints imply that a given ellipse does not need to fall completely on the canvas (or even on the canvas at all).

    Output Format

    For each test case, output to the nearest percent, the percent of the canvas that is unpainted.

    Note: The output should be rounded to the nearest whole number. If the percent of the canvas that is unpainted is not a whole number, you are guaranteed that the percent will be at least 10% closer to the nearer percent than it is from the second closest whole percent. Therefore you will not need to decide whether a number like 23.5% should be rounded up or rounded down.

    Sample Input

    3
    1
    -40 0 40 0 100
    1
    10 50 90 50 100
    2
    15 -20 15 20 50
    -10 10 30 30 100
    

    Sample Output

    53%
    88%
    41%
    

    Explanation

    The ellipse in the first test case falls completely within the canvas, and it has an area of approximately 4,712 cm2. Since the canvas is 10,000 cm2, 53% of the canvas is unpainted.

    In the second test case, the ellipse has the same size as in the first, but only one quarter of the ellipse is on canvas. Therefore, 88% of the canvas is unpainted.

    In the final testcase, the ellipses overlap, and 41% of the canvas is unpainted.

    题目解析

    计算几何题,无法直接计算面积。

    使用撒点法/蒙特卡洛模拟,计算椭圆内的点数占总点数的比率即可。

    在x轴和y轴以0.2为间隔取点可以满足精度要求。

    程序

    C++

    #include <cmath>
    #include <cstdio>
    #include <vector>
    #include <iostream>
    #include <algorithm>
    using namespace std;
    
    double ellip[41][5];
    int n;
    
    double dist(double x1, double y1, double x2, double y2) {
        return sqrt(pow(x2-x1, 2) + pow(y2-y1, 2));
    }
    
    // 判断点(x,y)是否在任意一个椭圆内
    bool check(double x, double y) { for(int i=0; i<n; i++) { if( dist(ellip[i][0], ellip[i][1], x, y) + dist(ellip[i][2], ellip[i][3], x, y) < ellip[i][4]) { return true; } } return false; } int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */ int T; cin >> T; while(T--) { cin >> n; for(int j=0; j<n; j++) { for(int k=0; k<5; k++) cin >> ellip[j][k]; }
    // 统计位于椭圆内点的个数
    int count = 0; for(double x=-50; x<50; x+=0.2) { for(double y=-50; y<50; y+=0.2) { if(!check(x, y)) count++; } } cout << round(count / 2500.0) << "%" << endl; } return 0; }

    博客中的文章均为 meelo 原创,请务必以链接形式注明 本文地址

  • 相关阅读:
    [转]2013豆瓣校园招聘研发类笔试题
    【强烈推荐】《剑指Offer:名企面试官精讲典型编程题》一书中IT名企经典面试题
    [转]2013百度校园招聘-机器学习和数据挖掘工程师-笔试题
    [转]一个应届计算机毕业生的2012求职之路
    图片镜像
    家有学霸的CEO
    盯盯拍Android App 3.0指导
    淘宝领取金币
    儿童散光眼的分类
    女孩被宠坏叫爷爷滚开
  • 原文地址:https://www.cnblogs.com/meelo/p/5998148.html
Copyright © 2011-2022 走看看