結果
問題 | No.2734 Addition and Multiplication in yukicoder (Hard) |
ユーザー | naut3 |
提出日時 | 2024-04-19 22:36:27 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,096 bytes |
コンパイル時間 | 13,525 ms |
コンパイル使用メモリ | 379,064 KB |
実行使用メモリ | 18,560 KB |
最終ジャッジ日時 | 2024-10-11 16:15:10 |
合計ジャッジ時間 | 17,331 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
ソースコード
#![allow(non_snake_case, unused_imports, unused_must_use)] use std::io::{self, prelude::*}; use std::str; fn main() { let (stdin, stdout) = (io::stdin(), io::stdout()); let mut scan = Scanner::new(stdin.lock()); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! input { ($T: ty) => { scan.token::<$T>() }; ($T: ty, $N: expr) => { (0..$N).map(|_| scan.token::<$T>()).collect::<Vec<_>>() }; } let N = input!(usize); let mut A = input!(String, N); A.sort(); let mut X = MInt998244353::new(); for a in A { let n: usize = a.parse().unwrap(); let p = MInt998244353::from_raw(10).pow(a.len() as u64); X *= p; X += n.into(); } writeln!(out, "{}", X); } pub type MInt998244353 = ModInt<998244353>; pub type MInt1000000007 = ModInt<1_000_000_007>; #[derive(Clone, Copy, Eq, PartialEq, Debug)] pub struct ModInt<const P: u32> { value: u32, } impl<const P: u32> ModInt<P> { pub fn value(&self) -> u32 { assert!(self.value < P); return self.value; } pub fn new() -> Self { return Self { value: 0 }; } pub fn from_raw(x: u32) -> Self { return Self { value: x }; } pub fn inv(&self) -> Self { pub fn ext_gcd(a: isize, b: isize) -> (isize, isize) { let mut a_k = a; let mut b_k = b; let mut q_k = a_k / b_k; let mut r_k = a_k % b_k; let mut x_k = 0; let mut y_k = 1; let mut z_k = 1; let mut w_k = -q_k; a_k = b_k; b_k = r_k; while r_k != 0 { q_k = a_k / b_k; r_k = a_k % b_k; a_k = b_k; b_k = r_k; let nx = z_k; let ny = w_k; let nz = x_k - q_k * z_k; let nw = y_k - q_k * w_k; x_k = nx; y_k = ny; z_k = nz; w_k = nw; } (x_k, y_k) } let val = self.value() as isize; let ret = ext_gcd(val, P as isize).0; return Self::from(ret); } pub fn pow(&self, mut x: u64) -> Self { let mut ret = ModInt::from_raw(1); let mut a = self.clone(); while x > 0 { if (x & 1) == 1 { ret = ret * a; } a *= a; x >>= 1; } return ret; } } impl<const P: u32> std::ops::Add for ModInt<P> { type Output = Self; fn add(self, rhs: Self) -> Self::Output { let mut ret = self.value() + rhs.value(); if ret >= P { ret -= P; } return Self::from_raw(ret); } } impl<const P: u32> std::ops::AddAssign for ModInt<P> { fn add_assign(&mut self, rhs: Self) { self.value = (self.clone() + rhs).value(); } } impl<const P: u32> std::ops::Sub for ModInt<P> { type Output = Self; fn sub(self, rhs: Self) -> Self::Output { if self.value() >= rhs.value() { return Self::from_raw(self.value() - rhs.value()); } else { return Self::from_raw(P + self.value() - rhs.value()); } } } impl<const P: u32> std::ops::SubAssign for ModInt<P> { fn sub_assign(&mut self, rhs: Self) { self.value = (self.clone() - rhs).value(); } } impl<const P: u32> std::ops::Mul for ModInt<P> { type Output = Self; fn mul(self, rhs: Self) -> Self::Output { let ret = self.value() as usize * rhs.value() as usize; return Self::from(ret); } } impl<const P: u32> std::ops::MulAssign for ModInt<P> { fn mul_assign(&mut self, rhs: Self) { self.value = (self.clone() * rhs).value(); } } impl<const P: u32> std::ops::Div for ModInt<P> { type Output = Self; fn div(self, rhs: Self) -> Self::Output { self * rhs.inv() } } impl<const P: u32> std::ops::DivAssign for ModInt<P> { fn div_assign(&mut self, rhs: Self) { self.value = (self.clone() / rhs).value(); } } impl<const P: u32> std::ops::Neg for ModInt<P> { type Output = Self; fn neg(self) -> Self::Output { let value = self.value(); return Self { value: P - value }; } } macro_rules! int_from_impl { ($($t: ty), *) => { $( #[allow(unused_comparisons)] impl<const P: u32> From<$t> for ModInt<P> { fn from(value: $t) -> Self { if value >= 0 { Self { value: (value % P as $t) as u32, } } else { let rem = P as $t + value % P as $t; Self { value: rem as u32 } } } } ) * }; } int_from_impl!(usize, isize, u64, i64, u32, i32, u128, i128); impl<const P: u32> Default for ModInt<P> { fn default() -> Self { Self { value: 0 } } } impl<const P: u32> std::fmt::Display for ModInt<P> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { write!(f, "{}", self.value) } } struct Scanner<R> { reader: R, buf_str: Vec<u8>, buf_iter: str::SplitWhitespace<'static>, } impl<R: BufRead> Scanner<R> { fn new(reader: R) -> Self { Self { reader, buf_str: vec![], buf_iter: "".split_whitespace(), } } fn token<T: str::FromStr>(&mut self) -> T { loop { if let Some(token) = self.buf_iter.next() { return token.parse().ok().expect("Failed parse"); } self.buf_str.clear(); self.reader .read_until(b'\n', &mut self.buf_str) .expect("Failed read"); self.buf_iter = unsafe { let slice = str::from_utf8_unchecked(&self.buf_str); std::mem::transmute(slice.split_whitespace()) } } } }