結果
| 問題 | No.990 N×Mマス計算（Kの倍数） |
| ユーザー |
 ziita
|
| 提出日時 | 2020-02-14 23:02:17 |
| 言語 | Rust (1.77.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 5,666 bytes |
| コンパイル時間 | 13,700 ms |
| コンパイル使用メモリ | 390,764 KB |
| 実行使用メモリ | 15,672 KB |
| 最終ジャッジ日時 | 2024-04-27 20:07:44 |
| 合計ジャッジ時間 | 20,668 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | -- | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
ソースコード
#![allow(unused_imports)]
#![allow(non_snake_case, unused)]
use std::cmp::*;
use std::collections::*;
use std::ops::*;
macro_rules! eprint {
($($t:tt)*) => {{
use ::std::io::Write;
let _ = write!(::std::io::stderr(), $($t)*);
}};
}
macro_rules! eprintln {
() => { eprintln!(""); };
($($t:tt)*) => {{
use ::std::io::Write;
let _ = writeln!(::std::io::stderr(), $($t)*);
}};
}
macro_rules! dbg {
($v:expr) => {{
let val = $v;
eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
val
}}
}
macro_rules! mat {
($($e:expr),*) => { Vec::from(vec![$($e),*]) };
($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}
macro_rules! ok {
($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
$a$([$i])*.$f($($t),*)
};
($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
let t = $e;
ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
} };
}
pub fn readln() -> String {
let mut line = String::new();
::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
line
}
macro_rules! read {
($($t:tt),*; $n:expr) => {{
let stdin = ::std::io::stdin();
let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
let line = line.unwrap();
let mut it = line.split_whitespace();
_read!(it; $($t),*)
}).collect::<Vec<_>>();
ret
}};
($($t:tt),*) => {{
let line = readln();
let mut it = line.split_whitespace();
_read!(it; $($t),*)
}};
}
macro_rules! _read {
($it:ident; [char]) => {
_read!($it; String).chars().collect::<Vec<_>>()
};
($it:ident; [u8]) => {
Vec::from(_read!($it; String).into_bytes())
};
($it:ident; usize1) => {
$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
};
($it:ident; [usize1]) => {
$it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
};
($it:ident; [$t:ty]) => {
$it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
};
($it:ident; $t:ty) => {
$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
};
($it:ident; $($t:tt),+) => {
($(_read!($it; $t)),*)
};
}
pub fn main() {
let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}
const MOD: u32 = 1_000_000_007;
const INF: usize = std::usize::MAX/2;
pub trait SetMinMax {
fn setmin(&mut self, v: Self) -> bool;
fn setmax(&mut self, v: Self) -> bool;
}
impl<T> SetMinMax for T where T: PartialOrd {
fn setmin(&mut self, v: T) -> bool {
*self > v && { *self = v; true }
}
fn setmax(&mut self, v: T) -> bool {
*self < v && { *self = v; true }
}
}
// https://github.com/hatoo/competitive-rust-snippets/blob/master/src/binary_search.rs
use std::cmp::Ordering;
/// Equivalent to std::lowerbound and std::upperbound in c++
pub trait BinarySearch<T> {
fn lower_bound(&self, x: &T) -> usize;
fn upper_bound(&self, x: &T) -> usize;
}
impl<T: Ord> BinarySearch<T> for [T] {
// 配列a内のv以上の最小のindex
fn lower_bound(&self, x: &T) -> usize {
let mut low = 0;
let mut high = self.len();
while low != high {
let mid = (low + high) / 2;
match self[mid].cmp(x) {
Ordering::Less => {
low = mid + 1;
}
Ordering::Equal | Ordering::Greater => {
high = mid;
}
}
}
low
}
// 配列a内のvより大きいの最小のindex
fn upper_bound(&self, x: &T) -> usize {
let mut low = 0;
let mut high = self.len();
while low != high {
let mid = (low + high) / 2;
match self[mid].cmp(x) {
Ordering::Less | Ordering::Equal => {
low = mid + 1;
}
Ordering::Greater => {
high = mid;
}
}
}
low
}
}
fn gcd(a: i64, b: i64) -> i64{
if a < b {return gcd(b,a);}
if b==0 {return a;}
return gcd(b, a%b);
}
fn lcm(a: i64, b: i64) -> i64{
return a * (b /gcd(a, b));
}
fn solve() {
let (n,m,k) = read!(usize, usize,i64);
let (op,mut b) = read!(String,[i64]);
let a = read!(i64;n);
let mut ans = 0;
if op=="+"{
let mut ah = HashMap::new();
let mut bh = HashMap::new();
for i in 0..n {
let key = a[i] % k;
let mut val = 1;
if let Some(v) = ah.get(&key) {
val += v;
}
ah.insert(key, val);
}
for i in 0..m {
let key = b[i] % k;
let mut val = 1;
if let Some(v) = bh.get(&key) {
val += v;
}
bh.insert(key, val);
}
{
for (key,val) in ah.iter() {
let target = k - key;
if let Some(bval) = bh.get(&target) {
ans += val * bval;
}
}
println!("{}", ans);
loop{
}
return;
}
}
let mut div = vec![];
for i in 1..100000 {
if i*i>k {break;}
if k%i==0 {
div.push(i);
if i!=k/i {div.push(k/i);}
// println!("{} {}", i, k/i);
}
}
// println!("{}", div.len());
let mut idx = HashMap::new();
let mut book = vec![0;div.len()];
for i in 0..div.len() {
idx.insert(div[i],i);
}
for i in 0..m {
for &j in &div {
if b[i]%j==0 {
let id = idx.get(&j).unwrap();
book[*id] += 1;
}
}
}
let mut ans = 0;
for i in 0..n {
let g = gcd(a[i],k);
let z = k / g;
let id = idx.get(&z).unwrap();
ans += book[*id as usize];
}
println!("{}", ans);
}
fn run() {
solve();
}