結果

問題 No.1972 Modulo Set
ユーザー Moss_LocalMoss_Local
提出日時 2022-06-10 23:29:10
言語 Rust
(1.72.1)
結果
AC  
実行時間 40 ms / 2,000 ms
コード長 5,811 bytes
コンパイル時間 4,616 ms
コンパイル使用メモリ 165,044 KB
実行使用メモリ 5,584 KB
最終ジャッジ日時 2023-07-27 22:27:18
合計ジャッジ時間 4,702 ms
ジャッジサーバーID
(参考情報)
judge12 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 5 ms
4,380 KB
testcase_04 AC 7 ms
4,376 KB
testcase_05 AC 8 ms
4,376 KB
testcase_06 AC 12 ms
4,380 KB
testcase_07 AC 18 ms
4,384 KB
testcase_08 AC 8 ms
4,380 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 7 ms
4,376 KB
testcase_11 AC 17 ms
4,376 KB
testcase_12 AC 3 ms
4,380 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 21 ms
4,376 KB
testcase_16 AC 24 ms
4,380 KB
testcase_17 AC 8 ms
4,380 KB
testcase_18 AC 1 ms
4,380 KB
testcase_19 AC 18 ms
4,380 KB
testcase_20 AC 24 ms
4,380 KB
testcase_21 AC 10 ms
4,376 KB
testcase_22 AC 17 ms
4,380 KB
testcase_23 AC 36 ms
4,988 KB
testcase_24 AC 13 ms
4,376 KB
testcase_25 AC 20 ms
4,376 KB
testcase_26 AC 27 ms
4,456 KB
testcase_27 AC 36 ms
5,200 KB
testcase_28 AC 13 ms
4,376 KB
testcase_29 AC 20 ms
4,380 KB
testcase_30 AC 26 ms
4,376 KB
testcase_31 AC 2 ms
4,376 KB
testcase_32 AC 24 ms
4,440 KB
testcase_33 AC 40 ms
5,584 KB
testcase_34 AC 40 ms
5,572 KB
testcase_35 AC 39 ms
5,492 KB
testcase_36 AC 40 ms
5,516 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around type
  --> Main.rs:74:15
   |
74 | fn readi() -> (i64) {
   |               ^   ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
74 - fn readi() -> (i64) {
74 + fn readi() -> i64 {
   |

warning: use of deprecated function `std::intrinsics::drop_in_place`: no longer an intrinsic - use `ptr::drop_in_place` directly
  --> Main.rs:17:22
   |
17 | use std::intrinsics::drop_in_place;
   |                      ^^^^^^^^^^^^^
   |
   = note: `#[warn(deprecated)]` on by default

warning: unused variable: `k`
   --> Main.rs:214:10
    |
214 |     for (k, v) in bt2 {
    |          ^ help: if this is intentional, prefix it with an underscore: `_k`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
   --> Main.rs:188:9
    |
188 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: 4 warnings emitted

ソースコード

diff #

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::any::Any;
use std::cmp::Ordering::*;
use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::error::Error;
use std::f64::consts::PI;
use std::fmt::Debug;
use std::fmt::Display;
use std::fs::File;
use std::hash::Hash;
use std::intrinsics::drop_in_place;
use std::io::prelude::*;
use std::io::*;
use std::iter::Filter;
use std::marker::Copy;
use std::mem::*;
use std::ops::Bound::*;
use std::ops::RangeBounds;
use std::ops::{Add, Mul, Neg, Sub};
use std::process;
use std::slice::from_raw_parts;
use std::str;
use std::vec;

const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
// const FINF: f64 = 122337203685.0;
const LINF: i64 = 2147483647;
const FINF: f64 = LINF as f64;
const INF128: i128 = 1223372036854775807000000000000;
// const MOD: i64 = 1000000007;
const MOD: i64 = 998244353;
const UMOD: usize = MOD as usize;

const MPI: f64 = 3.14159265358979323846264338327950288f64;
// const MOD: i64 = INF;

use std::cmp::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        println!("{}", $x);
    };
}
macro_rules! d {
    ($x:expr) => {
        println!("{:?}", $x);
    };
}

fn main() {
    solve();
}

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn readi() -> (i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    iter.next().unwrap().parse::<i64>().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn solve() {
    let (n, m) = readuu();
    let mut bt1 = BTreeMap::new();
    let mut bt2 = BTreeMap::new();
    let mut btm = BTreeMap::new();
    let mut btm2 = BTreeMap::new();
    let mut vec: Vec<usize> = read_vec();
    let mut res = 0;
    for i in 0..n {
        let p = vec[i] % m;
        if p == 0 {
            *btm2.entry(p).or_insert(0) += 1;
        } else if m % 2 == 0 && p == m / 2 {
            *btm.entry(p).or_insert(0) += 1;
        } else if p <= m / 2 {
            *bt1.entry(p).or_insert(0) += 1;
        } else {
            *bt2.entry(p).or_insert(0) += 1;
        }
    }
    if btm.len() > 0 {
        res += 1;
    }
    if btm2.len() > 0 {
        res += 1;
    }
    // d!((bt1.clone(), bt2.clone(), btm.clone()));
    for (k, v) in bt1 {
        let v2 = *bt2.get(&(m - k)).unwrap_or(&0);
        bt2.insert(m - k, 0);
        res += min(UINF, max(v, v2));
    }
    for (k, v) in bt2 {
        let v2 = 0;
        res += max(v, v2);
    }
    p!(res);
    return;
}
0