結果

問題 No.466 ジオラマ
コンテスト
ユーザー hatoo
提出日時 2017-10-21 19:55:34
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 28 ms / 2,000 ms
コード長 4,563 bytes
コンパイル時間 12,720 ms
コンパイル使用メモリ 388,464 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-21 12:36:01
合計ジャッジ時間 17,264 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 83
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{HashMap, HashSet};

mod util {
    use std::io::stdin;
    use std::str::FromStr;
    use std::fmt::Debug;

    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }

    #[allow(dead_code)]
    pub fn get<T: FromStr>() -> T
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().parse().unwrap()
    }

    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }

    #[allow(dead_code)]
    pub fn get2<T: FromStr, U: FromStr>() -> (T, U)
    where
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }

    #[allow(dead_code)]
    pub fn get3<S: FromStr, T: FromStr, U: FromStr>() -> (S, T, U)
    where
        <S as FromStr>::Err: Debug,
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }
}

// std::cmp::Reverse doesn't have Clone.
#[derive(Eq, PartialEq, Clone)]
struct Rev<T>(pub T);

impl<T: PartialOrd> PartialOrd for Rev<T> {
    fn partial_cmp(&self, other: &Rev<T>) -> Option<Ordering> {
        other.0.partial_cmp(&self.0)
    }
}

impl<T: Ord> Ord for Rev<T> {
    fn cmp(&self, other: &Rev<T>) -> Ordering {
        other.0.cmp(&self.0)
    }
}

#[allow(unused_macros)]
macro_rules! debug {
    ($x: expr) => {
        println!("{}: {:?}", stringify!($x), $x)
    }
}

fn main() {
    let abcd: Vec<usize> = util::gets();
    let a = abcd[0];
    let b = abcd[1];
    let c = abcd[2];
    let d = abcd[3];

    if a == b && b == c {
        if c < 2 {
            println!("-1");
            return;
        }
        let mut o = Vec::new();

        o.push((0, 1));
        o.push((1, 0));
        for i in 2..c {
            o.push((0, i));
        }

        if o.len() > d {
            println!("-1");
            return;
        }
        println!("{} {}", c, o.len());
        for &(f, t) in &o {
            println!("{} {}", f, t);
        }
        return;
    }

    if a == c {
        let mut o = Vec::new();
        o.push((1, 0));

        let mut v = 2;
        for _ in 0..c - 1 {
            o.push((0, v));
            v += 1;
        }
        for _ in 0..b - 1 - c {
            o.push((1, v));
            v += 1;
        }
        if o.len() > d {
            println!("-1");
            return;
        }
        println!("{} {}", v, o.len());
        for &(f, t) in &o {
            println!("{} {}", f, t);
        }
        return;
    }

    if b == c {
        let mut o = Vec::new();
        o.push((0, 1));

        let mut v = 2;
        for _ in 0..c - 1 {
            o.push((1, v));
            v += 1;
        }
        for _ in 0..a - 1 - c {
            o.push((0, v));
            v += 1;
        }
        if o.len() > d {
            println!("-1");
            return;
        }
        println!("{} {}", v, o.len());
        for &(f, t) in &o {
            println!("{} {}", f, t);
        }
        return;
    }

    let mut o = Vec::new();
    let mut v = 2;
    for _ in 0..a - c - 1 {
        o.push((0, v));
        v += 1;
    }

    for _ in 0..b - c - 1 {
        o.push((1, v));
        v += 1;
    }

    if c > 0 {
        o.push((0, v));
        o.push((1, v));

        v += 1;
        for _ in 1..c {
            o.push((v - 1, v));
            v += 1;
        }
    }
    if o.len() > d {
        println!("-1");
        return;
    }
    println!("{} {}", v, o.len());
    for &(f, t) in &o {
        println!("{} {}", f, t);
    }
    return;



}
0