#997304 (Rust) No.2970 三次関数の絶対値

提出ソース

結果

問題	No.2970 三次関数の絶対値
ユーザー	Moss_Local
提出日時	2024-07-24 21:27:12
言語	Rust (1.77.0 + proconio)
結果	WA
実行時間	-
コード長	3,850 bytes
コンパイル時間	16,009 ms
コンパイル使用メモリ	407,188 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-07-24 21:28:36
合計ジャッジ時間	79,855 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,252 ms 6,812 KB
testcase_01	AC	1,252 ms 6,940 KB
testcase_02	AC	1,282 ms 6,940 KB
testcase_03	AC	1,273 ms 6,940 KB
testcase_04	AC	1,254 ms 6,944 KB
testcase_05	WA	-
testcase_06	AC	1,272 ms 6,940 KB
testcase_07	AC	1,249 ms 6,940 KB
testcase_08	WA	-
testcase_09	AC	1,289 ms 6,944 KB
testcase_10	AC	1,261 ms 6,944 KB
testcase_11	AC	1,280 ms 6,940 KB
testcase_12	WA	-
testcase_13	AC	1,268 ms 6,940 KB
testcase_14	AC	1,259 ms 6,940 KB
testcase_15	AC	1,257 ms 6,940 KB
testcase_16	AC	1,254 ms 6,944 KB
testcase_17	WA	-
testcase_18	AC	1,278 ms 6,944 KB
testcase_19	AC	1,255 ms 6,940 KB
testcase_20	WA	-
testcase_21	AC	1,268 ms 6,940 KB
testcase_22	AC	1,250 ms 6,944 KB
testcase_23	AC	1,255 ms 6,940 KB
testcase_24	WA	-
testcase_25	WA	-
testcase_26	AC	1,300 ms 6,940 KB
testcase_27	WA	-
testcase_28	AC	1,284 ms 6,940 KB
testcase_29	WA	-
testcase_30	AC	1,296 ms 6,944 KB
testcase_31	AC	1,273 ms 6,944 KB
testcase_32	AC	1,280 ms 6,940 KB
testcase_33	WA	-
testcase_34	AC	1,286 ms 6,944 KB
testcase_35	WA	-
testcase_36	AC	1,285 ms 6,940 KB
testcase_37	AC	1,275 ms 6,940 KB
testcase_38	WA	-
testcase_39	WA	-
testcase_40	AC	1,262 ms 6,944 KB
testcase_41	AC	1,257 ms 6,944 KB
testcase_42	AC	1,288 ms 6,944 KB
testcase_43	WA	-
testcase_44	AC	1,283 ms 6,940 KB
testcase_45	AC	1,259 ms 6,940 KB
testcase_46	AC	1,270 ms 6,940 KB
testcase_47	AC	1,260 ms 6,944 KB
testcase_48	WA	-
testcase_49	AC	1,256 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: unused variable: `i`
   --> src/main.rs:173:9
    |
173 |     for i in 0..tap {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:167:9
    |
167 |     let mut c: Vec<i64> =

ソースコード

raw source code

// -*- 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])
}

use std::io::BufRead;

fn solve() {
    let mut c: Vec<i64> = read_vec();
    let (l, r) = readii();
    let mut x = l as f64;
    let mut tap = 500000000;
    let mut add = (r - l + 1) as f64 / tap as f64;
    let mut min_val = INF as f64;
    for i in 0..tap {
        let y = c[3] as f64 * x * x * x + c[2] as f64 * x * x + c[1] as f64 * x + c[0] as f64;
        let y = y.abs();
        if y < min_val {
            min_val = y;
        }

        x += add;
    }
    p!(min_val);
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード