codeforces1216C （矩形面积交）

#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<long,long> PLL;
typedef pair<char,char> PCC;
typedef long long ll;
const int N=1010;
const int M=1e6+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
ll query(ll x1,ll y1,ll x2,ll y2,ll x3,ll y3,ll x4, ll y4){
    ll x5=max(x1,x3);
    ll y5=max(y1,y3);
    ll x6=min(x2,x4);
    ll y6=min(y2,y4);
    if(x5>x6 || y5>y6) return 0;
    return (x6-x5)*(y6-y5);
}
void solve(){
    ll x1,y1,x2,y2,x3,y3,x4,y4,x5,y5,x6,y6;
    cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4>>x5>>y5>>x6>>y6;
    ll s1=(x2-x1)*(y2-y1);
    ll s2=query(x1,y1,x2,y2,x3,y3,x4,y4);
    ll s3=query(x1,y1,x2,y2,x5,y5,x6,y6);
    ll leftx=max(x3,x5);
    ll lefty=max(y3,y5);
    ll rightx=min(x4,x6);
    ll righty=min(y4,y6);
    ll s4=query(x1,y1,x2,y2,leftx,lefty,rightx,righty);
    if(s1-(s2+s3-s4)>0) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}
int main(){
    IOS;
    //int t;cin>>t;
    //while(t--){
        solve();
    //}
    return 0;
}