题意：

给你一个白色的矩形和俩个黑色的矩形，问白色被黑色覆盖后还能不能看到。

思路：

经典被简单题卡。
一开始写了个自我感觉很对的做法，结果wa41wa41wa41，检查不出来只能换思路了。
考虑一个容斥，我们算出来第一个黑色矩形覆盖的面积，再算第二个黑色矩形覆盖的面积，让后减去两个覆盖的矩形的面积交。此时就是黑色矩形覆盖白色的总面积，只需要算出白色的面积让后看看是否等于即可。

// Problem: C. White Sheet
// Contest: Codeforces - Codeforces Round #587 (Div. 3)
// URL: https://codeforces.com/contest/1216/problem/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#include<random>
#include<cassert>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define pb push_back
#define mk make_pair
#define Mid ((tr[u].l+tr[u].r)>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define db puts("---")
using namespace std;//void rd_cre() { freopen("d://dp//data.txt","w",stdout); srand(time(NULL)); }
//void rd_ac() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//AC.txt","w",stdout); }
//void rd_wa() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//WA.txt","w",stdout); }typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;const int N=4000010,mod=1e9+7,INF=0x3f3f3f3f;
const double eps=1e-6;int x[N],y[N];pair<PII,PII> solve(PII a,PII b,PII c,PII d) {int lx=max(a.X,c.X),rx=min(b.X,d.X);int ly=max(a.Y,c.Y),ry=min(b.Y,d.Y);if(lx>=rx||ly>=ry) return {{0,0},{0,0}};return {{lx,ly},{rx,ry}};
}LL getarea(pair<PII,PII> now) {return 1ll*(now.X.X-now.Y.X)*(now.X.Y-now.Y.Y);
}int main()
{//  ios::sync_with_stdio(false);
//  cin.tie(0);int x1,y1,x2,y2; cin>>x1>>y1>>x2>>y2;int x3,y3,x4,y4; cin>>x3>>y3>>x4>>y4;int x5,y5,x6,y6; cin>>x5>>y5>>x6>>y6;pair<PII,PII> now1=solve({x1,y1},{x2,y2},{x3,y3},{x4,y4});pair<PII,PII> now2=solve({x1,y1},{x2,y2},{x5,y5},{x6,y6});pair<PII,PII> now3=solve(now1.X,now1.Y,now2.X,now2.Y);LL ans1=getarea(now1),ans2=getarea(now2),ans3=getarea(now3);if(getarea({{x1,y1},{x2,y2}})>ans1+ans2-ans3) puts("YES");else puts("NO");return 0;
}
/**/

Codeforces Round #587 (Div. 3) C. White Sheet 思维相关推荐

Codeforces Round #636 (Div. 3) E. Weights Distributing 思维 + bfs
传送门文章目录题意: 思路: 题意: n≤2e5,m≤2e5n\le2e5,m\le2e5n≤2e5,m≤2e5 思路: 怎么感觉每场div3div3div3都有一个巧妙的图论题. 首先如果只有两 ...
Codeforces Round #617 (Div. 3) F. Berland Beauty 思维
传送门文章目录题意: 思路: 题意: 给定一棵树,再给定若干两点最短路之间边权的最小值,让你给树的边权赋值,使得满足给定的条件,如果不存在输出−1-1−1. 思路: 观察一个性质,加入经过这条边的 ...
Codeforces Round #587 (Div. 3)
题目链接:https://codeforces.com/contest/1216 A: 题意:给出一个仅有a,b组成的字符串,可执行操作把a换成b,b换成a,问最小操作次数,使得任意前偶数里a,b的数 ...
Codeforces Round #548 (Div. 2) C. Edgy Trees(思维+dfs)
题目链接:https://codeforces.com/contest/1139/problem/C 题意是给了一棵树,n个点,m条边.让从中选k个点,使得从a1到a2,a2到a3,ak ...
Codeforces Round #630 (Div. 2) A~D【思维，数论，字符串，位运算】
A. Exercising Walk 水题一道:在指定空间内你一定要向各个方向走a,b,c,d步问你能否在规定空间内走完这题的坑点样例都给出来了qwq #include <iostream> ...
Codeforces Round #212 (Div. 2) C. Insertion Sort 思维
传送门文章目录题意: 思路: 题意: n≤5000n\le5000n≤5000 思路: 从dpdpdp题集中看到的,一看n≤5000n\le5000n≤5000,这不就乱搞就行了,哪有什么dpdp ...
Codeforces Round #693 (Div. 3) E. Correct Placement 思维
传送门题意: 思路: 对于每个人都有个二元组(x,y)(x,y)(x,y),从题意中提取有效信息就是:当(x1,y1)(x_1,y_1)(x1,y1)的最大值大于(x2,y2)(x_2,y_2) ...
Codeforces Round #682 (Div. 2)D Powerful Ksenia ///思维
cf地址题目大意:Ksenia has an array a consisting of n positive integers a1,a2,-,an. In one operation she c ...
Codeforces Round #521 (Div. 3) B. Disturbed People 思维
题解题目大意 n个灯0关灯1开灯 101则中间的睡不着问最少关掉多少个灯可以全都能睡着遇见101则将后面的1的灯泡关掉这样解决10101的问题计数输出即可 AC代码 #include < ...

Codeforces Round #587 (Div. 3) C. White Sheet 思维

文章目录

题意：

思路：

Codeforces Round #587 (Div. 3) C. White Sheet 思维相关推荐

最新文章

热门文章