結果

問題 No.1051 PQ Permutation
ユーザー koba-e964koba-e964
提出日時 2020-05-25 22:34:27
言語 Rust
(1.77.0)
結果
WA  
実行時間 -
コード長 4,188 bytes
コンパイル時間 2,015 ms
コンパイル使用メモリ 181,608 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-04-21 03:55:32
合計ジャッジ時間 6,073 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,948 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 1 ms
6,944 KB
testcase_11 AC 1 ms
6,940 KB
testcase_12 AC 1 ms
6,944 KB
testcase_13 AC 1 ms
6,944 KB
testcase_14 AC 1 ms
6,944 KB
testcase_15 AC 43 ms
6,944 KB
testcase_16 AC 43 ms
6,940 KB
testcase_17 AC 26 ms
6,944 KB
testcase_18 AC 26 ms
6,944 KB
testcase_19 AC 27 ms
6,940 KB
testcase_20 AC 35 ms
6,944 KB
testcase_21 AC 36 ms
6,944 KB
testcase_22 AC 27 ms
6,940 KB
testcase_23 AC 35 ms
6,944 KB
testcase_24 AC 33 ms
6,940 KB
testcase_25 AC 4 ms
6,940 KB
testcase_26 AC 2 ms
6,940 KB
testcase_27 AC 1 ms
6,944 KB
testcase_28 AC 4 ms
6,940 KB
testcase_29 AC 2 ms
6,944 KB
testcase_30 AC 4 ms
6,944 KB
testcase_31 AC 2 ms
6,940 KB
testcase_32 AC 4 ms
6,944 KB
testcase_33 AC 1 ms
6,940 KB
testcase_34 AC 1 ms
6,944 KB
testcase_35 AC 12 ms
6,940 KB
testcase_36 AC 13 ms
6,948 KB
testcase_37 AC 15 ms
6,940 KB
testcase_38 AC 25 ms
6,940 KB
testcase_39 AC 15 ms
6,944 KB
testcase_40 AC 24 ms
6,944 KB
testcase_41 AC 24 ms
6,940 KB
testcase_42 WA -
testcase_43 AC 1 ms
6,940 KB
testcase_44 AC 1 ms
6,940 KB
testcase_45 AC 1 ms
6,940 KB
testcase_46 AC 1 ms
6,940 KB
testcase_47 WA -
testcase_48 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/**
 * Returns the least index of elements that are modified, wrapped with Some.
 * If the entire array is reversed, it returns None instead.
 * v's elements must be pairwise distinct.
 */
fn next_permutation<T: Ord>(v: &mut [T]) -> Option<usize> {
    let mut tail_dec: usize = 1;
    let n = v.len();
    while tail_dec < n {
        if v[n - tail_dec - 1] > v[n - tail_dec] {
            tail_dec += 1;
        } else {
            break;
        }
    }
    // v[n - tail_dec .. n] is strictly decreasing
    if tail_dec < n {
        let x = n - tail_dec - 1;
        let mut y = n;
        {
            let pivot = &v[x];
            for i in (n - tail_dec .. n).rev() {
                if v[i] > *pivot {
                    y = i;
                    break;
                }
            }
            assert!(y < n);
        }
        v.swap(x, y);
    }
    v[n - tail_dec .. n].reverse();
    if tail_dec < n {
        Some(n - tail_dec - 1)
    } else {
        None
    }
}

fn calc(mut a: Vec<usize>, p: usize, q: usize) -> Option<Vec<usize>> {
    if let None = next_permutation(&mut a) {
        return None;
    }
    let pidx = a.iter().position(|&x| x == p).unwrap();
    let qidx = a.iter().position(|&x| x == q).unwrap();
    if pidx < qidx {
        return Some(a);
    }
    // qidx < pidx. Try to increment a[qidx].
    a[qidx + 1..].sort();
    a[qidx + 1..].reverse();
    if let None = next_permutation(&mut a) {
        return None;
    }
    let pidx = a.iter().position(|&x| x == p).unwrap();
    let qidx = a.iter().position(|&x| x == q).unwrap();
    if pidx < qidx {
        return Some(a);
    }
    for i in qidx..pidx {
        a.swap(i, i + 1);
    }
    Some(a)
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize, p: usize1, q: usize1,
        a: [usize1; n],
    }
    if let Some(ans) = calc(a, p, q) {
        for i in 0..n {
            puts!("{}{}", ans[i] + 1, if i + 1 == n { "\n" } else { " " });
        }
    } else {
        puts!("-1\n");
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}
0