#![allow(unused_imports, dead_code, unused_macros, unused_variables, non_snake_case, unused_parens)] use proconio::{input,marker::{Bytes, Chars, Usize1,Isize1}}; use std::ops::*; use std::cmp::*; use std::mem::swap; use std::collections::*; const MOD:u64 = 1_000_000_007; const INF:i64 = 0x3fff_ffff_ffff_ffff; macro_rules! min {($a:expr $(,)*) => {{$a}};($a:expr, $b:expr $(,)*) => {{std::cmp::min($a, $b)}};($a:expr, $($rest:expr),+ $(,)*) => {{std::cmp::min($a, min!($($rest),+))}};} macro_rules! max {($a:expr $(,)*) => {{$a}};($a:expr, $b:expr $(,)*) => {{std::cmp::max($a, $b)}};($a:expr, $($rest:expr),+ $(,)*) => {{std::cmp::max($a, max!($($rest),+))}};} macro_rules! chmin {($base:expr, $($cmps:expr),+ $(,)*) => {{let cmp_min = min!($($cmps),+);if $base > cmp_min {$base = cmp_min;true} else {false}}};} macro_rules! chmax {($base:expr, $($cmps:expr),+ $(,)*) => {{let cmp_max = max!($($cmps),+);if $base < cmp_max {$base = cmp_max;true} else {false}}};} macro_rules! mulvec {($x:expr; $s:expr) => {vec![$x; $s]};($x:expr; $s0:expr; $( $s:expr );+) => {mulvec![vec![$x; $s0]; $( $s );+ ]};} macro_rules! outputln {($var:expr)=>{println!("{}",$var)};($var:expr,$($vars:expr),+)=>{print!("{} ",$var);outputln!($($vars),+);};} macro_rules! debug {($($a:expr),* $(,)*) => {eprintln!(concat!($("| ",stringify!($a), "={:?} "),*, "|"),$(&$a),*);};} fn S(x1:(i32,i32), x2:(i32,i32), x3:(i32,i32)) -> f64 { let a = (x1.0 - x3.0) * (x2.1 - x3.1) - (x2.0 - x3.0) * (x1.1 - x3.1); a.abs() as f64 / 2.0 } fn solve() { input! { XY: [(i32,i32);3], } let mut ans = 0.0; let dx = [-1,1]; for bit in 0.. 1<<6 { let mut xy = XY.clone(); for i in 0..3 { let b = (bit >> i*2) & 3; match b { 0 => xy[i].0 += 1, 1 => xy[i].0 -= 1, 2 => xy[i].1 += 1, 3 => xy[i].1 -= 1, _ => unreachable!(), } } chmax!(ans, S(xy[0], xy[1], xy[2])); } println!("{}", ans); } fn main() { std::thread::Builder::new() .stack_size(128 * 1024 * 1024) .spawn(|| solve()).unwrap() .join().unwrap(); }