Submission #15708840


Source Code Expand

Copy
use proconio::input;
fn main() {
input! {
a: i64,
b: i64,
c: i64,
k: i64,
s: i64,
t: i64,
};
let ans = if s + t >= k {
s * (a - c) + t * (b - c)
} else {
s * a + t * b
};
println!("{}", ans);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
use proconio::input;

fn main() {
    input! {
        a: i64,
        b: i64,
        c: i64,
        k: i64,
        s: i64,
        t: i64,
    };
    let ans = if s + t >= k {
        s * (a - c) + t * (b - c)
    } else {
        s * a + t * b
    };
    println!("{}", ans);
}

Submission Info

Submission Time
Task A - 動物園
User bouzuya
Language Rust (1.42.0)
Score 100
Code Size 283 Byte
Status AC
Exec Time 8 ms
Memory 2164 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 32
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt
Case Name Status Exec Time Memory
sample_01.txt AC 8 ms 2040 KB
sample_02.txt AC 1 ms 2060 KB
sample_03.txt AC 1 ms 2100 KB
subtask1_01.txt AC 2 ms 1908 KB
subtask1_02.txt AC 1 ms 2024 KB
subtask1_03.txt AC 2 ms 2016 KB
subtask1_04.txt AC 2 ms 1996 KB
subtask1_05.txt AC 1 ms 2076 KB
subtask1_06.txt AC 1 ms 2064 KB
subtask1_07.txt AC 2 ms 2052 KB
subtask1_08.txt AC 1 ms 2024 KB
subtask1_09.txt AC 2 ms 1968 KB
subtask1_10.txt AC 2 ms 1948 KB
subtask1_11.txt AC 1 ms 2024 KB
subtask1_12.txt AC 1 ms 2064 KB
subtask1_13.txt AC 4 ms 2164 KB
subtask1_14.txt AC 1 ms 2036 KB
subtask1_15.txt AC 1 ms 2028 KB
subtask1_16.txt AC 1 ms 2128 KB
subtask1_17.txt AC 1 ms 2072 KB
subtask1_18.txt AC 1 ms 2000 KB
subtask1_19.txt AC 1 ms 2032 KB
subtask1_20.txt AC 1 ms 2112 KB
subtask1_21.txt AC 1 ms 1944 KB
subtask1_22.txt AC 2 ms 2068 KB
subtask1_23.txt AC 1 ms 1964 KB
subtask1_24.txt AC 1 ms 1952 KB
subtask1_25.txt AC 2 ms 2020 KB
subtask1_26.txt AC 2 ms 2060 KB
subtask1_27.txt AC 1 ms 2152 KB
subtask1_28.txt AC 1 ms 2080 KB
subtask1_29.txt AC 1 ms 1968 KB


2025-04-07 (Mon)
21:48:51 +00:00