結果
| 問題 | No.1485 運賃 |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2021-04-23 21:22:17 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 1 ms / 2,000 ms |
| コード長 | 5,648 bytes |
| コンパイル時間 | 12,862 ms |
| コンパイル使用メモリ | 384,548 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-07-04 07:29:27 |
| 合計ジャッジ時間 | 13,516 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 5 |
コンパイルメッセージ
warning: unnecessary parentheses around assigned value
--> src/main.rs:169:26
|
169 | let mut res: (i64) = (0);
| ^ ^
|
= note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
|
169 - let mut res: (i64) = (0);
169 + let mut res: (i64) = 0;
|
warning: unnecessary parentheses around type
--> src/main.rs:169:18
|
169 | let mut res: (i64) = (0);
| ^ ^
|
help: remove these parentheses
|
169 - let mut res: (i64) = (0);
169 + let mut res: i64 = (0);
|
warning: unnecessary parentheses around `if` condition
--> src/main.rs:170:8
|
170 | if (p != INF as usize) {
| ^ ^
|
help: remove these parentheses
|
170 - if (p != INF as usize) {
170 + if p != INF as usize {
|
warning: unnecessary parentheses around `if` condition
--> src/main.rs:178:12
|
178 | if (*nv == p || depth[*nv] != -1) {
| ^ ^
|
help: remove these parentheses
|
178 - if (*nv == p || depth[*nv] != -1) {
178 + if *nv == p || depth[*nv] != -1 {
|
warning: unnecessary parentheses around `if` condition
--> src/main.rs:191:12
|
191 | if (d.1 < depth[i]) {
| ^ ^
|
help: remove these parentheses
|
191 - if (d.1 < depth[i]) {
191 + if d.1 < depth[i] {
|
warning: unnecessary parentheses around `if` condition
--> src/main.rs:200:12
|
200 | if (d.1 < depth[i]) {
| ^ ^
|
help: remove these parentheses
|
200 - if (d.1 < depth[i]) {
200 + if d.1 < depth[i] {
|
warning: unused variable: `res`
--> src/main.rs:169:13
|
169 | let mut res: (i64) = (0);
| ^^^ help: if this is intentional, prefix it with an underscore: `_res`
|
= note: `#[warn(unused_variables)]` on by default
ソースコード
// -*- coding:utf-8-unix -*-// #![feature(map_first_last)]#![allow(dead_code)]#![allow(unused_imports)]#![allow(unused_macros)]use std::collections::*;use std::convert::*;use std::convert::{From, Into};use std::fmt::Debug;use std::fs::File;use std::io::prelude::*;use std::io::*;use std::marker::Copy;use std::mem::*;use std::ops::Bound::*;use std::ops::{Add, Mul, Neg, Sub};use std::str;use std::vec;use std::{cmp, process::Output};use std::{cmp::Ordering, env::consts::DLL_PREFIX};use std::{cmp::Ordering::*, f32::consts::PI};const INF: i64 = 1223372036854775807;const UINF: usize = INF as usize;const FINF: f64 = 122337203685.0;const INF128: i128 = 1223372036854775807000000000000;const LINF: i64 = 2147483647;const MOD: i64 = 1000000007;// const MOD: i64 = 998244353;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! d {($x:expr) => {println!("{:?}", $x);};}macro_rules! p {($x:expr) => {println!("{}", $x);};}// 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_vec2<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(),)}#[allow(dead_code)]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 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 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(),)}fn tree_diameter_dfs(v: usize, p: usize, depth: &mut Vec<i64>, graph: &Vec<Vec<usize>>) {let mut res: (i64) = (0);if (p != INF as usize) {depth[v] = depth[p] + 1;} else {depth[v] = 0;}// println!("{:?}", v);for nv in graph[v].iter() {if (*nv == p || depth[*nv] != -1) {continue;}tree_diameter_dfs(*nv, v, depth, graph);}// return res;}fn tree_diameter(graph: &Vec<Vec<usize>>) -> i64 {let mut depth: Vec<i64> = vec![-1; graph.len()];tree_diameter_dfs(0, INF as usize, &mut depth, &graph);let mut d = (0, 0);for i in 0..depth.len() {if (d.1 < depth[i]) {d = (i, depth[i])}}let mut depth: Vec<i64> = vec![-1; graph.len()];tree_diameter_dfs(d.0, INF as usize, &mut depth, &graph);let mut d = (0, 0);for i in 0..depth.len() {if (d.1 < depth[i]) {d = (i, depth[i])}}return d.1;}fn solve() {let (n, m) = readuu();println!("{:?}", n + m);return;}fn main() {solve()}