結果
問題 | No.983 Convolution |
ユーザー | cotton_fn_ |
提出日時 | 2020-05-01 01:41:47 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 55 ms / 2,000 ms |
コード長 | 5,037 bytes |
コンパイル時間 | 14,413 ms |
コンパイル使用メモリ | 399,060 KB |
実行使用メモリ | 12,032 KB |
最終ジャッジ日時 | 2024-06-01 06:22:00 |
合計ジャッジ時間 | 16,902 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,816 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 30 ms
6,944 KB |
testcase_04 | AC | 28 ms
7,040 KB |
testcase_05 | AC | 27 ms
6,944 KB |
testcase_06 | AC | 51 ms
11,264 KB |
testcase_07 | AC | 49 ms
11,136 KB |
testcase_08 | AC | 8 ms
6,940 KB |
testcase_09 | AC | 12 ms
6,948 KB |
testcase_10 | AC | 4 ms
6,944 KB |
testcase_11 | AC | 8 ms
6,944 KB |
testcase_12 | AC | 50 ms
10,880 KB |
testcase_13 | AC | 13 ms
6,944 KB |
testcase_14 | AC | 14 ms
6,940 KB |
testcase_15 | AC | 27 ms
6,944 KB |
testcase_16 | AC | 25 ms
6,940 KB |
testcase_17 | AC | 47 ms
11,008 KB |
testcase_18 | AC | 7 ms
6,940 KB |
testcase_19 | AC | 25 ms
6,940 KB |
testcase_20 | AC | 49 ms
11,264 KB |
testcase_21 | AC | 28 ms
7,168 KB |
testcase_22 | AC | 7 ms
6,940 KB |
testcase_23 | AC | 20 ms
6,944 KB |
testcase_24 | AC | 5 ms
6,940 KB |
testcase_25 | AC | 5 ms
6,940 KB |
testcase_26 | AC | 19 ms
6,940 KB |
testcase_27 | AC | 11 ms
6,940 KB |
testcase_28 | AC | 28 ms
7,040 KB |
testcase_29 | AC | 55 ms
12,032 KB |
testcase_30 | AC | 28 ms
7,040 KB |
testcase_31 | AC | 15 ms
6,940 KB |
testcase_32 | AC | 29 ms
7,168 KB |
testcase_33 | AC | 2 ms
6,940 KB |
testcase_34 | AC | 1 ms
6,940 KB |
testcase_35 | AC | 1 ms
6,944 KB |
ソースコード
#![allow(unused_imports, unused_macros)] use kyoproio::*; use std::{ collections::*, io::{self, prelude::*}, iter, mem::{replace, swap}, }; fn main() -> io::Result<()> { std::thread::Builder::new() .stack_size(64 * 1024 * 1024) .spawn(solve)? .join() .unwrap(); Ok(()) } fn solve() { let stdin = io::stdin(); let mut kin = KInput::new(stdin.lock()); let stdout = io::stdout(); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; } macro_rules! outputln { ($($args:expr),+) => { output!($($args),+); outputln!(); }; () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } } } let n: usize = kin.input(); let mut a: Vec<i128> = kin.seq(n); let n = n.next_power_of_two(); a.resize(n, 0); let mut inf = vec![0i64; n]; let mut cnt = vec![1i64; n]; for (i, v) in a.iter_mut().enumerate() { if *v == -1 { *v = 0; inf[i] = 1; } } for t in (0..).map(|i| 1 << i).take_while(|&t| t < n) { for s in 0..n { if s & t == 0 { a[s] += a[s | t]; inf[s] += inf[s | t]; cnt[s] += cnt[s | t]; } } } for i in 0..n { a[i] *= a[i]; inf[i] = cnt[i] * cnt[i] - (cnt[i] - inf[i]) * (cnt[i] - inf[i]); } for t in (0..).map(|i| 1 << i).take_while(|&t| t < n) { for s in 0..n { if s & t == 0 { a[s] -= a[s | t]; inf[s] -= inf[s | t]; } } } let mut ans = 0; for s in 0..n { // if inf[s] == 0 { ans = gcd(ans, a[s]); // } } if ans == 0 { ans = -1; } outputln!("{}", ans); } fn gcd(mut x: i128, mut y: i128) -> i128 { assert!(x >= 0); assert!(y >= 0); while y != 0 { x %= y; swap(&mut x, &mut y); } x } // ----------------------------------------------------------------------------- pub mod kyoproio { use std::io::prelude::*; pub trait Input { fn str(&mut self) -> &str; fn input<T: InputParse>(&mut self) -> T { T::input(self) } fn iter<T: InputParse>(&mut self) -> Iter<T, Self> { Iter(self, std::marker::PhantomData) } fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B { self.iter().take(n).collect() } } pub struct KInput<R> { src: R, buf: String, pos: usize, } impl<R: BufRead> KInput<R> { pub fn new(src: R) -> Self { Self { src, buf: String::with_capacity(1024), pos: 0, } } } impl<R: BufRead> Input for KInput<R> { fn str(&mut self) -> &str { loop { if self.pos >= self.buf.len() { self.pos = 0; self.buf.clear(); if self.src.read_line(&mut self.buf).expect("io error") == 0 { return &self.buf; } } let range = self.pos ..self.buf[self.pos..] .find(|c: char| c.is_ascii_whitespace()) .map(|i| i + self.pos) .unwrap_or_else(|| self.buf.len()); self.pos = range.end + 1; if range.end > range.start { return &self.buf[range]; } } } } pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>); impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> { type Item = T; fn next(&mut self) -> Option<T> { Some(self.0.input()) } } pub trait InputParse: Sized { fn input<I: Input + ?Sized>(src: &mut I) -> Self; } impl InputParse for Vec<u8> { fn input<I: Input + ?Sized>(src: &mut I) -> Self { src.str().as_bytes().to_owned() } } macro_rules! from_str_impl { { $($T:ty)* } => { $(impl InputParse for $T { fn input<I: Input + ?Sized>(src: &mut I) -> Self { src.str().parse::<$T>().expect("parse error") } })* } } from_str_impl! { String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128 } macro_rules! tuple_impl { ($H:ident $($T:ident)*) => { impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) { fn input<I: Input + ?Sized>(src: &mut I) -> Self { ($H::input(src), $($T::input(src)),*) } } tuple_impl!($($T)*); }; () => {} } tuple_impl!(A B C D E F G); }