LA 3905（扫描线)

最新推荐文章于 2022-03-22 14:25:07 发布

akxxsb

最新推荐文章于 2022-03-22 14:25:07 发布

阅读量680

点赞数

分类专栏：数学文章标签：扫描线

本文链接：https://blog.csdn.net/acvcla/article/details/50045667

版权

数学专栏收录该内容

27 篇文章 0 订阅

订阅专栏

Meteor

Time Limit: 3000ms

Memory Limit: 131072KB

This problem will be judged on UVALive. Original ID: 3905
64-bit integer IO format: %lld Java class name: Main

Prev Submit Status Statistics Discuss Next

Font Size:

Type:

[PDF Link]

The famous Korean internet company nhn has provided an internet-based photo service which allows The famous Korean internet company users to directly take a photo of an astronomical phenomenon in space by controlling a high-performance telescope owned by nhn. A few days later, a meteoric shower, known as the biggest one in this century, is expected. nhn has announced a photo competition which awards the user who takes a photo containing as many meteors as possible by using the photo service. For this competition, nhn provides the information on the trajectories of the meteors at their web page in advance. The best way to win is to compute the moment (the time) at which the telescope can catch the maximum number of meteors.

You have n meteors, each moving in uniform linear motion; the meteor m_i moves along the trajectory p_i + t×v_i over time t , where t is a non-negative real value, p_i is the starting point of m_i and v_i is the velocity of m_i . The point p_i = (x_i, y_i) is represented by X -coordinate x_i and Y -coordinate y_i in the (X, Y) -plane, and the velocityv_i = (a_i, b_i) is a non-zero vector with two components a_i and b_i in the (X, Y) -plane. For example, if p_i = (1, 3) and v_i = (-2, 5) , then the meteor m_i will be at the position (0, 5.5) at time t = 0.5 because p_i + t×v_i = (1, 3) + 0.5×(-2, 5) = (0, 5.5) . The telescope has a rectangular frame with the lower-left corner (0, 0) and the upper-right corner (w, h) . Refer to Figure 1. A meteor is said to be in the telescope frame if the meteor is in the interior of the frame (not on the boundary of the frame). For exam! ple, in Figure 1, p₂, p₃, p₄ , and p₅ cannot be taken by the telescope at any time because they do not pass the interior of the frame at all. You need to compute a time at which the number of meteors in the frame of the telescope is maximized, and then output the maximum number of meteors.

$\epsfbox{p3905.eps}$

Input

Your program is to read the input from standard input. The input consists of T test cases. The number of test cases T is given in the first line of the input. Each test case starts with a line containing two integers w and h (1 $\le$ w, h $\le$ 100, 000) , the width and height of the telescope frame, which are separated by single space. The second line contains an integer n , the number of input points (meteors), 1 $\le$ n $\le$ 100, 000 . Each of the next n lines contain four integers x_i, y_i, a_i , and b_i ; (x_i, y_i) is the starting point p_i and (a_i, b_i) is the nonzero velocity vector v_i of the i -th meteor; x_i and y_i are integer values between -200,000 and 200,000, and a_i and b_i are integer values between -10 and 10. Note that at least one of a_i and b_i is not zero. These four values are separated by single spaces. We assume that all starting points p_i are distinct.

Output

Your program is to write to standard output. Print the maximum number of meteors which can be in the telescope frame at some moment.

Sample Input

Sample Output

1 
2

Source

Regionals 2007, Asia - Seoul

Prev Submit Status Statistics Discuss Next

给出一个矩形，还有n个星星，星星可以看成质点，告诉你星星的坐标和速度，求矩形最多能包含多少个星星（边界上的不算），处理出每个星星在矩形里的时间区间，然后用扫描线。大白P47.

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
struct Node
{
    double x;
    bool Type;
    bool operator < (const Node & rhs) const {
        if(x == rhs.x) return Type > rhs.Type;
        return x < rhs.x;
    }
}Item[maxn<<1];
void Modify(int pos,int w,double v,double &L,double &R)
{
    if(v == 0) {
        if(pos <= 0 || pos >= w) R = L-1;
        return ;
    }else if(v > 0) {
        L = max(L,-pos/v);
        R = min(R,(w-pos)/v);
    }else {
        L = max(L,(w-pos)/v);
        R = min(R,-pos/v);
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    for(int cas = 1; cas <= T; ++cas) {
        int w,h;scanf("%d%d",&w,&h);
        int n;scanf("%d",&n);
        int tot = 0;
        for(int i = 0; i < n; ++i) {
            int x,y,dx,dy;
            scanf("%d%d%d%d",&x,&y,&dx,&dy);
            double L = 0, R = 1e10;
            Modify(x,w,dx,L,R);
            Modify(y,h,dy,L,R);
            //printf("%.2f %.2f\n",L,R);
            if(R > L) {
                Item[tot++] = (Node) {L,0};
                Item[tot++] = (Node) {R,1};
            }
        }
        sort(Item,Item+tot);
        int cnt = 0,ans = 0;
        for(int i = 0; i < tot; ++i) {
            if(Item[i].Type == 0) {
                ++cnt;
                ans = max(ans,cnt);
            }else --cnt;
        }
        printf("%d\n",ans);
    }
    return 0;
}

akxxsb

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
LA 3905（扫描线)

MeteorTime Limit: 3000msMemory Limit: 131072KBThis problem will be judged on UVALive. Original ID: 390564-bit integer IO format: %lld Java class name: MainPrev Submit Status S
复制链接

扫一扫