結果
問題 | No.2510 Six Cube Sum Counting |
ユーザー | haihamabossu |
提出日時 | 2023-10-20 23:19:49 |
言語 | Rust (1.77.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,169 bytes |
コンパイル時間 | 1,197 ms |
コンパイル使用メモリ | 186,560 KB |
実行使用メモリ | 352,936 KB |
最終ジャッジ日時 | 2023-10-20 23:20:20 |
合計ジャッジ時間 | 8,698 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 302 ms
352,736 KB |
testcase_01 | AC | 268 ms
352,840 KB |
testcase_02 | AC | 387 ms
352,744 KB |
testcase_03 | AC | 286 ms
352,840 KB |
testcase_04 | AC | 280 ms
352,840 KB |
testcase_05 | AC | 257 ms
352,756 KB |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | AC | 283 ms
352,756 KB |
testcase_16 | AC | 255 ms
352,756 KB |
testcase_17 | AC | 255 ms
352,756 KB |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | AC | 305 ms
352,844 KB |
testcase_21 | AC | 420 ms
352,936 KB |
testcase_22 | AC | 346 ms
352,760 KB |
testcase_23 | AC | 311 ms
352,744 KB |
testcase_24 | AC | 409 ms
352,816 KB |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | AC | 403 ms
352,732 KB |
testcase_28 | RE | - |
testcase_29 | AC | 381 ms
352,768 KB |
コンパイルメッセージ
warning: unused import: `collections::BTreeMap` --> Main.rs:40:11 | 40 | use std::{collections::BTreeMap, io::Write}; | ^^^^^^^^^^^^^^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: 1 warning emitted
ソースコード
pub mod scanner { pub struct Scanner { buf: Vec<String>, } impl Scanner { pub fn new() -> Self { Self { buf: vec![] } } pub fn new_from(source: &str) -> Self { let source = String::from(source); let buf = Self::split(source); Self { buf } } pub fn next<T: std::str::FromStr>(&mut self) -> T { loop { if let Some(x) = self.buf.pop() { return x.parse().ok().expect(""); } let mut source = String::new(); std::io::stdin().read_line(&mut source).expect(""); self.buf = Self::split(source); } } fn split(source: String) -> Vec<String> { source .split_whitespace() .rev() .map(String::from) .collect::<Vec<_>>() } } } use crate::scanner::Scanner; use std::{collections::BTreeMap, io::Write}; fn main() { let mut scanner = Scanner::new(); let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); let t: usize = 1; for _ in 0..t { solve(&mut scanner, &mut out); } } fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) { let x = scanner.next::<usize>(); let mut pow = vec![0usize; 301]; for i in 1..=300 { pow[i] = i * i * i; } let mut sums = vec![vec![]; 301]; for d in (0..=300).rev() { for e in d..=300 { for f in e..=300 { let s = pow[d] + pow[e] + pow[f]; sums[d].push(s); } } } let mut count = vec![0u32; 300 * 300 * 300 * 3 + 1]; let mut ans: u32 = 0; for c in (0..=300).rev() { for s in &sums[c] { count[*s] += 1; } for b in (0..=c).rev() { for a in (0..=b).rev() { let y = pow[a] + pow[b] + pow[c]; if y <= x { ans += count[x - y]; } } } } writeln!(out, "{}", ans).unwrap(); }