結果
問題 | No.2803 Bocching Star |
ユーザー |
![]() |
提出日時 | 2024-07-12 23:44:39 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 4,069 bytes |
コンパイル時間 | 14,331 ms |
コンパイル使用メモリ | 409,152 KB |
実行使用メモリ | 19,020 KB |
最終ジャッジ日時 | 2024-07-12 23:44:58 |
合計ジャッジ時間 | 18,192 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,812 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 9 ms
6,940 KB |
testcase_04 | AC | 52 ms
9,128 KB |
testcase_05 | AC | 23 ms
6,940 KB |
testcase_06 | AC | 5 ms
6,940 KB |
testcase_07 | AC | 21 ms
6,944 KB |
testcase_08 | AC | 11 ms
6,940 KB |
testcase_09 | AC | 47 ms
7,648 KB |
testcase_10 | AC | 52 ms
8,060 KB |
testcase_11 | AC | 65 ms
13,072 KB |
testcase_12 | AC | 20 ms
6,944 KB |
testcase_13 | AC | 41 ms
6,944 KB |
testcase_14 | AC | 28 ms
6,940 KB |
testcase_15 | AC | 67 ms
14,684 KB |
testcase_16 | AC | 35 ms
8,540 KB |
testcase_17 | AC | 10 ms
6,940 KB |
testcase_18 | AC | 6 ms
6,940 KB |
testcase_19 | AC | 43 ms
7,672 KB |
testcase_20 | AC | 28 ms
6,940 KB |
testcase_21 | AC | 21 ms
6,944 KB |
testcase_22 | AC | 24 ms
6,940 KB |
testcase_23 | AC | 59 ms
10,144 KB |
testcase_24 | AC | 83 ms
18,564 KB |
testcase_25 | AC | 75 ms
15,932 KB |
testcase_26 | AC | 76 ms
16,688 KB |
testcase_27 | AC | 63 ms
11,932 KB |
testcase_28 | AC | 69 ms
14,116 KB |
testcase_29 | AC | 60 ms
10,524 KB |
testcase_30 | AC | 77 ms
17,120 KB |
testcase_31 | AC | 56 ms
9,632 KB |
testcase_32 | AC | 83 ms
19,020 KB |
testcase_33 | AC | 2 ms
6,944 KB |
testcase_34 | AC | 2 ms
6,940 KB |
testcase_35 | AC | 1 ms
6,944 KB |
testcase_36 | AC | 1 ms
6,940 KB |
testcase_37 | AC | 2 ms
6,944 KB |
コンパイルメッセージ
warning: variable does not need to be mutable --> src/main.rs:122:9 | 122 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable does not need to be mutable --> src/main.rs:128:9 | 128 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:133:9 | 133 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:139:9 | 139 | let mut vec: Vec<f64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:144:9 | 144 | let mut vec: Vec<char> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:149:9 | 149 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:154:9 | 154 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:160:9 | 160 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:167:9 | 167 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | 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::iter::FromIterator; 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 MOD1: i64 = 1000000007; const MOD9: i64 = 998244353; const MOD: i64 = MOD9; // const MOD: i64 = MOD2; const UMOD: usize = MOD as usize; const M_PI: f64 = 3.14159265358979323846; // use proconio::input; // 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) => { //if expr println!("{}", $x); }; } macro_rules! vp { // vector print separate with space ($x:expr) => { println!( "{}", $x.iter() .map(|x| x.to_string()) .collect::<Vec<_>>() .join(" ") ); }; } macro_rules! d { ($x:expr) => { eprintln!("{:?}", $x); }; } macro_rules! yn { ($val:expr) => { if $val { println!("Yes"); } else { println!("No"); } }; } macro_rules! map{ // declear btreemap ($($key:expr => $val:expr),*) => { { let mut map = ::std::collections::BTreeMap::new(); $( map.insert($key, $val); )* map } }; } macro_rules! set{ // declear btreemap ($($key:expr),*) => { { let mut set = ::std::collections::BTreeSet::new(); $( set.insert($key); )* set } }; } fn main() { solve(); } //input output #[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 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 vec: Vec<i64> = read_vec(); (vec[0], vec[1]) } #[allow(dead_code)] fn readiii() -> (i64, i64, i64) { let mut vec: Vec<i64> = read_vec(); (vec[0], vec[1], vec[2]) } #[allow(dead_code)] fn readuu() -> (usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1]) } #[allow(dead_code)] fn readff() -> (f64, f64) { let mut vec: Vec<f64> = read_vec(); (vec[0], vec[1]) } fn readcc() -> (char, char) { let mut vec: Vec<char> = read_vec(); (vec[0], vec[1]) } fn readuuu() -> (usize, usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1], vec[2]) } #[allow(dead_code)] fn readiiii() -> (i64, i64, i64, i64) { let mut vec: Vec<i64> = read_vec(); (vec[0], vec[1], vec[2], vec[3]) } #[allow(dead_code)] fn readuuuu() -> (usize, usize, usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1], vec[2], vec[3]) } fn solve() { let (n, s) = readuu(); let s = s as i64; let mut vec: Vec<i64> = read_vec(); let mut val_to_idx = vec![]; for i in 0..n { val_to_idx.push((vec[i], i)); } let mut vec = val_to_idx; vec.sort(); let mut res = vec![]; if n == 1 { p!(1); p!(1); return; } if vec[1].0 - vec[0].0 > s { res.push(vec[0].1 + 1); } for i in 1..n - 1 { if vec[i].0 - vec[i - 1].0 > s && vec[i + 1].0 - vec[i].0 > s { res.push(vec[i].1 + 1); } } if vec[n - 1].0 - vec[n - 2].0 > s { res.push(vec[n - 1].1 + 1); } res.sort(); p!(res.len()); vp!(res); return; }