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

• 問題: No.1630 Sorting Integers (Greater than K)
• ユーザー: Moss_Local
• 提出日時: 2021-07-30 21:44:17
• 言語: Rust (1.83.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 7,882 bytes
• コンパイル時間: 13,783 ms
• コンパイル使用メモリ: 377,828 KB
• 実行使用メモリ: 10,624 KB
• 最終ジャッジ日時: 2024-09-15 23:33:23
• 合計ジャッジ時間: 18,143 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 5
other	AC * 1 WA * 10 OLE * 1 -- * 10

コンパイルメッセージ

warning: unnecessary parentheses around type
   --> src/main.rs:117:15
    |
117 | fn readi() -> (i64) {
    |               ^   ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
117 - fn readi() -> (i64) {
117 + fn readi() -> i64 {
    |

warning: unused variable: `j`
   --> src/main.rs:237:17
    |
237 |             for j in 0..vec[i] {
    |                 ^ help: if this is intentional, prefix it with an underscore: `_j`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: unused variable: `i`
   --> src/main.rs:305:9
    |
305 |     for i in cnt..n {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`

warning: unused variable: `j`
   --> src/main.rs:308:17
    |
308 |             for j in 0..vec[i] {
    |                 ^ help: if this is intentional, prefix it with an underscore: `_j`

warning: variable does not need to be mutable
   --> src/main.rs:230:9
    |
230 |     let mut n: usize = s.next().unwrap().parse().unwrap();
    |         ----^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:231:9
    |
231 |     let mut s: String = s.next().unwrap().parse().unwrap();
    |         ----^
    |         |
    |         help: remove this `mut`

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::fmt::Debug;
use std::fs::File;
use std::io::prelude::*;
use std::io::*;
use std::marker::Copy;
use std::mem::*;
use std::ops::Bound::*;
use std::ops::{Add, Mul, Neg, Sub};
use std::str;
use std::vec;
use std::{cmp, process::Output};
use std::{cmp::Ordering, env::consts::DLL_PREFIX};
use std::{cmp::Ordering::*, f32::consts::PI};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const FINF: f64 = 122337203685.0;
const INF128: i128 = 1223372036854775807000000000000;
const LINF: i64 = 2147483647;
const MOD: i64 = 1000000007;
// const MOD: i64 = 998244353;
const T: bool = true;
const F: bool = false;

const MPI: f64 = 3.14159265358979323846264338327950288f64;
// const MOD: i64 = INF;

const UMOD: usize = MOD as usize;
use std::cmp::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        println!("{}", $x);
    };
}
macro_rules! d {
    ($x:expr) => {
        println!("{:?}", $x);
    };
}
macro_rules! dd {
    (x:expr) => {
        dbg!(x);
    };
}

macro_rules! chmin {
    ($base:expr, $($cmps:expr),+ $(,)*) => {{
        let cmp_min = min!($($cmps),+);
        if $base > cmp_min {
            $base = cmp_min;
            true
        } else {
            false
        }
    }};
}

macro_rules! chmax {
    ($base:expr, $($cmps:expr),+ $(,)*) => {{
        let cmp_max = max!($($cmps),+);
        if $base < cmp_max {
            $base = cmp_max;
            true
        } else {
            false
        }
    }};
}

macro_rules! min {
    ($a:expr $(,)*) => {{
        $a
    }};
    ($a:expr, $b:expr $(,)*) => {{
        std::cmp::min($a, $b)
    }};
    ($a:expr, $($rest:expr),+ $(,)*) => {{
        std::cmp::min($a, min!($($rest),+))
    }};
}

macro_rules! max {
    ($a:expr $(,)*) => {{
        $a
    }};
    ($a:expr, $b:expr $(,)*) => {{
        std::cmp::max($a, $b)
    }};
    ($a:expr, $($rest:expr),+ $(,)*) => {{
        std::cmp::max($a, max!($($rest),+))
    }};
}

// use str::Chars;

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn readi() -> (i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    iter.next().unwrap().parse::<i64>().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
#[allow(dead_code)]
fn read_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

fn solve() {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    let mut s = s.split_whitespace();
    let mut n: usize = s.next().unwrap().parse().unwrap();
    let mut s: String = s.next().unwrap().parse().unwrap();
    let v: Vec<usize> = s.chars().map(|c| c as usize - '0' as usize).collect();
    let mut vec: Vec<usize> = read_vec();
    if n > v.len() {
        let mut resv = vec![];
        for i in 0..9 {
            for j in 0..vec[i] {
                resv.push(i + 1);
            }
        }
        resv.sort();
        for i in 0..resv.len() {
            print!("{}", resv[i]);
        }

        return;
    }
    if v.len() > n {
        println!("{:?}", -1);
        return;
    }
    let f = |x: usize| -> bool {
        let mut vv = vec.clone();

        for i in 0..x {
            if v[i] == 0 {
                return true;
            }
            if vv[v[i] - 1] == 0 {
                return false;
            }
            vv[v[i] - 1] -= 1;
        }
        let t = v[x];
        for i in t..9 {
            if vv[i] > 0 {
                return true;
            }
        }
        return false;
    };
    if f(0) == false {
        println!("{:?}", -1);
        return;
    }
    let mut ok = 0;
    let mut ng = n + 1;
    // n 桁構築できた上で n+1桁目が大きい数が作れるか
    while (ng - ok) > 1 {
        let mid = (ok + ng) / 2;
        if f(mid) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    let mut cnt = 0;
    for i in 0..ok {
        if v[i] == 0 {
            break;
        }
        print!("{}", v[i]);
        cnt += 1;
        vec[v[i] - 1] -= 1;
    }
    if cnt != n {
        for i in v[cnt]..9 {
            if vec[i] > 0 {
                print!("{}", i + 1);
                vec[i] -= 1;
                cnt += 1;
            }
        }
    }
    for i in cnt..n {
        let mut resv = vec![];
        for i in 0..9 {
            for j in 0..vec[i] {
                resv.push(i + 1);
            }
        }
        resv.sort();
        for i in 0..resv.len() {
            print!("{}", resv[i]);
        }
    }
    return;
}

fn main() {
    solve();
}