【Codeforces Round395】 Codeforces 764D Timofey and rectangles
来源:互联网 发布:手机离线地图软件 编辑:程序博客网 时间:2024/05/16 19:02
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 InputThe 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. OutputPrint “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.
如果两个矩形接触,在接触的那一维上坐标的奇偶性一定不同。这样恰好根据两个坐标的奇偶性分成四类。
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main(){ int n,x,y; printf("YES\n"); scanf("%d",&n); while (n--) { scanf("%d%d%*d%*d",&x,&y); printf("%d\n",2*(x&1)+(y&1)+1); }}
- 【Codeforces Round395】 Codeforces 764D Timofey and rectangles
- CodeForces 764D Timofey and rectangles【四色问题】
- Codeforces Round #395 (Div. 2) D. Timofey and rectangles
- Codeforces Round #395 (Div. 2)D. Timofey and rectangles
- Codeforces Round #395 (Div. 2) D. Timofey and rectangles
- Codeforces Round #395 (Div. 2) D. Timofey and rectangles
- Codeforces Round #395 (Div. 2)-D. Timofey and rectangles
- Codeforces 763B-Timofey and rectangles
- D. Timofey and rectangles
- 764D Timofey and rectangles[思维][染色]
- Code forces -764D Timofey and rectangles
- Codeforces Round #395 (Div. 2) D. Timofey and rectangles(思路)
- Codeforces Round #395(Div. 2)D. Timofey and rectangles【思维】好题!
- Codeforces Round #395 (Div. 2) D Timofey and rectangles(思维题)
- codeforces 763B. Timofey and rectangles [思维]【智商】
- codeforces 763B Timofey and rectangles(四色定理)
- Codeforces 763B-Timofey and rectangles (思维,四色定理)
- 【codeforces 764B】Timofey and cubes
- 365. Water and Jug Problem
- 初识
- 新款三星手机现身GFXBench 其配置将大幅提升
- iOS 对象之间的通信方式(delegate、block、NSNotification、kvc、kvo)总结
- 【笔记】第一天使用CSDN博客
- 【Codeforces Round395】 Codeforces 764D Timofey and rectangles
- 分享daocloud联合创始人陈齐彦关于docker的一段阐述
- Single Number
- Android 性能优化:使用 Lint 优化代码、去除多余资源
- 数据结构与算法分析笔记与总结(java实现)--二叉树3:二叉树按层遍历打印练习
- VS2015 注释
- 蓝桥杯 算法提高 算法提高 约数个数
- iOS 获取当前正在显示的ViewController
- 工具类-BasePopupWindow