#691290 (Rust) No.1650 Moving Coins

• 問題: No.1650 Moving Coins
• ユーザー: manta1130
• 提出日時: 2021-08-20 22:34:46
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 94 ms / 2,000 ms
• コード長: 7,930 bytes
• コンパイル時間: 20,981 ms
• コンパイル使用メモリ: 378,736 KB
• 実行使用メモリ: 20,472 KB
• 最終ジャッジ日時: 2024-10-14 04:35:55
• 合計ジャッジ時間: 22,058 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	0 ms; 5,248 KB
testcase_03	AC	13 ms; 5,248 KB
testcase_04	AC	10 ms; 5,248 KB
testcase_05	AC	13 ms; 5,248 KB
testcase_06	AC	13 ms; 5,248 KB
testcase_07	AC	15 ms; 5,248 KB
testcase_08	AC	48 ms; 12,064 KB
testcase_09	AC	49 ms; 10,784 KB
testcase_10	AC	48 ms; 11,188 KB
testcase_11	AC	52 ms; 12,144 KB
testcase_12	AC	36 ms; 8,808 KB
testcase_13	AC	38 ms; 8,948 KB
testcase_14	AC	48 ms; 11,668 KB
testcase_15	AC	33 ms; 8,156 KB
testcase_16	AC	57 ms; 12,928 KB
testcase_17	AC	56 ms; 12,972 KB
testcase_18	AC	58 ms; 13,532 KB
testcase_19	AC	94 ms; 19,108 KB
testcase_20	AC	87 ms; 20,472 KB
testcase_21	AC	90 ms; 19,580 KB
testcase_22	AC	87 ms; 18,468 KB
testcase_23	AC	88 ms; 18,468 KB
testcase_24	AC	14 ms; 5,248 KB
testcase_25	AC	14 ms; 5,248 KB
testcase_26	AC	20 ms; 7,716 KB

ソースコード

#[allow(unused_imports)]
use std::io::{stdout, BufWriter, Write};

use std::collections::BTreeSet;

fn main() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());

    inputv! {
        n:usize,
    }
    let mut a = input_vector::<i64>();
    let mut b = input_vector::<i64>();

    a.insert(0, -999);
    b.insert(0, -999);

    a.push(1 << 60);
    b.push(1 << 60);

    let mut set_p = BTreeSet::new();
    let mut set_m = BTreeSet::new();

    for i in 1..=n {
        if a[i] < b[i] {
            set_p.insert(i);
        } else if a[i] > b[i] {
            set_m.insert(i);
        }
    }

    let mut ans = vec![];

    for f in (&set_m | &set_p).clone() {
        if a[f] < b[f] && a[f] + 1 != a[f + 1] {
            let mut r_list = vec![];
            for &t in set_p.range(..=f).rev() {
                while a[t] < b[t] && a[t] + 1 != a[t + 1] {
                    a[t] += 1;
                    ans.push((t, 'R'));
                }
                if a[t] == b[t] {
                    r_list.push(t);
                }
            }
            for k in r_list {
                set_p.remove(&k);
            }
        } else if a[f] > b[f] && a[f] - 1 != a[f - 1] {
            let mut r_list = vec![];
            for &t in set_m.range(f..) {
                while a[t] > b[t] && a[t] - 1 != a[t - 1] {
                    a[t] -= 1;
                    ans.push((t, 'L'));
                }
                if a[t] == b[t] {
                    r_list.push(t);
                }
            }
            for k in r_list {
                set_m.remove(&k);
            }
        }
    }

    for &f in (&set_m | &set_p).clone().iter().rev() {
        if a[f] < b[f] && a[f] + 1 != a[f + 1] {
            let mut r_list = vec![];
            for &t in set_p.range(..=f).rev() {
                while a[t] < b[t] && a[t] + 1 != a[t + 1] {
                    a[t] += 1;
                    ans.push((t, 'R'));
                }
                if a[t] == b[t] {
                    r_list.push(t);
                }
            }
            for k in r_list {
                set_p.remove(&k);
            }
        } else if a[f] > b[f] && a[f] - 1 != a[f - 1] {
            let mut r_list = vec![];
            for &t in set_m.range(f..) {
                while a[t] > b[t] && a[t] - 1 != a[t - 1] {
                    a[t] -= 1;
                    ans.push((t, 'L'));
                }
                if a[t] == b[t] {
                    r_list.push(t);
                }
            }
            for k in r_list {
                set_m.remove(&k);
            }
        }
    }
    for f in (&set_m | &set_p).clone() {
        if a[f] < b[f] && a[f] + 1 != a[f + 1] {
            let mut r_list = vec![];
            for &t in set_p.range(..=f).rev() {
                while a[t] < b[t] && a[t] + 1 != a[t + 1] {
                    a[t] += 1;
                    ans.push((t, 'R'));
                }
                if a[t] == b[t] {
                    r_list.push(t);
                }
            }
            for k in r_list {
                set_p.remove(&k);
            }
        } else if a[f] > b[f] && a[f] - 1 != a[f - 1] {
            let mut r_list = vec![];
            for &t in set_m.range(f..) {
                while a[t] > b[t] && a[t] - 1 != a[t - 1] {
                    a[t] -= 1;
                    ans.push((t, 'L'));
                }
                if a[t] == b[t] {
                    r_list.push(t);
                }
            }
            for k in r_list {
                set_m.remove(&k);
            }
        }
    }
    writeln!(out, "{}", ans.len()).unwrap();
    for (i, j) in ans {
        writeln!(out, "{} {}", i, j).unwrap();
    }
}

