#608890 (Rust) No.1365 [Cherry 1st Tune] Whose Fault?

• 問題: No.1365 [Cherry 1st Tune] Whose Fault?
• ユーザー: akakimidori
• 提出日時: 2021-01-22 22:49:19
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 68 ms / 2,000 ms
• コード長: 4,075 bytes
• コンパイル時間: 13,580 ms
• コンパイル使用メモリ: 390,916 KB
• 実行使用メモリ: 11,520 KB
• 最終ジャッジ日時: 2024-12-14 06:02:54
• 合計ジャッジ時間: 28,828 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,820 KB
testcase_01	AC	1 ms; 6,820 KB
testcase_02	AC	1 ms; 6,820 KB
testcase_03	AC	1 ms; 6,816 KB
testcase_04	AC	1 ms; 6,820 KB
testcase_05	AC	1 ms; 6,820 KB
testcase_06	AC	1 ms; 6,820 KB
testcase_07	AC	1 ms; 6,816 KB
testcase_08	AC	1 ms; 6,820 KB
testcase_09	AC	1 ms; 6,820 KB
testcase_10	AC	1 ms; 6,820 KB
testcase_11	AC	1 ms; 6,820 KB
testcase_12	AC	1 ms; 6,816 KB
testcase_13	AC	7 ms; 6,820 KB
testcase_14	AC	5 ms; 6,820 KB
testcase_15	AC	2 ms; 6,816 KB
testcase_16	AC	2 ms; 6,816 KB
testcase_17	AC	4 ms; 6,820 KB
testcase_18	AC	3 ms; 6,816 KB
testcase_19	AC	6 ms; 6,816 KB
testcase_20	AC	5 ms; 6,816 KB
testcase_21	AC	6 ms; 6,816 KB
testcase_22	AC	6 ms; 6,820 KB
testcase_23	AC	16 ms; 6,816 KB
testcase_24	AC	31 ms; 7,424 KB
testcase_25	AC	57 ms; 9,856 KB
testcase_26	AC	40 ms; 8,064 KB
testcase_27	AC	47 ms; 7,296 KB
testcase_28	AC	22 ms; 6,816 KB
testcase_29	AC	17 ms; 6,816 KB
testcase_30	AC	68 ms; 11,296 KB
testcase_31	AC	62 ms; 11,520 KB
testcase_32	AC	37 ms; 8,576 KB
testcase_33	AC	55 ms; 8,912 KB
testcase_34	AC	44 ms; 7,680 KB
testcase_35	AC	29 ms; 7,296 KB
testcase_36	AC	54 ms; 10,368 KB
testcase_37	AC	12 ms; 6,820 KB
testcase_38	AC	19 ms; 6,816 KB
testcase_39	AC	66 ms; 10,624 KB
testcase_40	AC	64 ms; 10,456 KB
testcase_41	AC	50 ms; 9,600 KB
testcase_42	AC	48 ms; 7,372 KB
testcase_43	AC	1 ms; 6,820 KB
testcase_44	AC	27 ms; 10,368 KB
testcase_45	AC	21 ms; 6,816 KB

ソースコード

//---------- begin union_find ----------
pub struct DSU {
    p: Vec<i32>,
}
impl DSU {
    pub fn new(n: usize) -> DSU {
        assert!(n < std::i32::MAX as usize);
        DSU { p: vec![-1; n] }
    }
    pub fn init(&mut self) {
        self.p.iter_mut().for_each(|p| *p = -1);
    }
    pub fn root(&self, mut x: usize) -> usize {
        assert!(x < self.p.len());
        while self.p[x] >= 0 {
            x = self.p[x] as usize;
        }
        x
    }
    pub fn same(&self, x: usize, y: usize) -> bool {
        assert!(x < self.p.len() && y < self.p.len());
        self.root(x) == self.root(y)
    }
    pub fn unite(&mut self, x: usize, y: usize) -> Option<(usize, usize)> {
        assert!(x < self.p.len() && y < self.p.len());
        let mut x = self.root(x);
        let mut y = self.root(y);
        if x == y {
            return None;
        }
        if self.p[x] > self.p[y] {
            std::mem::swap(&mut x, &mut y);
        }
        self.p[x] += self.p[y];
        self.p[y] = x as i32;
        Some((x, y))
    }
    pub fn parent(&self, x: usize) -> Option<usize> {
        assert!(x < self.p.len());
        let p = self.p[x];
        if p >= 0 {
            Some(p as usize)
        } else {
            None
        }
    }
    pub fn sum<F>(&self, mut x: usize, mut f: F) -> usize
    where F: FnMut(usize),
    {
        while let Some(p) = self.parent(x) {
            f(x);
            x = p;
        }
        x
    }
    pub fn size(&self, x: usize) -> usize {
        assert!(x < self.p.len());
        let r = self.root(x);
        (-self.p[r]) as usize
    }
}
//---------- end union_find ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
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_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_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 ----------

use std::io::Write;

fn run() {
    input! {
        n: usize,
        a: [f64; n],
        b: [f64; n],
        p: [f64; n],
        q: usize,
        e: [(usize1, usize1); q],
    }
    let mut ans = 0f64;
    let mut dp = vec![(0f64, 0f64, 0f64); n];
    for (i, ((&a, &b), &p)) in a.iter().zip(b.iter()).zip(p.iter()).enumerate() {
        let ip = 1f64 / p;
        ans += (a - b).powi(2) / ip;
        dp[i] = (a, b, ip);
    }
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    let mut dsu = DSU::new(n);
    for (x, y) in e {
        if let Some((x, y)) = dsu.unite(x, y) {
            let (a, b, c) = dp[x];
            let (p, q, r) = dp[y];
            ans -= (a - b).powi(2) / c;
            ans -= (p - q).powi(2) / r;
            dp[x].0 += p;
            dp[x].1 += q;
            dp[x].2 += r;
            let (a, b, c) = dp[x];
            ans += (a - b).powi(2) / c;
        }
        writeln!(out, "{:.7}", ans).ok();
    }
}

fn main() {
    run();
}