#770261 (Rust) No.1972 Modulo Set

• 問題: No.1972 Modulo Set
• ユーザー: bqn
• 提出日時: 2022-06-11 12:30:24
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 45 ms / 2,000 ms
• コード長: 6,537 bytes
• コンパイル時間: 11,993 ms
• コンパイル使用メモリ: 391,020 KB
• 実行使用メモリ: 15,892 KB
• 最終ジャッジ日時: 2024-10-05 01:43:52
• 合計ジャッジ時間: 14,150 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	0 ms; 6,816 KB
testcase_02	AC	1 ms; 6,820 KB
testcase_03	AC	4 ms; 6,816 KB
testcase_04	AC	5 ms; 6,816 KB
testcase_05	AC	5 ms; 6,816 KB
testcase_06	AC	9 ms; 6,816 KB
testcase_07	AC	13 ms; 6,820 KB
testcase_08	AC	6 ms; 6,820 KB
testcase_09	AC	1 ms; 6,820 KB
testcase_10	AC	5 ms; 6,820 KB
testcase_11	AC	13 ms; 6,816 KB
testcase_12	AC	3 ms; 6,820 KB
testcase_13	AC	2 ms; 6,820 KB
testcase_14	AC	3 ms; 6,820 KB
testcase_15	AC	19 ms; 7,276 KB
testcase_16	AC	21 ms; 7,760 KB
testcase_17	AC	7 ms; 6,820 KB
testcase_18	AC	1 ms; 6,820 KB
testcase_19	AC	18 ms; 7,360 KB
testcase_20	AC	23 ms; 9,016 KB
testcase_21	AC	9 ms; 6,816 KB
testcase_22	AC	17 ms; 7,160 KB
testcase_23	AC	40 ms; 15,220 KB
testcase_24	AC	17 ms; 8,076 KB
testcase_25	AC	23 ms; 9,024 KB
testcase_26	AC	23 ms; 8,072 KB
testcase_27	AC	40 ms; 15,292 KB
testcase_28	AC	17 ms; 8,072 KB
testcase_29	AC	23 ms; 8,968 KB
testcase_30	AC	35 ms; 14,360 KB
testcase_31	AC	2 ms; 6,816 KB
testcase_32	AC	32 ms; 14,096 KB
testcase_33	AC	44 ms; 15,888 KB
testcase_34	AC	43 ms; 15,892 KB
testcase_35	AC	45 ms; 15,892 KB
testcase_36	AC	45 ms; 15,892 KB

コンパイルメッセージ

warning: unused macro definition: `input_inner`
  --> src/main.rs:89:14
   |
89 | macro_rules! input_inner {
   |              ^^^^^^^^^^^
   |
   = note: `#[warn(unused_macros)]` on by default

warning: unused macro definition: `mydbg`
   --> src/main.rs:142:14
    |
142 | macro_rules! mydbg {
    |              ^^^^^

ソースコード

#![allow(unused_parens)]
#![allow(unused_imports)]
#![allow(non_upper_case_globals)]
#![allow(non_snake_case)]
#![allow(unused_mut)]
#![allow(unused_variables)]
#![allow(dead_code)]

type Vec2<T> = Vec<Vec<T>>;
type Vec3<T> = Vec<Vec<Vec<T>>>;

#[allow(unused_macros)]
macro_rules! invec {
    ( $ t : ty ) => {{
        let mut s = String::new();
        match std::io::stdin().read_line(&mut s) {
            Ok(0) => Vec::<$t>::new(),
            Ok(n) => s
                .trim()
                .split_whitespace()
                .map(|s| s.parse::<$t>().unwrap())
                .collect::<Vec<$t>>(),
            Err(_) => Vec::<$t>::new(),
        }
    }};
}

#[allow(unused_macros)]
macro_rules! get {
      ($t:ty) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.trim().parse::<$t>().unwrap()
          }
      };
      ($($t:ty),*) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              let mut iter = line.split_whitespace();
              (
                  $(iter.next().unwrap().parse::<$t>().unwrap(),)*
              )
          }
      };
      ($t:ty; $n:expr) => {
          (0..$n).map(|_|
              get!($t)
          ).collect::<Vec<_>>()
      };
      ($($t:ty),*; $n:expr) => {
          (0..$n).map(|_|
              get!($($t),*)
          ).collect::<Vec<_>>()
      };
      ($t:ty ;;) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.split_whitespace()
                  .map(|t| t.parse::<$t>().unwrap())
                  .collect::<Vec<_>>()
          }
      };
      ($t:ty ;; $n:expr) => {
          (0..$n).map(|_| get!($t ;;)).collect::<Vec<_>>()
      };
}

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [$t:tt]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
#[cfg(debug_assertions)]
macro_rules! mydbg {
    //($arg:expr) => (dbg!($arg))
    //($arg:expr) => (println!("{:?}",$arg));
      ($($a:expr),*) => {
          eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
      }
}
#[cfg(not(debug_assertions))]
macro_rules! mydbg {
    ($($arg:expr),*) => {};
}