//https://github.com/manta1130/competitive-template-rs

use input::*;

pub mod input {
    use std::cell::RefCell;
    use std::io;
    pub const SPLIT_DELIMITER: char = ' ';
    pub use std::io::prelude::*;

    thread_local! {
        pub static INPUT_BUFFER:RefCell<std::collections::VecDeque<String>>=RefCell::new(std::collections::VecDeque::new());
    }

    #[macro_export]
    macro_rules! input_internal {
        ($x:ident : $t:ty) => {
            INPUT_BUFFER.with(|p| {
                if p.borrow().len() == 0 {
                    let temp_str = input_line_str();
                    let mut split_result_iter = temp_str
                        .split(SPLIT_DELIMITER)
                        .map(|q| q.to_string())
                        .collect::<std::collections::VecDeque<_>>();
                    p.borrow_mut().append(&mut split_result_iter)
                }
            });
            let mut buf_split_result = String::new();
            INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
            let $x: $t = buf_split_result.parse().unwrap();
        };
        (mut $x:ident : $t:ty) => {
            INPUT_BUFFER.with(|p| {
                if p.borrow().len() == 0 {
                    let temp_str = input_line_str();
                    let mut split_result_iter = temp_str
                        .split(SPLIT_DELIMITER)
                        .map(|q| q.to_string())
                        .collect::<std::collections::VecDeque<_>>();
                    p.borrow_mut().append(&mut split_result_iter)
                }
            });
            let mut buf_split_result = String::new();
            INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
            let mut $x: $t = buf_split_result.parse().unwrap();
        };
    }

    #[macro_export]
    macro_rules! inputv {
    ($i:ident : $t:ty) => {
        input_internal!{$i : $t}
    };
    (mut $i:ident : $t:ty) => {
        input_internal!{mut $i : $t}
    };
    ($i:ident : $t:ty $(,)*) => {
            input_internal!{$i : $t}
    };
    (mut $i:ident : $t:ty $(,)*) => {
            input_internal!{mut $i : $t}
    };
    (mut $i:ident : $t:ty,$($q:tt)*) => {
            input_internal!{mut $i : $t}
            inputv!{$($q)*}
    };
    ($i:ident : $t:ty,$($q:tt)*) => {
            input_internal!{$i : $t}
            inputv!{$($q)*}
    };
}

    pub fn input_all() {
        INPUT_BUFFER.with(|p| {
            if p.borrow().len() == 0 {
                let mut temp_str = String::new();
                std::io::stdin().read_to_string(&mut temp_str).unwrap();
                let mut split_result_iter = temp_str
                    .split_whitespace()
                    .map(|q| q.to_string())
                    .collect::<std::collections::VecDeque<_>>();
                p.borrow_mut().append(&mut split_result_iter)
            }
        });
    }

    pub fn input_line_str() -> String {
        let mut s = String::new();
        io::stdin().read_line(&mut s).unwrap();
        s.trim().to_string()
    }

    #[allow(clippy::match_wild_err_arm)]
    pub fn input_vector<T>() -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<T> = Vec::new();

        let s = input_line_str();
        let split_result = s.split(SPLIT_DELIMITER);
        for z in split_result {
            let buf = match z.parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error",),
            };
            v.push(buf);
        }
        v
    }

    #[allow(clippy::match_wild_err_arm)]
    pub fn input_vector_row<T>(n: usize) -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::with_capacity(n);
        for _ in 0..n {
            let buf = match input_line_str().parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error",),
            };
            v.push(buf);
        }
        v
    }

    pub trait ToCharVec {
        fn to_charvec(&self) -> Vec<char>;
    }

    impl ToCharVec for String {
        fn to_charvec(&self) -> Vec<char> {
            self.to_string().chars().collect::<Vec<_>>()
        }
    }
}