結果
問題 | No.5 数字のブロック |
ユーザー | しの |
提出日時 | 2020-11-16 21:19:00 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 5,380 bytes |
コンパイル時間 | 14,227 ms |
コンパイル使用メモリ | 400,380 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-23 01:44:38 |
合計ジャッジ時間 | 13,824 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,812 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 1 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 1 ms
6,940 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,940 KB |
testcase_18 | AC | 1 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,944 KB |
testcase_22 | AC | 1 ms
6,944 KB |
testcase_23 | AC | 1 ms
6,940 KB |
testcase_24 | AC | 1 ms
6,944 KB |
testcase_25 | AC | 1 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,944 KB |
testcase_27 | AC | 1 ms
6,944 KB |
testcase_28 | AC | 1 ms
6,944 KB |
testcase_29 | AC | 1 ms
6,940 KB |
testcase_30 | AC | 1 ms
6,940 KB |
testcase_31 | AC | 1 ms
6,940 KB |
testcase_32 | AC | 1 ms
6,940 KB |
testcase_33 | AC | 1 ms
6,944 KB |
ソースコード
use crate::lib::io::*; fn main() { let mut io = IO::new(); let (mut l, n) = io.scan(); let mut w: Vec<u32> = io.scan_vec(n); w.sort_unstable(); let mut cnt = 0; for e in w { if e <= l { l -= e; cnt += 1; } } io.println(cnt); } pub mod lib { //////////////////////////////////////////////////////////////// pub mod io { ///////////////////////////////////////////////////////////////// use std::io::{stdout, BufWriter, Read, StdoutLock, Write}; pub struct IO { iter: std::str::SplitAsciiWhitespace<'static>, buf: BufWriter<StdoutLock<'static>>, } impl IO { pub fn new() -> Self { let mut input = String::new(); std::io::stdin().read_to_string(&mut input).unwrap(); let input = Box::leak(input.into_boxed_str()); let out = Box::new(stdout()); IO { iter: input.split_ascii_whitespace(), buf: BufWriter::new(Box::leak(out).lock()), } } fn scan_str(&mut self) -> &'static str { self.iter.next().unwrap() } fn scan_raw(&mut self) -> &'static [u8] { self.scan_str().as_bytes() } pub fn scan<T: Scan>(&mut self) -> T { T::scan(self) } pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<T> { (0..n).map(|_| self.scan()).collect() } pub fn scan_graph(&mut self) -> (usize, usize, Vec<Vec<usize>>) { let n = self.scan(); let m = self.scan(); let mut graph = vec![Vec::new(); n]; for _ in 0..m { let u: usize = self.scan(); let v: usize = self.scan(); graph[u].push(v); graph[v].push(u); } (n, m, graph) } pub fn scan_digraph(&mut self) -> (usize, usize, Vec<Vec<usize>>) { let n = self.scan(); let m = self.scan(); let mut graph = vec![Vec::new(); n]; for _ in 0..m { let u: usize = self.scan(); let v: usize = self.scan(); graph[u].push(v); } (n, m, graph) } pub fn scan_tree(&mut self) -> (usize, Vec<Vec<usize>>) { let n = self.scan(); let mut graph = vec![Vec::new(); n]; for _ in 0..n - 1 { let u: usize = self.scan(); let v: usize = self.scan(); graph[u].push(v); graph[v].push(u); } (n, graph) } } impl IO { pub fn print<T: Print>(&mut self, x: T) { T::print(self, x); } pub fn println<T: Print>(&mut self, x: T) { self.print(x); self.print("\n"); } pub fn iterln<T: Print, I: IntoIterator<Item = T>>(&mut self, iter: I, delim: &str) { let mut iter = iter.into_iter(); if let Some(v) = iter.next() { self.print(v); for v in iter { self.print(delim); self.print(v); } } self.print("\n"); } pub fn flush(&mut self) { self.buf.flush().unwrap(); } } pub trait Scan { fn scan(io: &mut IO) -> Self; } macro_rules! impl_parse_int { ($($t:tt),*) => { $( impl Scan for $t { fn scan(s: &mut IO) -> Self { let mut res = 0; for d in s.scan_raw() { res *= 10; res += (*d - b'0') as $t; } res } } )* }; } impl_parse_int!(i32, i64, isize, u32, u64, usize); impl Scan for u8 { fn scan(s: &mut IO) -> Self { let bytes = s.scan_raw(); debug_assert_eq!(bytes.len(), 1); bytes[0] } } impl Scan for &[u8] { fn scan(s: &mut IO) -> Self { s.scan_raw() } } impl<T: Scan, U: Scan> Scan for (T, U) { fn scan(s: &mut IO) -> Self { (T::scan(s), U::scan(s)) } } impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) { fn scan(s: &mut IO) -> Self { (T::scan(s), U::scan(s), V::scan(s)) } } impl<T: Scan> Scan for [T; 2] { fn scan(s: &mut IO) -> Self { [s.scan(), s.scan()] } } impl<T: Scan> Scan for [T; 3] { fn scan(s: &mut IO) -> Self { [s.scan(), s.scan(), s.scan()] } } impl<T: Scan> Scan for [T; 4] { fn scan(s: &mut IO) -> Self { [s.scan(), s.scan(), s.scan(), s.scan()] } } pub trait Print { fn print(w: &mut IO, x: Self); } macro_rules! impl_print_int { ($($t:ty),*) => { $( impl Print for $t { fn print(w: &mut IO, x: Self) { w.buf.write_all(x.to_string().as_bytes()).unwrap(); } } )* }; } impl_print_int!(i32, i64, isize, u32, u64, usize); impl Print for u8 { fn print(w: &mut IO, x: Self) { w.buf.write_all(&[x]).unwrap(); } } impl Print for &[u8] { fn print(w: &mut IO, x: Self) { w.buf.write_all(x).unwrap(); } } impl Print for &str { fn print(w: &mut IO, x: Self) { w.print(x.as_bytes()); } } impl<T: Print, U: Print> Print for (T, U) { fn print(w: &mut IO, (x, y): Self) { w.print(x); w.print(" "); w.print(y); } } impl<T: Print, U: Print, V: Print> Print for (T, U, V) { fn print(w: &mut IO, (x, y, z): Self) { w.print(x); w.print(" "); w.print(y); w.print(" "); w.print(z); } } } // mod io } // mod lib