結果
問題 | No.2730 Two Types Luggage |
ユーザー | 👑 tipstar0125 |
提出日時 | 2024-04-19 21:47:34 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 286 ms / 2,000 ms |
コード長 | 5,280 bytes |
コンパイル時間 | 4,302 ms |
コンパイル使用メモリ | 185,988 KB |
実行使用メモリ | 32,864 KB |
最終ジャッジ日時 | 2024-04-19 21:47:57 |
合計ジャッジ時間 | 11,007 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 8 ms
5,376 KB |
testcase_11 | AC | 187 ms
24,576 KB |
testcase_12 | AC | 265 ms
31,632 KB |
testcase_13 | AC | 147 ms
19,968 KB |
testcase_14 | AC | 219 ms
24,448 KB |
testcase_15 | AC | 49 ms
7,680 KB |
testcase_16 | AC | 65 ms
9,984 KB |
testcase_17 | AC | 246 ms
30,424 KB |
testcase_18 | AC | 223 ms
27,676 KB |
testcase_19 | AC | 17 ms
5,376 KB |
testcase_20 | AC | 87 ms
12,672 KB |
testcase_21 | AC | 183 ms
23,552 KB |
testcase_22 | AC | 249 ms
32,408 KB |
testcase_23 | AC | 20 ms
5,376 KB |
testcase_24 | AC | 102 ms
14,080 KB |
testcase_25 | AC | 190 ms
24,832 KB |
testcase_26 | AC | 49 ms
8,064 KB |
testcase_27 | AC | 178 ms
23,552 KB |
testcase_28 | AC | 89 ms
13,768 KB |
testcase_29 | AC | 215 ms
28,960 KB |
testcase_30 | AC | 22 ms
5,376 KB |
testcase_31 | AC | 145 ms
19,456 KB |
testcase_32 | AC | 128 ms
17,152 KB |
testcase_33 | AC | 262 ms
31,584 KB |
testcase_34 | AC | 261 ms
31,968 KB |
testcase_35 | AC | 286 ms
31,584 KB |
testcase_36 | AC | 266 ms
31,200 KB |
testcase_37 | AC | 264 ms
32,864 KB |
ソースコード
#![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! { N: usize, M: usize, mut W: usize, A: [usize; N], B: [usize; M], C: [usize; M] } let mut D = vec![]; for &a in A.iter() { D.push((a, 1)); } for (&b, &c) in B.iter().zip(C.iter()) { D.push((c, b)); } D.sort(); D.reverse(); D.sort_by(|(a, b), (c, d)| (b * c).cmp(&(a * d))); let mut ans = 0; for &(v, w) in D.iter() { if w <= W { ans += v; W -= w; } } println!("{}", ans); } } 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>() -> T where T: 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) where F: 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 // } // } // }