結果

問題 No.927 Second Permutation
ユーザー cotton_fn_cotton_fn_
提出日時 2020-03-16 13:12:44
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 4,373 bytes
コンパイル時間 13,359 ms
コンパイル使用メモリ 400,824 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-11-28 02:45:37
合計ジャッジ時間 14,241 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 10 WA * 17
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#![allow(unused)]
use kyoproio::*;
use std::{
collections::*,
io::{self, prelude::*},
iter,
mem::{replace, swap},
};
fn main() -> io::Result<()> {
std::thread::Builder::new()
.stack_size(50 * 1024 * 1024)
.spawn(solve)?
.join()
.unwrap();
Ok(())
}
fn solve() {
let stdin = io::stdin();
let mut kin = Input::new(stdin.lock());
let stdout = io::stdout();
let mut out = io::BufWriter::new(stdout.lock());
macro_rules! output {
($($args:expr),+) => { write!(&mut out, $($args),+) };
}
macro_rules! outputln {
($($args:expr),+) => { output!($($args),+); outputln!() };
() => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } }
}
let mut x = kin.bytes().to_owned();
x.sort();
x.reverse();
let n = x.len();
let mut swapped = false;
for i in (0..n - 1).rev() {
if x.get(i) != x.last() {
let j = x.len() - 1;
x.swap(i, j);
swapped = true;
break;
}
}
if swapped && x.first() != Some(&b'0') {
out.write_all(&x);
outputln!();
} else {
outputln!("-1");
}
}
// -----------------------------------------------------------------------------
pub mod kyoproio {
#![warn(unused)]
pub use std::io::prelude::*;
pub struct Input<R> {
src: R,
buf: String,
pos: usize,
}
impl<R: BufRead> Input<R> {
pub fn new(src: R) -> Self {
Self {
src,
buf: String::with_capacity(1024),
pos: 0,
}
}
pub fn str(&mut self) -> &str {
loop {
if self.pos >= self.buf.len() {
self.buf.clear();
let len = self.src.read_line(&mut self.buf).expect("io error");
self.pos = 0;
if len == 0 {
return &self.buf;
}
}
let range = self.pos
..self.buf[self.pos..]
.find(|c: char| c.is_ascii_whitespace())
.map(|i| i + self.pos)
.unwrap_or(self.buf.len());
self.pos = range.end + 1;
if range.end - range.start > 0 {
return &self.buf[range];
}
}
}
pub fn bytes(&mut self) -> &[u8] {
self.str().as_ref()
}
pub fn input<T: InputParse>(&mut self) -> T {
self.input_fallible().expect("input error")
}
pub fn input_fallible<T: InputParse>(&mut self) -> Result<T> {
T::input(self)
}
pub fn iter<T: InputParse>(&mut self) -> Iter<T, R> {
Iter {
input: self,
_t: std::marker::PhantomData,
}
}
}
pub struct Iter<'a, T, R> {
input: &'a mut Input<R>,
_t: std::marker::PhantomData<T>,
}
impl<'a, T: InputParse, R: BufRead> Iterator for Iter<'a, T, R> {
type Item = T;
fn next(&mut self) -> Option<Self::Item> {
Some(self.input.input())
}
}
type Result<T> = std::result::Result<T, Box<dyn std::error::Error + 'static>>;
pub trait InputParse: Sized {
fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self>;
}
macro_rules! input_from_str_impls {
{ $($T:ty)* } => {
$(impl InputParse for $T {
fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
input.str().parse::<$T>().map_err(|e| e.into())
}
})*
};
}
macro_rules! input_tuple_impls {
{ $(($($T:ident),+))* } => {
$(impl<$($T:InputParse),+> InputParse for ($($T),+) {
fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
Ok(($($T::input(input)?),+))
}
})*
};
}
input_from_str_impls! {
String char bool f32 f64
isize i8 i16 i32 i64 i128
usize u8 u16 u32 u64 u128
}
input_tuple_impls! {
(A, B)
(A, B, C)
(A, B, C, D)
(A, B, C, D, E)
(A, B, C, D, E, F)
(A, B, C, D, E, F, G)
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0