【codeforces 764D】Timofey and rectangles
2017-10-04 18:44
489 查看
【题目链接】:http://codeforces.com/contest/764/problem/D
【题意】
给你n个矩形,以左下角坐标和右上角坐标的形式给出;
(保证矩形的边长为奇数)
问你有没有染色方案,使得这n个矩形,任意两个相邻矩形的颜色不一样;
(只有4种颜色可以选择);
【题解】
因为矩形的边长为奇数;
所以对于左下角来说;
右上角的横纵坐标的奇偶性分别和左下角的横纵坐标的奇偶性都不同;
(因为一个数加上奇数之后奇偶性发生改变);
按照这个原理;
我们只要考虑左下角那个坐标就好了;
根据左下角坐标(x,y)
的x,y的奇偶性分为4种情况;
就分别对应了4种颜色;
分别染色1,2,3,4就好了;
(可以想一下,左下角横纵坐标奇偶性相同的话,肯定不会相邻的)
【Number Of WA】
0
【完整代码】
#include <bits/stdc++.h> using namespace std; #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 #define LL long long #define rep1(i,a,b) for (int i = a;i <= b;i++) #define rep2(i,a,b) for (int i = a;i >= b;i--) #define mp make_pair #define ps push_back #define fi first #define se second #define rei(x) scanf("%d",&x) #define rel(x) scanf("%lld",&x) #define ref(x) scanf("%lf",&x) typedef pair<int,int> pii; typedef pair<LL,LL> pll; const int dx[9] = {0,1,-1,0,0,-1,-1,1,1}; const int dy[9] = {0,0,0,-1,1,-1,1,-1,1}; const double pi = acos(-1.0); const int N = 110; int n; int main() { //freopen("F:\\rush.txt","r",stdin); puts("YES"); rei(n); rep1(i,1,n) { int x0,y0,x1,y1; rei(x0),rei(y0),rei(x1),rei(y1); if (x0<0) x0 = -x0; if (y0<0) y0 = -y0; if (x0%2==1 && y0%2==1) puts("1"); if (x0%2==1 && y0%2==0) puts("2"); if (x0%2==0 && y0%2==1) puts("3"); if (x0%2==0 && y0%2==0) puts("4"); } //printf("\n%.2lf sec \n", (double)clock() / CLOCKS_PER_SEC); return 0; }
相关文章推荐
- Codeforces 763B-Timofey and rectangles (思维,四色定理)
- Codeforces 763B-Timofey and rectangles
- Codeforces Round #395 (Div. 2) D. Timofey and rectangles(思路)
- codeforces 763A-Timofey and a tree 套路题
- 【codeforces 764B】Timofey and cubes
- Codeforces Round #395 (Div. 2)-D. Timofey and rectangles
- D. Timofey and rectangles
- Codeforces Round #395(Div. 2)D. Timofey and rectangles【思维】好题!
- Codeforces Round #395 (Div. 2) D. Timofey and rectangles
- Codeforces 764B-Timofey and cubes
- Codeforces Round #395 (Div. 2) D. Timofey and rectangles
- Codeforces 763A-Timofey and a tree
- B. Timofey and rectangles(四色定理,坐标奇偶错位)
- [CodeForces-763C]Timofey and remoduling
- Timofey and rectangles
- Codeforces Round #395(Div. 2)D. Timofey and rectangles
- 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