#684933 (Rust) No.1630 Sorting Integers (Greater than K)

提出ソース

結果

問題	No.1630 Sorting Integers (Greater than K)
ユーザー	akiradeveloper
提出日時	2021-07-31 00:55:46
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	94 ms / 2,000 ms
コード長	7,046 bytes
コンパイル時間	11,915 ms
コンパイル使用メモリ	378,656 KB
実行使用メモリ	45,904 KB
最終ジャッジ日時	2024-09-16 04:25:39
合計ジャッジ時間	13,970 ms
ジャッジサーバーID （参考情報）	judge1 / 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 ms 5,376 KB
testcase_04	AC	1 ms 5,376 KB
testcase_05	AC	1 ms 5,376 KB
testcase_06	AC	1 ms 5,376 KB
testcase_07	AC	1 ms 5,376 KB
testcase_08	AC	1 ms 5,376 KB
testcase_09	AC	1 ms 5,376 KB
testcase_10	AC	1 ms 5,376 KB
testcase_11	AC	1 ms 5,376 KB
testcase_12	AC	1 ms 5,376 KB
testcase_13	AC	1 ms 5,376 KB
testcase_14	AC	1 ms 5,376 KB
testcase_15	AC	1 ms 5,376 KB
testcase_16	AC	94 ms 45,900 KB
testcase_17	AC	85 ms 45,900 KB
testcase_18	AC	91 ms 45,876 KB
testcase_19	AC	86 ms 45,904 KB
testcase_20	AC	76 ms 42,060 KB
testcase_21	AC	77 ms 41,936 KB
testcase_22	AC	75 ms 37,968 KB
testcase_23	AC	9 ms 11,340 KB
testcase_24	AC	66 ms 37,084 KB
testcase_25	AC	13 ms 15,180 KB
testcase_26	AC	77 ms 45,852 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

warning: unused variable: `out`
   --> src/main.rs:113:13
    |
113 |     let mut out = BufWriter::new(out.lock());
    |             ^^^ help: if this is intentional, prefix it with an underscore: `_out`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:113:9
    |
113 |     let mut out = BufWriter::new(out.lock());
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable `G` should have a snake case name
   --> src/main.rs:119:13
    |
119 |     let mut G = vec![];
    |             ^ help: convert the identifier to snake case: `g`
    |
    = note: `#[warn(non_snake_case)]` on by default

warning: variable `M` should have a snake case name
   --> src/main.rs:124:10
    |
124 |     let mut M = vec![];
    |             ^ help: convert the identifier to snake case: `m`

warning: variable `M` should have a snake case name
   --> src/main.rs:144:13
    |
144 |     let mut M = vec![];
    |             ^ help: convert the identifier to snake case: `m`

warning: variable `M` should have a snake case name
   --> src/main.rs:164:17
    |
164 |         let mut M = vec![];
    |                 ^ help: convert the identifier to snake case: `m`

ソースコード

raw source code

#[doc = " https://github.com/akiradeveloper/rust-comp-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[macro_export]
macro_rules ! chmax { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: max ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! chmin { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: min ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! max { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: max ( $ x , max ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: min ( $ x , min ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! dvec { ( $ t : expr ; $ len : expr ) => { vec ! [ $ t ; $ len ] } ; ( $ t : expr ; $ len : expr , $ ( $ rest : expr ) ,* ) => { vec ! [ dvec ! ( $ t ; $ ( $ rest ) ,* ) ; $ len ] } ; }
#[macro_export]
macro_rules ! cfor { ( ; $ ( $ rest : tt ) * ) => { cfor ! ( ( ) ; $ ( $ rest ) * ) } ; ( $ ( $ init : stmt ) ,+; ; $ ( $ rest : tt ) * ) => { cfor ! ( $ ( $ init ) ,+; ! false ; $ ( $ rest ) * ) } ; ( $ ( $ init : stmt ) ,+; $ cond : expr ; ; $ body : block ) => { cfor ! { $ ( $ init ) ,+; $ cond ; ( ) ; $ body } } ; ( $ ( $ init : stmt ) ,+; $ cond : expr ; $ ( $ step : expr ) ,+; $ body : block ) => { { $ ( $ init ; ) + while $ cond { let mut _first = true ; let mut _continue = false ; loop { if ! _first { _continue = true ; break } _first = false ; $ body } if ! _continue { break } $ ( $ step ; ) + } } } ; }
#[doc = " main"]
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[macro_export]
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]
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]
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 , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
    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();
		if len == 0 {
		    break;
		}
		(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 str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
	    } else {
		self.update_buf();
	    }
	}
    }
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
	thread::Builder::new()
	    .stack_size(32 * 1024 * 1024)
	    .name("solve".into())
	    .spawn(solve)
	    .unwrap()
	    .join()
	    .unwrap();
    } else {
	solve();
    }
}
fn solve() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());
    input!{
		n:usize,k:chars,
		c:[usize;9]
    }
	// dbg!(k);
    let mut G = vec![];
    for c in k {
        G.push((c as u8 - '0' as u8) as usize);
    }
	// dbg!(&G);
	let mut M = vec![];
	for j in 0..9 {
		for _ in 0..c[j] {
			M.push(j as i64+1);
		}
	}
	// dbg!(&M);
	if G.len() < M.len() {
		// Mがベストなのでそのまま出力
		let s = vec_to_string(&M).join("");
		println!("{}", s);
		return
	}
	if G.len() > M.len() {
		println!("-1");
		return;
	}
	assert!(G.len() == M.len());

    let mut rem = c.clone();
    let mut M = vec![];
    let mut max_k = None;
    for i in 0..n {
        let x = G[i] as usize;
        // 越えることが出来るか
        for j in x..9 {
            if rem[j] > 0 {
                max_k = Some(i);
            }
        }
        // なぞる
        if x >= 1 && rem[x-1] > 0 {
            M.push(x);
            rem[x-1] -= 1;
        } else {
            break;
        }
    }
//     dbg!(max_k);
    if let Some(k) = max_k {
        let mut M = vec![];
        let mut rem = c.clone();
        for i in 0..k {
            let x = G[i] as usize;
            rem[x-1] -= 1;
            M.push(x);
        }
        let x = G[k] as usize;
        for j in x..9 {
            if rem[j] > 0 {
                M.push(j+1);
                rem[j] -= 1;
		break;
            }
        }
	// dbg!(&rem);
        for i in 0..9 {
            for _ in 0..rem[i] {
                M.push(i+1);
            }
        }
        let s = vec_to_string(&M).join("");
        println!("{}",s);
    } else {
        println!("-1");
    }
}
pub fn vec_to_string<T: ToString>(xs: &[T]) -> Vec<String> {
	let mut res = vec![];
	for x in xs {
		res.push(x.to_string());
	}
	res
}
pub fn into_digits(b: i64, n: i64) -> Vec<i64> {
	let mut r = vec![];
	let mut n = n;
	while n > 0 {
		let v = n % b;
		r.push(v);
		n -= v;
		n /= b;
	}
	r
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード