CodeForces - 764D Timofey and rectangles

本文介绍了一道关于矩形涂色的问题,通过四色定理解决。题目要求给定n个边长为奇数的矩形,使得相邻矩形颜色不同。文章提供了具体的算法实现,利用矩形右上角坐标奇偶性决定颜色。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles have odd length. Rectangles cannot intersect, but they can touch each other.

Help Timofey to color his rectangles in 4 different colors in such a way that every two rectangles touching each other by side would have different color, or determine that it is impossible.

Two rectangles intersect if their intersection has positive area. Two rectangles touch by sides if there is a pair of sides such that their intersection has non-zero length

The picture corresponds to the first example

Input

The first line contains single integer n (1 ≤ n ≤ 5·105) — the number of rectangles.

n lines follow. The i-th of these lines contains four integers x1, y1, x2 and y2 ( - 109 ≤ x1 < x2 ≤ 109,  - 109 ≤ y1 < y2 ≤ 109), that means that points (x1, y1) and (x2, y2) are the coordinates of two opposite corners of the i-th rectangle.

It is guaranteed, that all sides of the rectangles have odd lengths and rectangles don't intersect each other.

Output

Print "NO" in the only line if it is impossible to color the rectangles in 4 different colors in such a way that every two rectangles touching each other by side would have different color.

Otherwise, print "YES" in the first line. Then print n lines, in the i-th of them print single integer ci (1 ≤ ci ≤ 4) — the color of i-th rectangle.

Example

Input

8
0 0 5 3
2 -1 5 0
-3 -4 2 -1
-1 -1 2 0
-3 0 0 5
5 2 10 3
7 -3 10 2
4 -2 7 -1

Output

YES
1
2
2
3
2
2
4
1

题意:给定n个矩形,边长为奇数,相邻矩形的颜色不能为一样的

题解:四色定理:https://baike.baidu.com/item/%E5%9B%9B%E8%89%B2%E5%AE%9A%E7%90%86/805159?fr=aladdin

因为边长为奇数,我们可以确定右上点,来判断它的奇偶性,相邻矩形该点的x,y奇偶性一定不完全相同

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n,x,y;
    cin>>n;
    cout<<"YES"<<endl;
    while(n--)
    {
    	cin>>x>>y>>x>>y;
    	x=abs(x);
    	y=abs(y);
    	if(x&1&&y&1)cout<<"1"<<endl;
    	if(x&1&&!(y&1)) cout<<"2"<<endl;
    	if(!(x&1)&&y&1) cout<<"3"<<endl;
    	if(!(x&1)&&!(y&1)) cout<<"4"<<endl;
	}
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值