結果
問題 | No.2515 Similar Triangles |
ユーザー |
|
提出日時 | 2023-10-27 21:24:24 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 1 ms / 2,000 ms |
コード長 | 4,770 bytes |
コンパイル時間 | 12,871 ms |
コンパイル使用メモリ | 390,628 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-25 13:23:36 |
合計ジャッジ時間 | 13,652 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 7 |
コンパイルメッセージ
warning: unused variable: `X1` --> src/main.rs:17:13 | 17 | X1: usize, | ^^ | help: `X1` is captured in macro and introduced a unused variable --> src/main.rs:48:13 | 16 | / input! { 17 | | X1: usize, 18 | | Y1: usize, 19 | | X2: usize, 20 | | Y2: usize, 21 | | X3: usize, 22 | | } | |_________- in this macro invocation ... 48 | let $var = __input_inner!($t); | ^^^^ = note: `#[warn(unused_variables)]` on by default = note: this warning originates in the macro `input` (in Nightly builds, run with -Z macro-backtrace for more info) warning: unused variable: `X2` --> src/main.rs:19:13 | 19 | X2: usize, | ^^ | help: `X2` is captured in macro and introduced a unused variable --> src/main.rs:48:13 | 16 | / input! { 17 | | X1: usize, 18 | | Y1: usize, 19 | | X2: usize, 20 | | Y2: usize, 21 | | X3: usize, 22 | | } | |_________- in this macro invocation ... 48 | let $var = __input_inner!($t); | ^^^^ = note: this warning originates in the macro `input` (in Nightly builds, run with -Z macro-backtrace for more info) warning: unused variable: `X3` --> src/main.rs:21:13 | 21 | X3: usize, | ^^ | help: `X3` is captured in macro and introduced a unused variable --> src/main.rs:48:13 | 16 | / input! { 17 | | X1: usize, 18 | | Y1: usize, 19 | | X2: usize, 20 | | Y2: usize, 21 | | X3: usize, 22 | | } | |_________- in this macro invocation ... 48 | let $var = __input_inner!($t); | ^^^^ = note: this warning originates in the macro `input` (in Nightly builds, run with -Z macro-backtrace for more info)
ソースコード
#![allow(non_snake_case)]#![allow(unused_imports)]#![allow(unused_macros)]#![allow(clippy::needless_range_loop)]#![allow(clippy::comparison_chain)]#![allow(clippy::nonminimal_bool)]#![allow(clippy::neg_multiply)]#![allow(dead_code)]use std::cmp::Reverse;use std::collections::{BTreeMap, BTreeSet, BinaryHeap, VecDeque};#[derive(Default)]struct Solver {}impl Solver {fn solve(&mut self) {input! {X1: usize,Y1: usize,X2: usize,Y2: usize,X3: usize,}if Y1 == Y2 {println!("Yes");} else {println!("No");}}}fn main() {std::thread::Builder::new().stack_size(128 * 1024 * 1024).spawn(|| Solver::default().solve()).unwrap().join().unwrap();}#[macro_export]macro_rules! input {() => {};(mut $var:ident: $t:tt, $($rest:tt)*) => {let mut $var = __input_inner!($t);input!($($rest)*)};($var:ident: $t:tt, $($rest:tt)*) => {let $var = __input_inner!($t);input!($($rest)*)};(mut $var:ident: $t:tt) => {let mut $var = __input_inner!($t);};($var:ident: $t:tt) => {let $var = __input_inner!($t);};}#[macro_export]macro_rules! __input_inner {(($($t:tt),*)) => {($(__input_inner!($t)),*)};([$t:tt; $n:expr]) => {(0..$n).map(|_| __input_inner!($t)).collect::<Vec<_>>()};([$t:tt]) => {{let n = __input_inner!(usize);(0..n).map(|_| __input_inner!($t)).collect::<Vec<_>>()}};(chars) => {__input_inner!(String).chars().collect::<Vec<_>>()};(bytes) => {__input_inner!(String).into_bytes()};(usize1) => {__input_inner!(usize) - 1};($t:ty) => {$crate::read::<$t>()};}#[macro_export]macro_rules! println {() => {$crate::write(|w| {use std::io::Write;std::writeln!(w).unwrap()})};($($arg:tt)*) => {$crate::write(|w| {use std::io::Write;std::writeln!(w, $($arg)*).unwrap()})};}#[macro_export]macro_rules! print {($($arg:tt)*) => {$crate::write(|w| {use std::io::Write;std::write!(w, $($arg)*).unwrap()})};}#[macro_export]macro_rules! flush {() => {$crate::write(|w| {use std::io::Write;w.flush().unwrap()})};}pub fn read<T>() -> TwhereT: std::str::FromStr,T::Err: std::fmt::Debug,{use std::cell::RefCell;use std::io::*;thread_local! {pub static STDIN: RefCell<StdinLock<'static>> = RefCell::new(stdin().lock());}STDIN.with(|r| {let mut r = r.borrow_mut();let mut s = vec![];loop {let buf = r.fill_buf().unwrap();if buf.is_empty() {break;}if let Some(i) = buf.iter().position(u8::is_ascii_whitespace) {s.extend_from_slice(&buf[..i]);r.consume(i + 1);if !s.is_empty() {break;}} else {s.extend_from_slice(buf);let n = buf.len();r.consume(n);}}std::str::from_utf8(&s).unwrap().parse().unwrap()})}pub fn write<F>(f: F)whereF: FnOnce(&mut std::io::BufWriter<std::io::StdoutLock>),{use std::cell::RefCell;use std::io::*;thread_local! {pub static STDOUT: RefCell<BufWriter<StdoutLock<'static>>> =RefCell::new(BufWriter::new(stdout().lock()));}STDOUT.with(|w| f(&mut w.borrow_mut()))}trait Bound<T> {fn lower_bound(&self, x: &T) -> usize;fn upper_bound(&self, x: &T) -> usize;}impl<T: PartialOrd> Bound<T> for [T] {fn lower_bound(&self, x: &T) -> usize {let (mut low, mut high) = (0, self.len());while low + 1 < high {let mid = (low + high) / 2;if self[mid] < *x {low = mid;} else {high = mid;}}if self[low] < *x {low + 1} else {low}}fn upper_bound(&self, x: &T) -> usize {let (mut low, mut high) = (0, self.len());while low + 1 < high {let mid = (low + high) / 2;if self[mid] <= *x {low = mid;} else {high = mid;}}if self[low] <= *x {low + 1} else {low}}}