結果
問題 | No.2210 equence Squence Seuence |
ユーザー |
![]() |
提出日時 | 2023-02-10 23:03:40 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 48 ms / 2,000 ms |
コード長 | 7,425 bytes |
コンパイル時間 | 11,448 ms |
コンパイル使用メモリ | 389,984 KB |
実行使用メモリ | 12,196 KB |
最終ジャッジ日時 | 2024-07-07 17:06:21 |
合計ジャッジ時間 | 13,800 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
コンパイルメッセージ
warning: unnecessary parentheses around type --> src/main.rs:64:15 | 64 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 64 - fn readi() -> (i64) { 64 + fn readi() -> i64 { | warning: unnecessary parentheses around `if` condition --> src/main.rs:240:12 | 240 | if (i != 0) { | ^ ^ | help: remove these parentheses | 240 - if (i != 0) { 240 + if i != 0 { | warning: variable does not need to be mutable --> src/main.rs:208:9 | 208 | let mut a: Vec<usize> = read_vec(); | ----^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable does not need to be mutable --> src/main.rs:209:9 | 209 | let mut ofst = 1000000000 as usize; | ----^^^^ | | | help: remove this `mut`
ソースコード
// -*- coding:utf-8-unix -*-// #![feature(map_first_last)]#![allow(dead_code)]#![allow(unused_imports)]#![allow(unused_macros)]use core::num;use std::cmp::*;use std::fmt::*;use std::hash::*;use std::*;use std::{cmp, collections, fmt, io, iter, ops, str};const INF: i64 = 1223372036854775807;const UINF: usize = INF as usize;const LINF: i64 = 2147483647;const INF128: i128 = 1223372036854775807000000000000;// const MOD: i64 = 1000000007;const MOD: i64 = 998244353;const UMOD: usize = MOD as usize;const M_PI: f64 = 3.14159265358979323846;// const MOD: i64 = INF;use cmp::Ordering::*;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);};}#[allow(unused_macros)]pub mod macros {macro_rules! min { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); std::cmp::min($x, y) } }}macro_rules! max { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); std::cmp::max($x, y) } }}macro_rules! chmin { ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); if $x > y { $x = y; true } else { false } }}}macro_rules! chmax { ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); if $x < y { $x = y; true } else { false } }}}macro_rules! multi_vec { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_vec![$element; ($($lens),*)]; $len] );($element: expr; ($len: expr)) => ( vec![$element; $len] ); }macro_rules! multi_box_array { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_box_array![$element; ($($lens),*)]; $len].into_boxed_slice() ); ($element: expr; ($len: expr)) => ( vec![$element; $len].into_boxed_slice() ); }#[allow(unused_imports)]pub(super) use {chmax, chmin, max, min, multi_box_array, multi_vec};}use macros::*;fn main() {solve();}// 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_mat<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(),)}#[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(),)}#[allow(dead_code)]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(),)}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(),)}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 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(),)}#[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 divisors(n: usize) -> Vec<usize> {let mut divisors = Vec::new();// n := i * x とおくと、 i が i > root(n) の時、 i はすでに ある x に探索されているから// i <= root(n) まで探索すればよいfor i in 1..=(f64::sqrt(n as f64) + 1e-9) as usize {// i で n が割り切れた場合if n % i == 0 {// 約数リストに格納divisors.push(i);// n := i * x の x を格納。ただし x := i の時は除くif i != n / i {divisors.push(n / i);}}}divisors.sort();divisors}pub fn mod_pow(x: usize, n: usize, m: usize) -> usize {let mut res = 1;let mut x = x % m;let mut n = n;while n > 0 {if n & 1 == 1 {res = (res * x) % m;}x = (x * x) % m;n >>= 1;}res}fn solve() {let (n, k) = readuu();let mut a: Vec<usize> = read_vec();let mut ofst = 1000000000 as usize;let mut p = ofst - 1;let mut b = ofst + 1;let mut bt = BTreeMap::new();bt.insert(ofst, n - 1);let mut prev_mode = 0;for i in (0..n - 1).rev() {if a[i + 1] > a[i] {prev_mode = 1;bt.insert(b, i);b += 1;} else if a[i] > a[i + 1] {prev_mode = 0;bt.insert(p, i);p -= 1;} else {if prev_mode == 0 {bt.insert(p, i);p -= 1;} else {bt.insert(b, i);b += 1;}}}// d!(bt);let front_key = *bt.keys().next().unwrap();let r = *bt.get(&(front_key + k - 1)).unwrap();let mut vec = a.clone();vec.remove(r);for i in 0..vec.len() {if (i != 0) {print!(" ");}print!("{}", vec[i])}println!("");return;}