HDU 1866 a few rectangular areas and * * *

Source: Internet
Author: User

Give a few rectangles to find the sum of the area, the intersection area can only be counted once

At first I wanted to use a line tree to find and then found that there is no way to know how many times, and then will not

Read the puzzle.

The subject is very simple, but want to think of transformation is not easy, because this is the area of the sum, but two of the rectangle may be coincident together, so this is the need to split all the rectangles into a single unit of small squares. This allows them to be labeled. Finally, find the number of small squares that are marked.

Look at the data range, sure enough to 23333, the more you do the more you think the IQ is not enough

Links

HDU 1866 a few rectangular areas and * * *

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.