Submission #8818271

---

Source Code Expand

#[macro_use]
mod input_mcr {
    // ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
    // diff: using Parser
    #[macro_export(local_inner_macros)]
    macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut parser = Parser::from_str($s);
        input_inner!{parser, $($r)*}
    };
    (parser = $parser:ident, $($r:tt)*) => {
        input_inner!{$parser, $($r)*}
    };
    (new_stdin_parser = $parser:ident, $($r:tt)*) => {
        let stdin = std::io::stdin();
        let reader = std::io::BufReader::new(stdin.lock());
        let mut $parser = Parser::new(reader);
        input_inner!{$parser, $($r)*}
    };
    ($($r:tt)*) => {
        input!{new_stdin_parser = parser, $($r)*}
    };
}

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

    #[macro_export(local_inner_macros)]
    macro_rules! read_value {
    ($parser:ident, ( $($t:tt),* )) => {
        ( $(read_value!($parser, $t)),* )
    };
    ($parser:ident, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
    };
    ($parser:ident, chars) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()
    };
    ($parser:ident, char_) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()[0]
    };
    ($parser:ident, usize1) => {
        read_value!($parser, usize) - 1
    };
    ($parser:ident, i64_) => {
        $parser.fast_i64()
    };
    ($parser:ident, usize_) => {
        $parser.fast_i64() as usize
    };
    ($parser:ident, usize1_) => {
        ($parser.fast_i64() - 1) as usize
    };
    ($parser:ident, $t:ty) => {
        $parser.next::<$t>().expect("Parse error")
    };
}

    use std::io;
    use std::io::BufRead;
    use std::str;

    // ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e>
    // ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9>
    // diff: using std::io::BufRead::fill_buf()
    pub struct Parser<R> {
        pub reader: R,
        buf: Vec<u8>,
        pos: usize,
    }

    impl Parser<io::Empty> {
        pub fn from_str(s: &str) -> Parser<io::Empty> {
            Parser {
                reader: io::empty(),
                buf: s.as_bytes().to_vec(),
                pos: 0,
            }
        }
    }

    impl<R: BufRead> Parser<R> {
        pub fn new(reader: R) -> Parser<R> {
            Parser {
                reader: reader,
                buf: vec![],
                pos: 0,
            }
        }
        pub fn update_buf(&mut self) {
            self.buf.clear();
            self.pos = 0;
            loop {
                let (len, complete) = {
                    let buf2 = self.reader.fill_buf().unwrap();
                    self.buf.extend_from_slice(buf2);
                    let len = buf2.len();
                    (len, buf2[len - 1] <= 0x20)
                };
                self.reader.consume(len);
                if complete {
                    break;
                }
            }
        }
        pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
            loop {
                let mut begin = self.pos;
                while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                    begin += 1;
                }
                let mut end = begin;
                while end < self.buf.len() && (self.buf[end] > 0x20) {
                    end += 1;
                }
                if begin != self.buf.len() {
                    self.pos = end;
                    return unsafe { str::from_utf8_unchecked(&self.buf[begin..end]) }.parse::<T>();
                } else {
                    self.update_buf();
                }
            }
        }
        pub fn fast_i64(&mut self) -> i64 {
            loop {
                let mut begin = self.pos;
                while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                    begin += 1;
                }
                if begin == self.buf.len() {
                    self.update_buf();
                    continue;
                }
                let mut res = 0;
                let (is_positive, mut end) = match self.buf[begin] {
                    b'+' => (true, begin + 1),
                    b'-' => (false, begin + 1),
                    _ => (true, begin),
                };
                while end < self.buf.len() && (self.buf[end] > 0x20) {
                    res = res * 10 + (self.buf[end] as i64 - '0' as i64);
                    end += 1;
                }
                if begin != self.buf.len() {
                    self.pos = end;
                    return if is_positive { res } else { -res };
                } else {
                    self.update_buf();
                }
            }
        }
    }
}

mod httf2020_final {
    use input_mcr::*;

    use std;
    use std::cmp::*;

    pub const NUM_NODES: usize = 1000;
    pub const NUM_TREES: usize = 1000;
    pub const TREE_SIZE: usize = 20;

    pub struct Node {
        pub x: i64,
        pub y: i64,
        pub c: i64,
    }

    impl Node {
        pub fn new(x: i64, y: i64, c: i64) -> Node {
            Node { x: x, y: y, c: c }
        }
    }

    pub struct MiniTree {
        pub parent: Vec<usize>,
    }

