結果
問題 | No.2319 Friends+ |
ユーザー |
![]() |
提出日時 | 2023-05-26 21:51:14 |
言語 | Rust (1.68.1) |
結果 |
AC
|
実行時間 | 2,466 ms / 3,000 ms |
コード長 | 5,455 bytes |
コンパイル時間 | 1,138 ms |
コンパイル使用メモリ | 150,480 KB |
実行使用メモリ | 13,600 KB |
最終ジャッジ日時 | 2023-08-26 11:14:56 |
合計ジャッジ時間 | 27,191 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 352 ms
11,868 KB |
testcase_03 | AC | 357 ms
11,800 KB |
testcase_04 | AC | 349 ms
11,892 KB |
testcase_05 | AC | 355 ms
11,832 KB |
testcase_06 | AC | 360 ms
11,888 KB |
testcase_07 | AC | 354 ms
12,848 KB |
testcase_08 | AC | 354 ms
13,076 KB |
testcase_09 | AC | 351 ms
13,024 KB |
testcase_10 | AC | 346 ms
13,132 KB |
testcase_11 | AC | 340 ms
13,020 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,384 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 1 ms
4,380 KB |
testcase_17 | AC | 1 ms
4,380 KB |
testcase_18 | AC | 2,466 ms
12,956 KB |
testcase_19 | AC | 2,464 ms
12,900 KB |
testcase_20 | AC | 316 ms
12,872 KB |
testcase_21 | AC | 315 ms
13,040 KB |
testcase_22 | AC | 321 ms
12,784 KB |
testcase_23 | AC | 1,408 ms
12,888 KB |
testcase_24 | AC | 857 ms
13,112 KB |
testcase_25 | AC | 593 ms
13,056 KB |
testcase_26 | AC | 445 ms
13,128 KB |
testcase_27 | AC | 377 ms
13,028 KB |
testcase_28 | AC | 342 ms
13,108 KB |
testcase_29 | AC | 331 ms
13,108 KB |
testcase_30 | AC | 329 ms
13,116 KB |
testcase_31 | AC | 315 ms
12,768 KB |
testcase_32 | AC | 315 ms
13,096 KB |
testcase_33 | AC | 314 ms
13,136 KB |
testcase_34 | AC | 306 ms
13,068 KB |
testcase_35 | AC | 311 ms
12,804 KB |
testcase_36 | AC | 321 ms
12,844 KB |
testcase_37 | AC | 315 ms
12,032 KB |
testcase_38 | AC | 306 ms
13,092 KB |
testcase_39 | AC | 312 ms
13,120 KB |
testcase_40 | AC | 313 ms
13,132 KB |
testcase_41 | AC | 316 ms
13,136 KB |
testcase_42 | AC | 309 ms
13,128 KB |
testcase_43 | AC | 321 ms
13,104 KB |
testcase_44 | AC | 319 ms
13,600 KB |
testcase_45 | AC | 329 ms
13,176 KB |
testcase_46 | AC | 345 ms
10,484 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type --> Main.rs:66:15 | 66 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 66 - fn readi() -> (i64) { 66 + fn readi() -> i64 { | warning: unused variable: `i` --> Main.rs:186:9 | 186 | for i in 0..q { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default warning: 2 warnings emitted
ソースコード
// -*- coding:utf-8-unix -*- // #![feature(map_first_last)] #![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] // use core::num; use std::cmp::*; use std::fmt::*; use std::hash::*; use std::iter::FromIterator; use std::*; use std::{cmp, collections, fmt, io, iter, ops, str}; const INF: i64 = 1223372036854775807; const UINF: usize = INF as usize; const LINF: i64 = 2147483647; const INF128: i128 = 1223372036854775807000000000000; const MOD1: i64 = 1000000007; const MOD2: i64 = 998244353; const MOD: i64 = MOD1; // const MOD: i64 = MOD2; const UMOD: usize = MOD as usize; const M_PI: f64 = 3.14159265358979323846; // const MOD: i64 = INF; use cmp::Ordering::*; 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); }; } macro_rules! yn { ($val:expr) => { if $val { println!("Yes"); } else { println!("No"); } }; } 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(), ) } #[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(), ) } #[allow(dead_code)] 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(), ) } 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 p: Vec<usize> = read_vec(); p.iter_mut().for_each(|x| *x -= 1); let mut graph = vec![vec![(0 as usize, 0 as usize); (0) as usize]; (n) as usize]; for _ in 0..m { let (a, b) = readuu(); graph[a - 1].push((b - 1, 0)); graph[b - 1].push((a - 1, 0)); } let q: usize = read(); for i in 0..q { let (x, y) = readuu(); let x = x - 1; let y = y - 1; if p[x] == p[y] { println!("No"); continue; } let targ = p[y]; let mut found = false; for &(v, _) in graph[x].iter() { if p[v] == targ { found = true; break; } } if found { p[x] = targ; println!("Yes"); } else { println!("No"); } } return; }