結果
問題 | No.2918 Divide Applicants Fairly |
ユーザー | ぱるま |
提出日時 | 2024-10-12 14:12:44 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,334 bytes |
コンパイル時間 | 13,508 ms |
コンパイル使用メモリ | 392,560 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-10-12 14:13:02 |
合計ジャッジ時間 | 16,190 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | AC | 1 ms
6,820 KB |
testcase_04 | AC | 1 ms
6,816 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 1 ms
6,816 KB |
testcase_10 | AC | 1 ms
6,816 KB |
testcase_11 | AC | 1 ms
6,816 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 1 ms
6,816 KB |
testcase_16 | AC | 1 ms
6,816 KB |
testcase_17 | AC | 1 ms
6,816 KB |
testcase_18 | AC | 1 ms
6,816 KB |
testcase_19 | WA | - |
testcase_20 | AC | 1 ms
6,816 KB |
testcase_21 | AC | 1 ms
6,820 KB |
testcase_22 | WA | - |
testcase_23 | AC | 1 ms
6,816 KB |
testcase_24 | AC | 1 ms
6,816 KB |
testcase_25 | AC | 1 ms
6,816 KB |
testcase_26 | WA | - |
testcase_27 | AC | 1 ms
6,816 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 0 ms
6,816 KB |
testcase_31 | WA | - |
testcase_32 | AC | 1 ms
6,820 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | AC | 1 ms
6,816 KB |
testcase_40 | AC | 1 ms
6,816 KB |
testcase_41 | AC | 1 ms
6,820 KB |
testcase_42 | AC | 1 ms
6,816 KB |
testcase_43 | AC | 1 ms
6,820 KB |
testcase_44 | AC | 1 ms
6,820 KB |
testcase_45 | AC | 1 ms
6,820 KB |
testcase_46 | AC | 1 ms
6,820 KB |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | AC | 1 ms
6,820 KB |
testcase_53 | AC | 1 ms
6,816 KB |
testcase_54 | AC | 1 ms
6,820 KB |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | AC | 1 ms
6,820 KB |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 1 ms
6,816 KB |
testcase_61 | AC | 1 ms
6,820 KB |
testcase_62 | AC | 1 ms
6,816 KB |
testcase_63 | AC | 1 ms
6,820 KB |
コンパイルメッセージ
warning: fields `n` and `xs` are never read --> src/main.rs:4:5 | 3 | struct Problem { | ------- fields in this struct 4 | n: usize, | ^ 5 | xs: Vec<i64>, | ^^ | = note: `Problem` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis = note: `#[warn(dead_code)]` on by default
ソースコード
//#[derive_readable] #[derive(Debug, Clone)] struct Problem { n: usize, xs: Vec<i64>, } impl Problem { fn read() -> Problem { input! { n: usize, xs: [i64; n], } Problem { n, xs } } fn solve(&self) -> Answer { let ans = 0; Answer { ans } } #[allow(dead_code)] fn solve_naive(&self) -> Answer { todo!(); // let ans = 0; // Answer { ans } } } #[derive(Clone, Debug, PartialEq, Eq)] struct Answer { ans: i64, } impl Answer { fn print(&self) { println!("{}", self.ans); } } fn main() { Problem::read().solve().print(); } #[cfg(test)] mod tests { #[allow(unused_imports)] use super::*; #[allow(unused_imports)] use rand::{rngs::SmallRng, seq::SliceRandom, *}; #[test] fn test_problem() { assert_eq!(1 + 1, 2); } #[allow(dead_code)] #[derive(Debug)] struct WrongTestCase { problem: Problem, main_ans: Answer, naive_ans: Answer, } #[allow(dead_code)] fn check(p: &Problem) -> Option<WrongTestCase> { let main_ans = p.solve(); let naive_ans = p.solve_naive(); if main_ans != naive_ans { Some(WrongTestCase { problem: p.clone(), main_ans, naive_ans, }) } else { None } } #[allow(dead_code)] fn make_random_problem(rng: &mut SmallRng) -> Problem { todo!() // let n = rng.gen_range(1..=10); // let p = Problem { _a: n }; // println!("{:?}", &p); // p } #[allow(unreachable_code)] #[test] fn test_with_naive() { let num_tests = 0; let max_wrong_case = 10; // この件数間違いが見つかったら打ち切り let mut rng = SmallRng::seed_from_u64(42); // let mut rng = SmallRng::from_entropy(); let mut wrong_cases: Vec<WrongTestCase> = vec![]; for _ in 0..num_tests { let p = make_random_problem(&mut rng); let result = check(&p); if let Some(wrong_test_case) = result { wrong_cases.push(wrong_test_case); } if wrong_cases.len() >= max_wrong_case { break; } } if !wrong_cases.is_empty() { for t in &wrong_cases { println!("{:?}", t.problem); println!("main ans : {:?}", t.main_ans); println!("naive ans: {:?}", t.naive_ans); println!(); } println!("{} cases are wrong.", wrong_cases.len()); panic!(); } } } // ====== import ====== #[allow(unused_imports)] use proconio::{ derive_readable, fastout, input, marker::{Bytes, Chars, Usize1}, }; #[allow(unused_imports)] use std::cmp::Reverse; #[allow(unused_imports)] use std::collections::{BinaryHeap, HashMap, HashSet}; // ====== output func ====== #[allow(unused_imports)] use print_vec::*; pub mod print_vec { use proconio::fastout; #[fastout] pub fn print_vec<T: std::fmt::Debug>(arr: &[T]) { for a in arr { println!("{:?}", a); } } #[fastout] pub fn print_vec_1line<T: std::fmt::Debug>(arr: &[T]) { let msg = arr.iter().map(|x| format!("{:?}", x)).collect::<Vec<String>>().join(" "); println!("{}", msg); } #[fastout] pub fn print_vec2<T: std::fmt::Debug>(arr: &Vec<Vec<T>>) { for row in arr { let msg = row.iter().map(|x| format!("{:?}", x)).collect::<Vec<String>>().join(" "); println!("{}", msg); } } pub fn print_bytes(bytes: &[u8]) { let msg = String::from_utf8(bytes.to_vec()).unwrap(); println!("{}", msg); } pub fn print_chars(chars: &[char]) { let msg = chars.iter().collect::<String>(); println!("{}", msg); } #[fastout] pub fn print_vec_bytes(vec_bytes: &[Vec<u8>]) { for row in vec_bytes { let msg = String::from_utf8(row.to_vec()).unwrap(); println!("{}", msg); } } } #[allow(unused)] fn print_yesno(ans: bool) { let msg = if ans { "Yes" } else { "No" }; println!("{}", msg); } // ====== snippet ======