Description

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
题意:问能不能被四种颜色标记地图
解法:四色问题,当然是YES,现在考虑如何染色
我们看左下角如果都是奇数,因为长度是奇数,所以其他的x,y都是偶数,那么其他以奇数为左下角的都不会有交集
嗯,四种颜色嘛。。奇偶排列刚好是四种,于是。。
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<"YES"<<endl;
for(int i=;i<=n;i++)
{
int x,y,a,b;
cin>>x>>y>>a>>b;
if(x%&&y%)
{
cout<<""<<endl;
}
else if(x%==&&y%)
{
cout<<""<<endl;
}
else if(x%&&y%==)
{
cout<<""<<endl;
}
else if(x%==&&y%==)
{
cout<<""<<endl;
}
}
return ;
}

最新文章

  1. 当前端也拥有 Server 的能力
  2. BZOJ2506: calc
  3. 千位分隔符(js 实现)
  4. scrollTop 鼠标往下移动到一定位置显示隐藏
  5. dedecms创建或修改目录失败
  6. C#Form窗体通过代码改变尺寸
  7. JAVA基础知识之Set集合
  8. Unity编辑器-创建单独编辑框,折叠框,提示框
  9. Bigcommerce: 给已完成购买的客户发送一封产品评论邮件,让客户直接进行产品评论
  10. 飞天熊猫游戏源代码android文本
  11. 多年心愿,终于完成,热泪盈眶啊。。。Adrew NG 的 机器学习
  12. STM32学习笔记(四)——串口控制LED(中断方式)
  13. iOS设置圆角的方法及指定圆角的位置
  14. 搭建第一个spring boot项目
  15. 利用Fiddler拦截接口请求并篡改数据
  16. EOS config 大全
  17. kali linux 入侵window实例
  18. console call的fallback console 兼容
  19. JavaScript正则表达式以及字符串处理
  20. Displacement Mapping

热门文章

  1. 关于用HOOK拦截键盘的一些问题
  2. HDU Shell Necklace CDQ分治+FFT
  3. TButton.Repaint的执行过程
  4. URL 下载
  5. 新建web项目时css注意事项
  6. timestamp 转 date 处理后再转timestamp
  7. regmap使用介绍【转】
  8. Lucene 的四大索引查询 ——bool 域搜索 通配符 范围搜索
  9. 最小生成树,并查集的思想 nyoj1239
  10. laya在微信小游戏中加载BitmapFont失效的问题