    impl MiniTree {
        pub fn new(xs: &Vec<usize>) -> MiniTree {
            let mut res = vec![0];
            for &x in xs {
                res.push(x);
            }
            MiniTree { parent: res }
        }
        pub fn ranks(&self) -> Vec<Vec<i64>> {
            let mut rank = vec![0; 20];
            let mut n_children = vec![0; 20];
            let mut max_rank = 0;
            for i in 1..TREE_SIZE {
                let parent = self.parent[i];
                rank[i] = rank[parent] + 1;
                n_children[parent] += 1;
                max_rank = max(max_rank, rank[i]);
            }
            let mut res = vec![vec![]; max_rank + 1];
            for i in 0..TREE_SIZE {
                res[rank[i]].push(n_children[i]);
            }
            for i in 0..max_rank + 1 {
                res[i].sort();
                res[i].reverse();
            }
            res
        }
        pub fn child_max_ranks(&self) -> Vec<Vec<i64>> {
            let mut rank = vec![0; 20];
            let mut n_children = vec![0; 20];
            let mut max_rank = 0;
            for i in 1..TREE_SIZE {
                let parent = self.parent[i];
                rank[i] = rank[parent] + 1;
                n_children[parent] += 1;
                max_rank = max(max_rank, rank[i]);
            }
            for i in (1..TREE_SIZE).rev() {
                let parent = self.parent[i];
                n_children[parent] = max(n_children[parent], n_children[i]);
            }
            let mut res = vec![vec![]; max_rank + 1];
            for i in 0..TREE_SIZE {
                res[rank[i]].push(n_children[i]);
            }
            for i in 0..max_rank + 1 {
                res[i].sort();
                res[i].reverse();
            }
            res
        }
    }

    pub struct Problem {
        pub nodes: Vec<Node>,
        pub mini_trees: Vec<MiniTree>,
        pub graph: Vec<Vec<usize>>,
    }

    impl Problem {
        pub fn new_from_stdin() -> Problem {
            input! {
                n: usize,
                s: usize,
                k: usize,
                nodes: [(i64,i64,i64); n],
                mini_trees: [[usize1; k-1]; s],
            }
            assert_eq!(n, 1000);
            assert_eq!(s, 1000);
            assert_eq!(k, 20);
            let mut res_nodes = vec![];
            let mut res_mini_trees = vec![];
            for node in &nodes {
                let t = Node::new(node.0, node.1, node.2);
                res_nodes.push(t);
            }
            for mini_tree in &mini_trees {
                let t = MiniTree::new(mini_tree);
                res_mini_trees.push(t);
            }
            let mut res_graph = vec![vec![]; n];
            for i in 0..n {
                for k in i + 1..n {
                    let dx = nodes[k].0 - nodes[i].0;
                    let dy = nodes[k].1 - nodes[i].1;
                    let ci = nodes[i].2;
                    let ck = nodes[k].2;
                    if dx * dx + dy * dy <= (ci + ck) * (ci + ck) {
                        res_graph[i].push(k);
                        res_graph[k].push(i);
                    }
                }
            }
            Problem {
                nodes: res_nodes,
                mini_trees: res_mini_trees,
                graph: res_graph,
            }
        }
        pub fn get_branch_degrees(&self) -> Vec<usize> {
            let mut max_ranks = vec![vec![0; 20]; 20];
            for (i, mini_tree) in self.mini_trees.iter().enumerate() {
                let ranks = mini_tree.child_max_ranks();
                // eprintln!("ranks[{}]", i);
                for (j, rank_r) in ranks.iter().enumerate() {
                    // eprint!("    ");
                    for (k, &rank) in rank_r.iter().enumerate() {
                        // eprint!("{} ", rank);
                        max_ranks[j][k] = max(max_ranks[j][k], rank);
                    }
                    // eprintln!();
                }
            }
            // eprintln!("child_max_ranks");
            for i in 0..20 {
                // eprint!("    {:2}: ", i);
                for k in 0..20 {
                    // eprint!("{:2} ", max_ranks[i][k]);
                }
                // eprintln!();
            }
            let mut res = vec![];
            for i in 0..20 {
                let mut count = 0;
                for &x in &max_ranks[i] {
                    if x >= 3 {
                        count += 1;
                    }
                }
                res.push(count);
            }
            res
        }
    }

    #[derive(Clone)]
    pub struct Tree {
        pub tree_node_id: usize,
        pub vids: Vec<(usize, usize)>,
        pub children: Vec<Tree>,
    }

