Codeforces 763B-Timofey and rectangles (思维,四色定理)
来源:互联网 发布:王亚林扈华国现状知乎 编辑:程序博客网 时间:2024/06/05 09:59
当场没有做出来,所以只能来转一发题解了
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 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.
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.
80 0 5 32 -1 5 0-3 -4 2 -1-1 -1 2 0-3 0 0 55 2 10 37 -3 10 24 -2 7 -1
YES12232241
题意:给出n个矩形的左下角和右上角的坐标定点,并保证矩形边长为奇数,给矩形涂色并保证相接触的矩形颜色不同,问能否用四种不同的颜色完成
解题思路:因为所有矩形的边长均为奇数,所以可以根据矩形左下角横纵坐标的奇偶性来把矩形分为四类(奇奇,偶偶,奇偶,偶奇)
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;#define LL long longconst int INF=0x3f3f3f3f;const int MAX=100009;int main(){ int n; while(~scanf("%d",&n)) { printf("YES\n"); int a,b,c,d; for(int i=0; i<n; i++) { scanf("%d%d%d%d",&a,&b,&c,&d); printf("%d\n",1+2*(abs(a)%2)+abs(b)%2); } } return 0;}
- Codeforces 763B-Timofey and rectangles (思维,四色定理)
- codeforces 763B Timofey and rectangles(四色定理)
- Codeforces 763B Timofey and rectangles(四色定理)(思维)
- D. Timofey and rectangles----思维题+四色定理
- codeforces 763B. Timofey and rectangles [思维]【智商】
- Codeforces 763B-Timofey and rectangles
- B. Timofey and rectangles(四色定理,坐标奇偶错位)
- 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(思维题)
- D. Timofey and rectangles
- 【Codeforces Round395】 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
- java类
- bzoj1406【数论】
- UVA 12166 Equilibrium Mobile (天平性质 + DFS)
- HTTP基本知识
- JavaScript停止冒泡和阻止浏览器默认行为
- Codeforces 763B-Timofey and rectangles (思维,四色定理)
- atitit 项目注册功能算法attilax总结.docx
- gdufe acm 1363 校庆嘉宾
- 团体程序设计天梯赛-练习集-L3-011. 直捣黄龙(最短路+计数)
- 3.Web Service 使用CXF开发客户端
- 【PAT】1090. Highest Price in Supply Chain
- 数据可视化之平行坐标图。
- 【学习笔记之Openlayers3】查询分析篇(第五篇)
- Android 文件的读写