結果
問題 | No.2510 Six Cube Sum Counting |
ユーザー |
|
提出日時 | 2023-10-20 23:17:12 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 3,294 ms / 4,000 ms |
コード長 | 2,371 bytes |
コンパイル時間 | 25,196 ms |
コンパイル使用メモリ | 401,920 KB |
実行使用メモリ | 184,320 KB |
最終ジャッジ日時 | 2024-09-20 22:46:09 |
合計ジャッジ時間 | 102,173 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 26 |
ソースコード
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 id = BTreeMap::new();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];let len = id.len();let now_id = *id.entry(s).or_insert(len);sums[d].push(now_id);}}}let mut count = vec![0; id.len()];let mut ans: usize = 0;for c in (0..=300).rev() {for s_id in &sums[c] {count[*s_id] += 1;}for b in (0..=c).rev() {for a in (0..=b).rev() {let y = pow[a] + pow[b] + pow[c];if y <= x {if let Some(s) = id.get(&(x - y)) {ans += count[*s];}}}}}writeln!(out, "{}", ans).unwrap();}