#![allow(unused_imports, unused_macros)] use kyoproio::*; use std::{ collections::*, io::{self, prelude::*}, iter, mem::{replace, swap}, }; fn main() -> io::Result<()> { std::thread::Builder::new() .stack_size(64 * 1024 * 1024) .spawn(solve)? .join() .unwrap(); Ok(()) } fn solve() { let stdin = io::stdin(); let mut kin = KInput::new(stdin.lock()); let stdout = io::stdout(); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; } macro_rules! outputln { ($($args:expr),+) => { output!($($args),+); outputln!(); }; () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } } } let idx = |i, j| 100 * i + j; let n: usize = kin.input(); let mut g = vec![Vec::new(); 10101]; for (i, (r0, c0, r1, c1)) in kin.iter::<(usize, usize, usize, usize)>().take(n).enumerate() { let u = idx(r0, c0); let v = idx(r1, c1); g[u].push((v, i)); g[v].push((u, i)); } let mut used_v = vec![false; 10101]; let mut used_e = vec![false; n]; for i in 0..10101 { let (cv, ce) = dfs(&g, &mut used_v, &mut used_e, i); if ce > 0 { kdbg!(cv, ce); } if ce > cv { outputln!("NO"); return; } } outputln!("YES"); } fn dfs(g: &[Vec<(usize, usize)>], used_v: &mut [bool], used_e: &mut [bool], u: usize) -> (usize, usize) { if used_v[u] { return (0, 0); } used_v[u] = true; let mut cv = 1; let mut ce = 0; for &(v, i) in &g[u] { if used_e[i] { continue; } used_e[i] = true; let (vcv, vce) = dfs(g, used_v, used_e, v); cv += vcv; ce += 1 + vce; } (cv, ce) } // ----------------------------------------------------------------------------- pub mod kyoproio { use std::io::prelude::*; pub trait Input { fn str(&mut self) -> &str; fn input(&mut self) -> T { T::input(self) } fn iter(&mut self) -> Iter { Iter(self, std::marker::PhantomData) } fn seq>(&mut self, n: usize) -> B { self.iter().take(n).collect() } } pub struct KInput { src: R, buf: String, pos: usize, } impl KInput { pub fn new(src: R) -> Self { Self { src, buf: String::with_capacity(1024), pos: 0, } } } impl Input for KInput { fn str(&mut self) -> &str { loop { if self.pos >= self.buf.len() { self.pos = 0; self.buf.clear(); if self.src.read_line(&mut self.buf).expect("io error") == 0 { return &self.buf; } } let range = self.pos ..self.buf[self.pos..] .find(|c: char| c.is_ascii_whitespace()) .map(|i| i + self.pos) .unwrap_or_else(|| self.buf.len()); self.pos = range.end + 1; if range.end > range.start { return &self.buf[range]; } } } } pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>); impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> { type Item = T; fn next(&mut self) -> Option { Some(self.0.input()) } } pub trait InputParse: Sized { fn input(src: &mut I) -> Self; } impl InputParse for Vec { fn input(src: &mut I) -> Self { src.str().as_bytes().to_owned() } } macro_rules! from_str_impl { { $($T:ty)* } => { $(impl InputParse for $T { fn input(src: &mut I) -> Self { src.str().parse::<$T>().expect("parse error") } })* } } from_str_impl! { String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128 } macro_rules! tuple_impl { ($H:ident $($T:ident)*) => { impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) { fn input(src: &mut I) -> Self { ($H::input(src), $($T::input(src)),*) } } tuple_impl!($($T)*); }; () => {} } tuple_impl!(A B C D E F G); #[macro_export] macro_rules! kdbg { ($($v:expr),*) => { if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) } } } }