    impl Tree {
        pub fn new() -> Tree {
            Tree {
                tree_node_id: 0,
                vids: vec![],
                children: vec![],
            }
        }
        pub fn merge_raw(&mut self, right: &Tree, tree_id: usize) {
            self.vids.push((tree_id, right.tree_node_id));
            for i in 0..min(self.children.len(), right.children.len()) {
                self.children[i].merge_raw(&right.children[i], tree_id);
            }
            for i in self.children.len()..right.children.len() {
                self.children.push(right.children[i].clone());
            }
        }
        pub fn new_from_raw_tree(xs: &Vec<usize>, v: usize, tree_id: usize) -> Tree {
            let mut children = vec![];
            for (i, &x) in xs.iter().enumerate() {
                if x == v && !(v == 0 && i == 0) {
                    children.push(Tree::new_from_raw_tree(xs, i, tree_id));
                }
            }
            Tree {
                tree_node_id: v,
                vids: vec![(tree_id, v)],
                children: children,
            }
        }
        pub fn num_nodes(&self) -> usize {
            let mut res = 1;
            for child in &self.children {
                res += child.num_nodes();
            }
            res
        }
        pub fn update_tree_node_id(&mut self, i: &mut usize) {
            self.tree_node_id = *i;
            *i += 1;
            for k in 0..self.children.len() {
                self.children[k].update_tree_node_id(i);
            }
        }
    }
}

use input_mcr::*;
use std::cmp::*;

use httf2020_final::*;

use std::collections::VecDeque;

fn main() {
    let problem = Problem::new_from_stdin();
    let branch_degrees = problem.get_branch_degrees();
    let graph = &problem.graph;
    let mut tree = Tree::new();
    for (i, mini_tree) in problem.mini_trees.iter().enumerate() {
        tree.merge_raw(&Tree::new_from_raw_tree(&mini_tree.parent, 0, i), i);
    }
    // eprintln!("size = {}", tree.num_nodes());
    tree.update_tree_node_id(&mut 0);
    let mut points = vec![];
    for (i, node) in problem.nodes.iter().enumerate() {
        points.push((node.c, i));
    }
    points.sort();
    points.reverse();
    let mut tree_id_to_point_id = vec![None; NUM_NODES];
    let mut used = vec![false; NUM_NODES];
    tree_id_to_point_id[tree.tree_node_id] = Some(points[0].1);
    let mut q = VecDeque::new();
    q.push_back((tree.tree_node_id, &tree));
    used[points[0].1] = true;
    let mut edges = vec![];
    let mut res = vec![vec![0; 20]; NUM_TREES];
    while let Some((tree_id, tree)) = q.pop_front() {
        for &(a, b) in &tree.vids {
            res[a][b] = points[tree_id_to_point_id[tree.tree_node_id].unwrap()].1;
        }
        for child in &tree.children {
            for point_id in 0..NUM_NODES {
                if used[point_id] {
                    continue;
                } else {
                    let i = points[tree_id_to_point_id[tree_id].unwrap()].1;
                    let k = points[point_id].1;
                    let dx = problem.nodes[i].x - problem.nodes[k].x;
                    let dy = problem.nodes[i].y - problem.nodes[k].y;
                    let ci = problem.nodes[i].c;
                    let ck = problem.nodes[k].c;
                    if dx * dx + dy * dy <= (ci + ck) * (ci + ck) {
                        used[point_id] = true;
                        tree_id_to_point_id[child.tree_node_id] = Some(point_id);
                        edges.push((i, k));
                        break;
                    }
                }
            }
            q.push_back((child.tree_node_id, child));
        }
    }
    let filled = tree_id_to_point_id.iter().map(|x| x.is_some()).count();
    // eprintln!("filled = {}", filled);
    println!("{}", edges.len());
    for &(s, t) in &edges {
        println!("{} {}", s + 1, t + 1);
    }
    for i in 0..NUM_TREES {
        for k in 0..20 {
            print!("{} ", res[i][k] + 1);
        }
        println!();
    }
}

Submission Info

Compile Error

warning: method is never used: `from_str`, #[warn(dead_code)] on by default
  --> ./Main.rs:80:9
   |
80 |           pub fn from_str(s: &str) -> Parser<io::Empty> {
   |  _________^ starting here...
81 | |             Parser {
82 | |                 reader: io::empty(),
83 | |                 buf: s.as_bytes().to_vec(),
84 | |                 pos: 0,
85 | |             }
86 | |         }
   | |_________^ ...ending here

warning: method is never used: `fast_i64`, #[warn(dead_code)] on by default
   --> ./Main.rs:131:9
    |
131 |         pub fn fast_i64(&mut self) -> i64 {
    |         ^

warning: method is never used: `ranks`, #[warn(dead_code)] on by default
   --> ./Main.rs:196:9
    |
196 |         pub fn ranks(&self) -> Vec<Vec<i64>> {
    |         ^

warning: unused variable: `i`, #[warn(unused_variables)] on by default
   --> ./Main.rs:291:18
    |
291 |             for (i, mini_tree) in self.mini_trees.iter().enumerate() {
    |                  ^

warning: unused variable: `i`, #[warn(unus...

Judge Result