PivotOJ

Paint by Rectangles

시간 제한: 4000ms메모리 제한: 1024MB출처: USACO 2022 February PlatinumBOJ 24611

문제

After her previous artwork was met with critical acclaim, Bessie was offered a job designing painting sets. She designs these paintings by choosing 1N1051\le N\le 10^5 axis-aligned rectangles in the plane such that no two edges are collinear. The boundaries of these rectangles define the boundaries of the painting's colored regions.

Still being an avant-garde artist, Bessie decides that the painting should resemble a Holstein cow. More specifically, each region formed by the rectangles is colored either black or white, no two adjacent regions have the same color, and the region outside of all the rectangles is colored white.

After choosing the rectangles, Bessie would like you to output one of two things based on a parameter TT:

  • If T=1T=1, output the total number of regions.
  • If T=2T=2, output the number of white regions followed by the number of black regions.

입력

The first line contains NN and TT.

The next NN lines each contain the description of a rectangle in the form (x1,y1),(x2,y2)(x_1,y_1), (x_2,y_2) where 1x1<x22N1\le x_1<x_2\le 2N and 1y1<y22N1\le y_1<y_2\le 2N. (x1,y1)(x_1, y_1) and (x2,y2)(x_2, y_2) are the bottom left and top right corners of the rectangle respectively.

It is guaranteed that all the xix_i form a permutation of 12N1\ldots 2N, and the same holds for all the yiy_i.

출력

A single integer if T=1T=1, otherwise two separated by spaces.

예제

예제 1

입력
2 1
1 1 3 3
2 2 4 4
출력
4

예제 2

입력
5 2
1 5 3 6
5 4 7 9
4 1 8 3
9 8 10 10
2 2 6 7
출력
4 5
코드를 제출하려면 로그인하세요.