結果
| 問題 | No.2953 Maximum Right Triangle |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2024-11-08 21:40:13 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 1 ms / 2,000 ms |
| コード長 | 4,846 bytes |
| コンパイル時間 | 12,836 ms |
| コンパイル使用メモリ | 376,840 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-11-08 21:40:34 |
| 合計ジャッジ時間 | 13,036 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 6 |
コンパイルメッセージ
warning: unnecessary parentheses around `return` value
--> src/main.rs:180:16
|
180 | return (xx >= 0 && xx <= d && yy >= 0 && yy <= d);
| ^ ^
|
= note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
|
180 - return (xx >= 0 && xx <= d && yy >= 0 && yy <= d);
180 + return xx >= 0 && xx <= d && yy >= 0 && yy <= d;
|
warning: unnecessary parentheses around `return` value
--> src/main.rs:205:16
|
205 | return (xx >= 0 && xx <= d && yy >= 0 && yy <= d);
| ^ ^
|
help: remove these parentheses
|
205 - return (xx >= 0 && xx <= d && yy >= 0 && yy <= d);
205 + return xx >= 0 && xx <= d && yy >= 0 && yy <= d;
|
warning: variable does not need to be mutable
--> src/main.rs:110:9
|
110 | 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:116:9
|
116 | let mut vec: Vec<i64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:121:9
|
121 | let mut vec: Vec<usize> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:127:9
|
127 | let mut vec: Vec<f64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:132:9
|
132 | let mut vec: Vec<char> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:137:9
|
137 | let mut vec: Vec<
ソースコード
#![allow(dead_code)]#![allow(unused_imports)]#![allow(unused_macros)]use std::cmp::*;use std::fmt::*;use std::hash::*;use std::io::BufRead;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 UMOD: usize = MOD as usize;const M_PI: f64 = 3.14159265358979323846;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! vp {($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{($($key:expr => $val:expr),*) => {{let mut map = ::std::collections::BTreeMap::new();$(map.insert($key, $val);)*map}};}macro_rules! set{($($key:expr),*) => {{let mut set = ::std::collections::BTreeSet::new();$(set.insert($key);)*set}};}#[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: usize) -> 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 gcd(a: i64, b: i64) -> i64 {if b == 0 {a} else {gcd(b, a % b)}}fn square_of_three_points(x1: i64, y1: i64, x2: i64, y2: i64, x3: i64, y3: i64) -> i64 {let a = x1 - x2;let b = y1 - y2;let c = x1 - x3;let d = y1 - y3;return (a * d - b * c).abs();}fn solve() {let (d, x, y) = readuuu();let x = x as i64;let y = y as i64;let g = gcd(x.abs(), y.abs());let a = -1 * y / g;let b = x / g;let d = d as i64;let mut res = 0;let f = |k: i64| -> bool {let xx = a * k + x;let yy = b * k + y;return (xx >= 0 && xx <= d && yy >= 0 && yy <= d);};let mut ok = 0;let mut ng = LINF;while (ng - ok).abs() > 1 {let mid = (ok + ng) / 2;if f(mid) {ok = mid;} else {ng = mid;}}let xx = a * ok + x;let yy = b * ok + y;let s1 = square_of_three_points(0, 0, x, y, xx, yy);// dbg!(xx, yy, ok, s1);if s1 > 0 {res = max(res, s1);}let g = |k: i64| -> bool {let xx = -1 * a * k + x;let yy = -1 * b * k + y;return (xx >= 0 && xx <= d && yy >= 0 && yy <= d);};let mut ok = 0;let mut ng = LINF;while (ng - ok).abs() > 1 {let mid = (ok + ng) / 2;if g(mid) {ok = mid;} else {ng = mid;}}let xx = -1 * a * ok + x;let yy = -1 * b * ok + y;let s2 = square_of_three_points(0, 0, x, y, xx, yy);// dbg!(xx, yy, ok, s2);if s2 > 0 {res = max(res, s2);}p!(res);return;}fn main() {let n: usize = read();for i in 0..n {solve();}return;}