macro_rules! echo {
    ($($a:expr),*) => {
          $(println!("{}",$a))*
      }
}

use std::cmp::*;
use std::collections::*;
use std::ops::{Add, Div, Mul, Rem, Sub};

trait SafeRangeContain {
    fn safe_contains(&self, x: i64) -> bool;
}

impl SafeRangeContain for std::ops::Range<usize> {
    fn safe_contains(&self, x: i64) -> bool {
        if x < 0 {
            return false;
        }
        return self.contains(&(x as usize));
    }
}

#[allow(dead_code)]
static INF_I64: i64 = i64::max_value() / 2;
#[allow(dead_code)]
static INF_I32: i32 = i32::max_value() / 2;
#[allow(dead_code)]
static INF_USIZE: usize = usize::max_value() / 2;
#[allow(dead_code)]
static M_O_D: usize = 1000000007;
#[allow(dead_code)]
static PAI: f64 = 3.1415926535897932;

trait IteratorExt: Iterator {
    fn toVec(self) -> Vec<Self::Item>;
}

impl<T: Iterator> IteratorExt for T {
    fn toVec(self) -> Vec<Self::Item> {
        self.collect()
    }
}

trait CharExt {
    fn toNum(&self) -> usize;
    fn toAlphabetIndex(&self) -> usize;
    fn toNumIndex(&self) -> usize;
}
impl CharExt for char {
    fn toNum(&self) -> usize {
        return *self as usize;
    }
    fn toAlphabetIndex(&self) -> usize {
        return self.toNum() - 'a' as usize;
    }
    fn toNumIndex(&self) -> usize {
        return self.toNum() - '0' as usize;
    }
}

trait VectorExt {
    fn joinToString(&self, s: &str) -> String;
}
impl<T: ToString> VectorExt for Vec<T> {
    fn joinToString(&self, s: &str) -> String {
        return self
            .iter()
            .map(|x| x.to_string())
            .collect::<Vec<_>>()
            .join(s);
    }
}

trait StringExt {
    fn get_reverse(&self) -> String;
}
impl StringExt for String {
    fn get_reverse(&self) -> String {
        self.chars().rev().collect::<String>()
    }
}

trait UsizeExt {
    fn pow(&self, n: usize) -> usize;
}
impl UsizeExt for usize {
    fn pow(&self, n: usize) -> usize {
        return ((*self as u64).pow(n as u32)) as usize;
    }
}

fn main() {
    solve();
}

fn solve() {
    let mut ans = 0;
    let (N, M) = get!(usize, usize);
    let A = invec!(usize).iter().map(|x| x % M).toVec();

    let mut h = HashMap::new();
    for i in 0..N {
        h.entry(A[i]).or_insert(vec![]).push(i);
    }
    let mut used = HashSet::new();
    for (k, d) in &h {
        let k2 = (M - k) % M;

        let u = d[0];
        if *k == k2 {
            ans += 1;
            continue;
        }

        if used.contains(k) || used.contains(&k2) {
            continue;
        }
        used.insert(*k);
        used.insert(k2);
        if let Some(d2) = h.get(&k2) {
            ans += max(d.len(), d2.len());
        } else {
            ans += d.len();
        }
    }

    echo!(ans);
}