#828283 (Rust) No.2173 Nightcord

• 問題: No.2173 Nightcord
• ユーザー: akakimidori
• 提出日時: 2022-12-25 01:06:45
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 1,748 ms / 2,525 ms
• コード長: 5,788 bytes
• コンパイル時間: 12,676 ms
• コンパイル使用メモリ: 378,184 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-17 14:31:14
• 合計ジャッジ時間: 43,057 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	1,274 ms; 5,248 KB
testcase_04	AC	1 ms; 5,248 KB
testcase_05	AC	1 ms; 5,248 KB
testcase_06	AC	1 ms; 5,248 KB
testcase_07	AC	1 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	847 ms; 5,248 KB
testcase_10	AC	469 ms; 5,248 KB
testcase_11	AC	39 ms; 5,248 KB
testcase_12	AC	808 ms; 5,248 KB
testcase_13	AC	66 ms; 5,248 KB
testcase_14	AC	1,102 ms; 5,248 KB
testcase_15	AC	1,068 ms; 5,248 KB
testcase_16	AC	3 ms; 5,248 KB
testcase_17	AC	142 ms; 5,248 KB
testcase_18	AC	553 ms; 5,248 KB
testcase_19	AC	7 ms; 5,248 KB
testcase_20	AC	534 ms; 5,248 KB
testcase_21	AC	700 ms; 5,248 KB
testcase_22	AC	806 ms; 5,248 KB
testcase_23	AC	795 ms; 5,248 KB
testcase_24	AC	1,603 ms; 5,248 KB
testcase_25	AC	1,065 ms; 5,248 KB
testcase_26	AC	1,257 ms; 5,248 KB
testcase_27	AC	11 ms; 5,248 KB
testcase_28	AC	1,209 ms; 5,248 KB
testcase_29	AC	178 ms; 5,248 KB
testcase_30	AC	1,748 ms; 5,248 KB
testcase_31	AC	299 ms; 5,248 KB
testcase_32	AC	628 ms; 5,248 KB
testcase_33	AC	1,182 ms; 5,248 KB
testcase_34	AC	1,281 ms; 5,248 KB
testcase_35	AC	607 ms; 5,248 KB
testcase_36	AC	719 ms; 5,248 KB
testcase_37	AC	1,103 ms; 5,248 KB
testcase_38	AC	183 ms; 5,248 KB
testcase_39	AC	593 ms; 5,248 KB
testcase_40	AC	1,216 ms; 5,248 KB
testcase_41	AC	770 ms; 5,248 KB
testcase_42	AC	753 ms; 5,248 KB
testcase_43	AC	91 ms; 5,248 KB
testcase_44	AC	1 ms; 5,248 KB
testcase_45	AC	278 ms; 5,248 KB
testcase_46	AC	433 ms; 5,248 KB
testcase_47	AC	390 ms; 5,248 KB
testcase_48	AC	185 ms; 5,248 KB
testcase_49	AC	9 ms; 5,248 KB
testcase_50	AC	70 ms; 5,248 KB
testcase_51	AC	435 ms; 5,248 KB
testcase_52	AC	6 ms; 5,248 KB
testcase_53	AC	468 ms; 5,248 KB
testcase_54	AC	671 ms; 5,248 KB
testcase_55	AC	142 ms; 5,248 KB
testcase_56	AC	286 ms; 5,248 KB

ソースコード

fn main() {
    input! {
        n: usize,
        k: usize,
        p: [(i64, i64, usize1); n],
    }
    let ans = (|| -> bool {
        let mut a = vec![vec![]; 2];
        for (x, y, c) in p {
            a[c].push((x, y));
        }
        if a[0].is_empty() || a[1].is_empty() {
            return false;
        }
        for _ in 0..2 {
            for &orig in a[0].iter() {
                let mut point = a[1]
                    .iter()
                    .map(|p| {
                        let x = p.0 - orig.0;
                        let y = p.1 - orig.1;
                        let g = gcd(x, y);
                        (x / g, y / g)
                    })
                    .collect::<Vec<_>>();
                point.sort();
                point.dedup();
                if point
                    .iter()
                    .any(|p| point.binary_search(&(-p.0, -p.1)).is_ok())
                {
                    return true;
                }
            }
            a.swap(0, 1);
        }
        if k == 3 {
            return false;
        }
        let mut hull = vec![];
        for i in 0..2 {
            let mut point = a[i].clone();
            point.sort();
            point.dedup();
            if point.len() > 2 {
                let sign = |a: usize, b: usize, c: usize| -> i64 {
                    let a = point[a];
                    let b = point[b];
                    let c = point[c];
                    let ab = (b.0 - a.0, b.1 - a.1);
                    let bc = (c.0 - b.0, c.1 - b.1);
                    ab.0 * bc.1 - ab.1 * bc.0
                };
                let n = point.len();
                let mut hull = vec![0];
                let mut fix = 0;
                for i in (1..n).chain((0..(n - 1)).rev()) {
                    while hull.len() > fix + 1 {
                        let len = hull.len();
                        if sign(hull[len - 2], hull[len - 1], i) >= 0 {
                            hull.pop();
                        } else {
                            break;
                        }
                    }
                    hull.push(i);
                    if i == n - 1 {
                        fix = hull.len() - 1;
                    }
                }
                hull.pop();
                point = hull.into_iter().map(|k| point[k]).collect();
            }
            let s = point[0];
            point.push(s);
            for &(x, y) in a[i ^ 1].iter() {
                if point.windows(2).all(|a| {
                    let (s, t) = (a[0], a[1]);
                    (t.0 - s.0) * (y - s.1) - (t.1 - s.1) * (x - s.0) >= 0
                }) {
                    return true;
                }
            }
            hull.push(point);
        }
        for a in hull[0].windows(2) {
            for b in hull[1].windows(2) {
                let (p, q) = (a[0], a[1]);
                let (r, s) = (b[0], b[1]);
                let a = (-(q.1 - p.1)) as i128;
                let b = (q.0 - p.0) as i128;
                let e = (p.1 * q.0 - p.0 * q.1) as i128;
                let c = (-(s.1 - r.1)) as i128;
                let d = (s.0 - r.0) as i128;
                let f = (r.1 * s.0 - r.0 * s.1) as i128;
                let mut det = a * d - b * c;
                let mut x = e * d + f * -b;
                let mut y = e * -c + f * a;
                if det == 0 {
                    continue;
                }
                if det < 0 {
                    det = -det;
                    x = -x;
                    y = -y;
                }
                let mut ok = true;
                for &(p, q) in [(p, q), (r, s)].iter() {
                    let p = (p.0 as i128, p.1 as i128);
                    let q = (q.0 as i128, q.1 as i128);
                    ok &= det * p.0.min(q.0) <= x
                        && x <= det * p.0.max(q.0)
                        && det * p.1.min(q.1) <= y
                        && y <= det * p.1.max(q.1);
                }
                if ok {
                    return true;
                }
            }
        }
        false
    })();
    let s = if ans { "Yes" } else { "No" };
    println!("{}", s);
}

fn gcd(a: i64, b: i64) -> i64 {
    if b == 0 {
        a.abs()
    } else {
        gcd(b, a.abs() % b.abs())
    }
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------