結果
| 問題 | No.1860 Magnets |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2022-03-04 21:26:25 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 1 ms / 2,000 ms |
| コード長 | 15,216 bytes |
| コンパイル時間 | 10,794 ms |
| コンパイル使用メモリ | 378,760 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-07-18 19:14:19 |
| 合計ジャッジ時間 | 11,772 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 28 |
コンパイルメッセージ
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: unnecessary parentheses around assigned value
--> src/main.rs:283:19
|
283 | self.0 *= (rhs.0 % MOD);
| ^ ^
|
help: remove these parentheses
|
283 - self.0 *= (rhs.0 % MOD);
283 + self.0 *= rhs.0 % MOD;
|
warning: unnecessary parentheses around match arm expression
--> src/main.rs:577:46
|
577 | std::ops::Bound::Included(&x) => (x + 1),
| ^ ^
|
help: remove these parentheses
|
577 - std::ops::Bound::Included(&x) => (x + 1),
577 + std::ops::Bound::Included(&x) => x + 1,
|
warning: unused variable: `a2`
--> src/main.rs:434:18
|
434 | let (a2, e2) = self.mod_fact(k, p);
| ^^ help: if this is intentional, prefix it with an underscore: `_a2`
|
= note: `#[warn(unused_variables)]` on by default
warning: unused variable: `moi`
--> src/main.rs:439:21
|
439 | let moi = self.mod_inverse(a3 % p, p);
| ^^^ help: if this is intentional, prefix it with an underscore: `_moi`
warning: unused variable: `a2`
--> src/main.rs:459:18
|
459 | let (a2, e2) = self.mod_fact(k, p);
| ^^ help: if this is intentional, prefix it with an underscore: `_a2`
warning: unused variable: `a3`
--> src/main.rs:460:18
|
460 | let (a3, e3) = self.mod_fact(n - k, p);
| ^^ help: if this is intentional, prefix it with an underscore: `_a3`
warning: value assigned to `d` is never read
--> src/main.rs:628:13
|
628 | let mut d = 0;
| ^
|
= help
ソースコード
// -*- 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(),)}macro_rules! M {(a :expr ) => {M::new({ a })};}#[derive(Copy, Clone, Debug)]pub struct M(i64);impl M {fn new(x: i64) -> Self {M(x.rem_euclid(MOD))}fn pow(self, n: usize) -> Self {match n {0 => M::new(1),_ => {let mut a = self.pow(n >> 1);a *= a;if n & 1 == 1 {a *= self;}a}}}fn inv(self) -> Self {self.pow((MOD - 2) as usize)}}impl std::ops::Neg for M {type Output = M;fn neg(self) -> Self::Output {Self::new(-self.0)}}impl std::ops::AddAssign<M> for M {fn add_assign(&mut self, rhs: Self) {self.0 += rhs.0;self.0 %= MOD;}}impl std::ops::AddAssign<i64> for M {fn add_assign(&mut self, rhs: i64) {*self += M::new(rhs);}}impl std::ops::AddAssign<usize> for M {fn add_assign(&mut self, rhs: usize) {*self += M::new(rhs as i64);}}impl<T> std::ops::Add<T> for MwhereM: std::ops::AddAssign<T>,{type Output = Self;fn add(self, other: T) -> Self {let mut res = self;res += other;res}}impl std::ops::SubAssign<M> for M {fn sub_assign(&mut self, rhs: Self) {self.0 -= rhs.0;if self.0 < 0 {self.0 += MOD;}}}impl std::ops::SubAssign<i64> for M {fn sub_assign(&mut self, rhs: i64) {*self -= M::new(rhs);if (*self).0 < 0 {self.0 += MOD;}}}impl std::ops::SubAssign<usize> for M {fn sub_assign(&mut self, rhs: usize) {*self -= M::new(rhs as i64);if (*self).0 < 0 {self.0 += MOD;}}}impl<T> std::ops::Sub<T> for MwhereM: std::ops::SubAssign<T>,{type Output = Self;fn sub(self, other: T) -> Self {let mut res = self;res -= other;res}}impl std::ops::MulAssign<M> for M {fn mul_assign(&mut self, rhs: Self) {self.0 %= MOD;self.0 *= (rhs.0 % MOD);self.0 %= MOD;}}impl std::ops::MulAssign<i64> for M {fn mul_assign(&mut self, rhs: i64) {*self *= M::new(rhs);}}impl std::ops::MulAssign<usize> for M {fn mul_assign(&mut self, rhs: usize) {*self *= M::new(rhs as i64);}}impl<T> std::ops::Mul<T> for MwhereM: std::ops::MulAssign<T>,{type Output = Self;fn mul(self, other: T) -> Self {let mut res = self;res *= other;res}}impl std::ops::DivAssign<M> for M {fn div_assign(&mut self, rhs: Self) {*self *= rhs.inv();}}impl std::ops::DivAssign<i64> for M {fn div_assign(&mut self, rhs: i64) {*self /= M::new(rhs);}}impl std::ops::DivAssign<usize> for M {fn div_assign(&mut self, rhs: usize) {*self /= M::new(rhs as i64);}}impl<T> std::ops::Div<T> for MwhereM: std::ops::DivAssign<T>,{type Output = Self;fn div(self, other: T) -> Self {let mut res = self;res /= other;res}}impl std::fmt::Display for M {fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {write!(f, "{}", self.0)}}impl std::ops::Deref for M {type Target = i64;fn deref(&self) -> &Self::Target {&self.0}}impl std::ops::DerefMut for M {fn deref_mut(&mut self) -> &mut Self::Target {&mut self.0}}#[allow(dead_code)]pub fn gcd(a: usize, b: usize) -> usize {if b == 0 {a} else {gcd(b, a % b)}}#[allow(dead_code)]pub fn lcm(a: usize, b: usize) -> usize {a / gcd(a, b) * b}#[allow(dead_code)]/// (gcd, x, y)pub fn extgcd(a: i64, b: i64) -> (i64, i64, i64) {if b == 0 {(a, 1, 0)} else {let (gcd, x, y) = extgcd(b, a % b);(gcd, y, x - (a / b) * y)}}#[allow(dead_code)]/// x ^ n % mpub fn mod_pow(x: usize, n: usize, m: usize) -> usize {let mut res = 1;let mut x = x % m;let mut n = n;while n > 0 {if n & 1 == 1 {res = (res * x) % m;}x = (x * x) % m;n >>= 1;}res}pub struct Combination {m: usize,f_table: Vec<usize>,moi: Vec<usize>,}impl Combination {// 0 <= size <= 10^8 is constrained.pub fn new(mod_num: usize, table_size: usize) -> Self {Self {m: mod_num,f_table: vec![0; table_size],moi: vec![0; 0],}}pub fn build(&mut self) {let size = self.f_table.len();self.f_table = self.fact_table(size, self.m);self.moi = self.fact_inv_table(size, self.m);}fn fact_table(&mut self, len: usize, m: usize) -> Vec<usize> {let mut res = vec![1; len + 1];for i in 1..len + 1 {res[i] = (i as usize * res[i - 1]) % m;}res}fn fact_inv_table(&mut self, len: usize, m: usize) -> Vec<usize> {let mut res = vec![1; len + 1];for i in 1..len + 1 {res[i] = (res[i - 1] * self.mod_inverse(i, m)) % m;}res}pub fn p(&mut self, n: usize, k: usize) -> i64 {let p = MOD as usize;if k == 0 {return 1;}if n < k {0} else {let (a1, e1) = self.mod_fact(n, p);let (a2, e2) = self.mod_fact(k, p);let (a3, e3) = self.mod_fact(n - k, p);if e1 > e2 + e3 {0} else {let moi = self.mod_inverse(a3 % p, p);(a1 * self.mod_inverse(a3 % p, p) % p) as i64}}}pub fn c(&mut self, n: usize, k: usize) -> i64 {let p = MOD as usize;if n == 0 && k == 0 {return 1;}if n == 0 {return 0;}if k == 0 {return 1;}if n < k {0} else {let (a1, e1) = self.mod_fact(n, p);let (a2, e2) = self.mod_fact(k, p);let (a3, e3) = self.mod_fact(n - k, p);if e1 > e2 + e3 {0} else {(((a1 * &self.moi[k]) % p * &self.moi[n - k]) % p) as i64}}}pub fn h(&mut self, n: usize, k: usize) -> i64 {return self.c(n + k - 1, k);}pub fn factorial(&mut self, n: usize) -> i64 {return self.p(n, n);}fn extgcd(&mut self, a: i64, b: i64) -> (i64, i64, i64) {if b == 0 {(a, 1, 0)} else {let (gcd, x, y) = extgcd(b, a % b);(gcd, y, x - (a / b) * y)}}fn mod_inverse(&mut self, a: usize, m: usize) -> usize {let (_, x, _) = self.extgcd(a as i64, m as i64);((m as i64 + x) as usize % m) % m}fn mod_fact(&mut self, n: usize, p: usize) -> (usize, usize) {if n == 0 {(1, 0)} else {let (a, b) = self.mod_fact(n / p, p);let pow = b + n / p;if n / p % 2 != 0 {(a * (p - self.f_table[(n % p) as usize]) % p, pow)} else {(a * self.f_table[(n % p) as usize] % p, pow)}}}}fn vector_compression(vec: &mut Vec<i64>) -> Vec<i64> {let n = vec.len();let mut res = vec![0; n];let mut bt = BTreeMap::new();for i in 0..n {*bt.entry(vec[i]).or_insert(1) += 1;}let mut bt2 = BTreeMap::new();let mut cnt = 0;for i in bt {bt2.insert(i.0, cnt);cnt += 1;}for i in 0..n {// let mut xx: usize = vec[i];res[i] = *bt2.get(&(vec[i])).unwrap();}return res;}pub struct SEG<M: Monoid> {n: usize,buf: Vec<M::T>,}impl<M: Monoid> SEG<M> {#[allow(dead_code)]pub fn new(n: usize) -> SEG<M> {SEG {n,buf: vec![M::id(); 2 * n],}}#[allow(dead_code)]pub fn update(&mut self, k: usize, a: M::T) {let mut k = k + self.n;self.buf[k] = a;while k > 0 {k >>= 1;self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);}}#[allow(dead_code)]pub fn add(&mut self, k: usize, a: &M::T) {let mut k = k + self.n;self.buf[k] = M::op(&self.buf[k], a);while k > 0 {k >>= 1;self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);}}#[allow(dead_code)]pub fn get(&self, i: usize) -> M::T {self.query(i, i + 1)}#[allow(dead_code)]pub fn query_range<R: std::ops::RangeBounds<usize>>(&self, range: R) -> M::T {let l = match range.start_bound() {std::ops::Bound::Excluded(&x) => {assert!(x > 0);x - 1}std::ops::Bound::Included(&x) => x,std::ops::Bound::Unbounded => 0,};let r = match range.end_bound() {std::ops::Bound::Excluded(&x) => x,std::ops::Bound::Included(&x) => (x + 1),std::ops::Bound::Unbounded => self.n,};self.query(l, r)}#[allow(dead_code)]pub fn query(&self, l: usize, r: usize) -> M::T {let mut vl = M::id();let mut vr = M::id();let mut l = l + self.n;let mut r = r + self.n;while l < r {if l & 1 == 1 {vl = M::op(&vl, &self.buf[l]);l += 1;}if r & 1 == 1 {r -= 1;vr = M::op(&self.buf[r], &vr);}l >>= 1;r >>= 1;}M::op(&vl, &vr)}}pub trait Monoid {type T: Clone;fn id() -> Self::T;fn op(a: &Self::T, b: &Self::T) -> Self::T;}pub enum MON {}impl Monoid for MON {type T = u64;fn id() -> Self::T {0}fn op(a: &Self::T, b: &Self::T) -> Self::T {*a + *b}}fn solve() {let (a, b) = readuu();let mut res = a * 2 + b * 2;let mut d = 0;if a == b {d = a * 2;} else {d = min(a, b) * 2 + 1;}p!(res - d);return;}