結果
問題 | No.550 夏休みの思い出(1) |
ユーザー | sntea |
提出日時 | 2017-10-05 17:05:35 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,556 bytes |
コンパイル時間 | 11,386 ms |
コンパイル使用メモリ | 377,532 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-16 21:11:29 |
合計ジャッジ時間 | 12,935 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 3 ms
5,248 KB |
testcase_02 | AC | 3 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 3 ms
5,248 KB |
testcase_05 | AC | 3 ms
5,248 KB |
testcase_06 | AC | 3 ms
5,248 KB |
testcase_07 | AC | 3 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 1 ms
5,248 KB |
testcase_12 | AC | 0 ms
5,248 KB |
testcase_13 | AC | 1 ms
5,248 KB |
testcase_14 | AC | 1 ms
5,248 KB |
testcase_15 | AC | 0 ms
5,248 KB |
testcase_16 | AC | 1 ms
5,248 KB |
testcase_17 | AC | 1 ms
5,248 KB |
testcase_18 | AC | 1 ms
5,248 KB |
testcase_19 | AC | 1 ms
5,248 KB |
testcase_20 | AC | 1 ms
5,248 KB |
testcase_21 | AC | 1 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 1 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 2 ms
5,248 KB |
testcase_26 | AC | 1 ms
5,248 KB |
testcase_27 | AC | 2 ms
5,248 KB |
testcase_28 | AC | 1 ms
5,248 KB |
testcase_29 | AC | 1 ms
5,248 KB |
testcase_30 | AC | 2 ms
5,248 KB |
testcase_31 | AC | 1 ms
5,248 KB |
testcase_32 | AC | 1 ms
5,248 KB |
testcase_33 | AC | 1 ms
5,248 KB |
testcase_34 | AC | 1 ms
5,248 KB |
testcase_35 | AC | 1 ms
5,248 KB |
testcase_36 | AC | 1 ms
5,248 KB |
testcase_37 | AC | 1 ms
5,248 KB |
testcase_38 | AC | 1 ms
5,248 KB |
testcase_39 | AC | 1 ms
5,248 KB |
testcase_40 | AC | 1 ms
5,248 KB |
testcase_41 | AC | 1 ms
5,248 KB |
testcase_42 | AC | 2 ms
5,248 KB |
testcase_43 | AC | 1 ms
5,248 KB |
testcase_44 | AC | 2 ms
5,248 KB |
testcase_45 | AC | 1 ms
5,248 KB |
testcase_46 | AC | 1 ms
5,248 KB |
testcase_47 | AC | 1 ms
5,248 KB |
testcase_48 | AC | 1 ms
5,248 KB |
testcase_49 | AC | 1 ms
5,248 KB |
testcase_50 | AC | 1 ms
5,248 KB |
testcase_51 | AC | 1 ms
5,248 KB |
testcase_52 | AC | 1 ms
5,248 KB |
testcase_53 | AC | 1 ms
5,248 KB |
testcase_54 | AC | 1 ms
5,248 KB |
testcase_55 | AC | 1 ms
5,248 KB |
testcase_56 | AC | 1 ms
5,248 KB |
testcase_57 | AC | 1 ms
5,248 KB |
コンパイルメッセージ
warning: unused macro definition: `readlvec` --> src/main.rs:29:14 | 29 | macro_rules! readlvec { | ^^^^^^^^ | = note: `#[warn(unused_macros)]` on by default warning: unused macro definition: `mvec` --> src/main.rs:39:14 | 39 | macro_rules! mvec { | ^^^^ warning: unused macro definition: `debug` --> src/main.rs:48:14 | 48 | macro_rules! debug { | ^^^^^ warning: unused variable: `rt` --> src/main.rs:84:9 | 84 | let rt = (bb*bb-4.0*cc).sqrt(); | ^^ help: if this is intentional, prefix it with an underscore: `_rt` | = note: `#[warn(unused_variables)]` on by default warning: function `printiter` is never used --> src/main.rs:54:4 | 54 | fn printiter<'a, T>(v: &'a T) | ^^^^^^^^^ | = note: `#[warn(dead_code)]` on by default
ソースコード
// use std::ops::{Index, IndexMut}; // use std::cmp::{Ordering, min, max}; // use std::collections::{BinaryHeap, BTreeMap}; // use std::collections::btree_map::Entry::{Occupied, Vacant}; // use std::clone::Clone; fn getline() -> String{ let mut res = String::new(); std::io::stdin().read_line(&mut res).ok(); res } macro_rules! readl { ($t: ty) => { { let s = getline(); s.trim().parse::<$t>().unwrap() } }; ($( $t: ty),+ ) => { { let s = getline(); let mut iter = s.trim().split(' '); ($(iter.next().unwrap().parse::<$t>().unwrap(),)*) } }; } macro_rules! readlvec { ($t: ty) => { { let s = getline(); let iter = s.trim().split(' '); iter.map(|x| x.parse().unwrap()).collect::<Vec<$t>>() } } } macro_rules! mvec { ($v: expr, $s: expr) => { vec![$v; $s] }; ($v: expr, $s: expr, $($t: expr),*) => { vec![mvec!($v, $($t),*); $s] }; } macro_rules! debug { ($x: expr) => { println!("{}: {:?}", stringify!($x), $x) } } fn printiter<'a, T>(v: &'a T) where &'a T: std::iter::IntoIterator, <&'a T as std::iter::IntoIterator>::Item: std::fmt::Display { for (i,e) in v.into_iter().enumerate() { if i != 0 { print!(" "); } print!("{}", e); } println!(""); } fn main() { let (a, b, c) = readl!(i64, i64, i64); let mut ans0 = None; for d in 0..1_000_001 { let calc = |x: i64| x*x*x + a*x*x + b*x + c; if calc(d) == 0 { ans0 = Some(d); break; } if calc(-d) == 0 { ans0 = Some(-d); break; } } let ans0 = ans0.unwrap(); let bb = a as f64 + ans0 as f64; let cc = b as f64 + bb * ans0 as f64; let rt = (bb*bb-4.0*cc).sqrt(); let mut ans = Vec::new(); let calc = |x: f64| x*x+bb*x+cc; let mut l = -1e9-1.0; let mut r = -bb/2.0; for _ in 0..100 { let m = (l+r)/2.0; if calc(m) < 0.0 { r = m; } else { l = m; } } ans.push(l.round() as i64); let mut l = -bb/2.0; let mut r = 1e9+1.0; for _ in 0..100 { let m = (l+r)/2.0; if calc(m) > 0.0 { r = m; } else { l = m; } } ans.push(l.round() as i64); ans.push(ans0); ans.sort(); println!("{} {} {}", ans[0], ans[1], ans[2]); }