結果
| 問題 | No.1722 [Cherry 3rd Tune C] In my way |
| ユーザー |
 manta1130
|
| 提出日時 | 2021-10-29 21:42:13 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 1 ms / 2,000 ms |
| コード長 | 7,324 bytes |
| コンパイル時間 | 13,560 ms |
| コンパイル使用メモリ | 386,228 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-10-07 10:34:09 |
| 合計ジャッジ時間 | 14,902 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 23 |
コンパイルメッセージ
warning: unused variable: `n`
--> src/main.rs:9:9
|
9 | n:usize,m:usize
| ^
|
help: `n` is captured in macro and introduced a unused variable
--> src/main.rs:55:17
|
8 | / inputv! {
9 | | n:usize,m:usize
10 | | }
| |_____- in this macro invocation
...
55 | let t = buf_split_result.parse().unwrap();
| ^^
= note: `#[warn(unused_variables)]` on by default
= note: this warning originates in the macro `input_internal` which comes from the expansion of the macro `inputv` (in Nightly builds, run with -Z macro-backtrace for more info)
warning: unused variable: `m`
--> src/main.rs:9:17
|
9 | n:usize,m:usize
| ^
|
help: `m` is captured in macro and introduced a unused variable
--> src/main.rs:55:17
|
8 | / inputv! {
9 | | n:usize,m:usize
10 | | }
| |_____- in this macro invocation
...
55 | let t = buf_split_result.parse().unwrap();
| ^^
= note: this warning originates in the macro `input_internal` which comes from the expansion of the macro `inputv` (in Nightly builds, run with -Z macro-backtrace for more info)
ソースコード
#[allow(unused_imports)]use std::io::{stdout, BufWriter, Write};fn main() {let out = stdout();let mut out = BufWriter::new(out.lock());inputv! {n:usize,m:usize}let x = input_vector::<i64>();let mut y = input_vector::<i64>();y.sort();for x in x {let idx = y.lower_bound(x);if idx == y.len() {writeln!(out, "Infinity").unwrap();} else {writeln!(out, "{}", y[idx] - x).unwrap();}}}//https://github.com/manta1130/competitive-template-rsuse input::*;use vectools::*;pub mod input {use std::cell::RefCell;use std::io;pub const SPLIT_DELIMITER: char = ' ';pub use std::io::prelude::*;thread_local! {pub static INPUT_BUFFER:RefCell<std::collections::VecDeque<String>>=RefCell::new(std::collections::VecDeque::new());}#[macro_export]macro_rules! input_internal {($x:ident : $t:ty) => {INPUT_BUFFER.with(|p| {if p.borrow().len() == 0 {let temp_str = input_line_str();let mut split_result_iter = temp_str.split(SPLIT_DELIMITER).map(|q| q.to_string()).collect::<std::collections::VecDeque<_>>();p.borrow_mut().append(&mut split_result_iter)}});let mut buf_split_result = String::new();INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());let $x: $t = buf_split_result.parse().unwrap();};(mut $x:ident : $t:ty) => {INPUT_BUFFER.with(|p| {if p.borrow().len() == 0 {let temp_str = input_line_str();let mut split_result_iter = temp_str.split(SPLIT_DELIMITER).map(|q| q.to_string()).collect::<std::collections::VecDeque<_>>();p.borrow_mut().append(&mut split_result_iter)}});let mut buf_split_result = String::new();INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());let mut $x: $t = buf_split_result.parse().unwrap();};}pub fn input_buffer_is_empty() -> bool {let mut empty = false;INPUT_BUFFER.with(|p| {if p.borrow().len() == 0 {empty = true;}});empty}#[macro_export]macro_rules! inputv {($i:ident : $t:ty) => {input_internal!{$i : $t}};(mut $i:ident : $t:ty) => {input_internal!{mut $i : $t}};($i:ident : $t:ty $(,)*) => {input_internal!{$i : $t}};(mut $i:ident : $t:ty $(,)*) => {input_internal!{mut $i : $t}};(mut $i:ident : $t:ty,$($q:tt)*) => {input_internal!{mut $i : $t}inputv!{$($q)*}};($i:ident : $t:ty,$($q:tt)*) => {input_internal!{$i : $t}inputv!{$($q)*}};}pub fn input_all() {INPUT_BUFFER.with(|p| {if p.borrow().len() == 0 {let mut temp_str = String::new();std::io::stdin().read_to_string(&mut temp_str).unwrap();let mut split_result_iter = temp_str.split_whitespace().map(|q| q.to_string()).collect::<std::collections::VecDeque<_>>();p.borrow_mut().append(&mut split_result_iter)}});}pub fn input_line_str() -> String {let mut s = String::new();io::stdin().read_line(&mut s).unwrap();s.trim().to_string()}#[allow(clippy::match_wild_err_arm)]pub fn input_vector<T>() -> Vec<T>whereT: std::str::FromStr,{let mut v: Vec<T> = Vec::new();let s = input_line_str();let split_result = s.split(SPLIT_DELIMITER);for z in split_result {let buf = match z.parse() {Ok(r) => r,Err(_) => panic!("Parse Error",),};v.push(buf);}v}#[allow(clippy::match_wild_err_arm)]pub fn input_vector_row<T>(n: usize) -> Vec<T>whereT: std::str::FromStr,{let mut v = Vec::with_capacity(n);for _ in 0..n {let buf = match input_line_str().parse() {Ok(r) => r,Err(_) => panic!("Parse Error",),};v.push(buf);}v}pub trait ToCharVec {fn to_charvec(&self) -> Vec<char>;}impl ToCharVec for String {fn to_charvec(&self) -> Vec<char> {self.to_string().chars().collect::<Vec<_>>()}}}pub mod vectools {pub trait BSearch<T>whereT: PartialOrd,{fn lower_bound(&self, k: T) -> usize;fn upper_bound(&self, k: T) -> usize;}impl<T> BSearch<T> for Vec<T>whereT: PartialOrd,{fn lower_bound(&self, k: T) -> usize {let mut from = 0;let mut to = self.len();while to - from > 1 {let mid = (from + to) / 2;if self[mid] < k {from = mid;} else {to = mid;}}if self[from] < k {to} else {from}}fn upper_bound(&self, k: T) -> usize {let mut from = 0;let mut to = self.len();while to - from > 1 {let mid = (from + to) / 2;if self[mid] <= k {from = mid;} else {to = mid;}}if self[from] > k {from} else {to}}}pub fn next_permutation<T>(v: &mut Vec<T>) -> boolwhereT: PartialOrd,{let mut pivot = v.len() - 1;loop {if pivot == 0 {return false;}if v[pivot] > v[pivot - 1] {pivot -= 1;break;}pivot -= 1;}let mut pivot_swap = v.len() - 1;while v[pivot] >= v[pivot_swap] {pivot_swap -= 1;}v.swap(pivot, pivot_swap);v[pivot + 1..].reverse();true}pub fn seq_compress<T>(v: &mut [T], start: T, step: T)whereT: Ord + Copy + std::ops::AddAssign,{let mut buf_v = v.iter().cloned().enumerate().collect::<Vec<_>>();buf_v.sort_unstable_by_key(|q| q.1);let mut prev_val = buf_v[0].1;let mut new_val = start;for (_i, x) in buf_v.iter_mut() {if prev_val != *x {new_val += step;prev_val = *x;}*x = new_val;}buf_v.sort_unstable();for (i, x) in v.iter_mut().enumerate() {*x = buf_v[i].1;}}}