結果

問題 No.1884 Sequence
ユーザー Moss_LocalMoss_Local
提出日時 2022-03-25 21:33:37
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 117 ms / 2,000 ms
コード長 6,005 bytes
コンパイル時間 12,965 ms
コンパイル使用メモリ 403,336 KB
実行使用メモリ 9,892 KB
最終ジャッジ日時 2024-10-14 05:26:48
合計ジャッジ時間 16,280 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 AC 1 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 1 ms
5,248 KB
testcase_08 AC 1 ms
5,248 KB
testcase_09 AC 1 ms
5,248 KB
testcase_10 AC 103 ms
8,868 KB
testcase_11 AC 101 ms
8,868 KB
testcase_12 AC 7 ms
5,248 KB
testcase_13 AC 8 ms
5,248 KB
testcase_14 AC 11 ms
5,248 KB
testcase_15 AC 62 ms
7,840 KB
testcase_16 AC 116 ms
9,892 KB
testcase_17 AC 34 ms
7,656 KB
testcase_18 AC 32 ms
7,712 KB
testcase_19 AC 42 ms
8,252 KB
testcase_20 AC 45 ms
6,560 KB
testcase_21 AC 29 ms
6,296 KB
testcase_22 AC 49 ms
6,564 KB
testcase_23 AC 117 ms
9,764 KB
testcase_24 AC 116 ms
9,764 KB
testcase_25 AC 99 ms
8,868 KB
testcase_26 AC 99 ms
8,868 KB
testcase_27 AC 6 ms
5,248 KB
testcase_28 AC 6 ms
5,248 KB
testcase_29 AC 8 ms
5,664 KB
testcase_30 AC 8 ms
5,660 KB
testcase_31 AC 44 ms
5,784 KB
testcase_32 AC 95 ms
8,736 KB
testcase_33 AC 20 ms
8,064 KB
testcase_34 AC 22 ms
8,192 KB
testcase_35 AC 7 ms
5,248 KB
testcase_36 AC 17 ms
6,272 KB
testcase_37 AC 23 ms
8,192 KB
testcase_38 AC 20 ms
7,296 KB
testcase_39 AC 11 ms
5,248 KB
testcase_40 AC 11 ms
5,544 KB
testcase_41 AC 79 ms
8,224 KB
testcase_42 AC 90 ms
9,256 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around type
  --> src/main.rs:75:15
   |
75 | fn readi() -> (i64) {
   |               ^   ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
75 - fn readi() -> (i64) {
75 + fn readi() -> i64 {
   |

warning: unused variable: `i`
   --> src/main.rs:228:9
    |
228 |     for i in 0..n {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`
    |
    = note: `#[warn(unused_variables)]` on by default

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

ソースコード

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::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 MPI: f64 = 3.14159265358979323846264338327950288f64;
// const MOD: i64 = INF;

const UMOD: usize = MOD as usize;
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);
    };
}

// use str::Chars;

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 gcd(a: i64, b: i64) -> i64 {
    if b == 0 {
        a
    } else {
        gcd(b, a % b)
    }
}
fn solve() {
    let n: usize = read();
    let mut vec: Vec<usize> = read_vec();
    let mut v = vec![];
    let mut cnt = 0;
    let mut st = BTreeSet::new();
    let mut mult = false;
    for i in 0..n {
        if vec[i] == 0 {
            cnt += 1;
        } else {
            v.push(vec[i]);
            if st.contains(&vec[i]) {
                mult = true;
            }
            st.insert(vec[i]);
        }
    }
    v.sort();
    if v.len() == 0 || v.len() == 1 {
        p!("Yes");
        return;
    }
    let mut mi = 0;
    for i in 0..v.len() - 1 {
        mi = gcd(mi, (v[i + 1] - v[i]) as i64);
    }
    if st.len() == 1 {
        p!("Yes");
        return;
    }
    if mult {
        p!("No");
        return;
    }
    let mut x = v[0];
    let mut d = vec![];

    for i in 0..n {
        if st.contains(&x) {
            //nop
        } else {
            if cnt == 0 {
                // d!((v, x, mi));
                p!("No");
                return;
            }
            cnt -= 1;
        }
        d.push(x);
        x += mi as usize;
    }
    p!("Yes");

    return;
}
0