#649300 (Rust) No.1477 Lamps on Graph

• 問題: No.1477 Lamps on Graph
• ユーザー: Moss_Local
• 提出日時: 2021-04-17 20:13:52
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 147 ms / 2,000 ms
• コード長: 7,058 bytes
• コンパイル時間: 2,371 ms
• コンパイル使用メモリ: 151,980 KB
• 実行使用メモリ: 16,076 KB
• 最終ジャッジ日時: 2023-09-17 05:51:02
• 合計ジャッジ時間: 7,066 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,376 KB
testcase_01	AC	1 ms; 4,376 KB
testcase_02	AC	1 ms; 4,376 KB
testcase_03	AC	1 ms; 4,376 KB
testcase_04	AC	1 ms; 4,376 KB
testcase_05	AC	1 ms; 4,380 KB
testcase_06	AC	0 ms; 4,376 KB
testcase_07	AC	1 ms; 4,376 KB
testcase_08	AC	1 ms; 4,376 KB
testcase_09	AC	1 ms; 4,376 KB
testcase_10	AC	1 ms; 4,376 KB
testcase_11	AC	1 ms; 4,380 KB
testcase_12	AC	54 ms; 7,616 KB
testcase_13	AC	58 ms; 7,404 KB
testcase_14	AC	65 ms; 8,468 KB
testcase_15	AC	25 ms; 4,596 KB
testcase_16	AC	18 ms; 5,020 KB
testcase_17	AC	21 ms; 4,488 KB
testcase_18	AC	101 ms; 8,784 KB
testcase_19	AC	54 ms; 7,684 KB
testcase_20	AC	17 ms; 4,376 KB
testcase_21	AC	82 ms; 7,824 KB
testcase_22	AC	9 ms; 4,376 KB
testcase_23	AC	31 ms; 5,256 KB
testcase_24	AC	83 ms; 10,020 KB
testcase_25	AC	24 ms; 4,488 KB
testcase_26	AC	83 ms; 10,328 KB
testcase_27	AC	28 ms; 5,436 KB
testcase_28	AC	36 ms; 7,184 KB
testcase_29	AC	38 ms; 6,104 KB
testcase_30	AC	56 ms; 5,568 KB
testcase_31	AC	30 ms; 5,012 KB
testcase_32	AC	147 ms; 16,076 KB
testcase_33	AC	109 ms; 14,392 KB
testcase_34	AC	139 ms; 8,588 KB
testcase_35	AC	116 ms; 13,096 KB
testcase_36	AC	101 ms; 13,428 KB
testcase_37	AC	70 ms; 12,928 KB
testcase_38	AC	87 ms; 13,208 KB
testcase_39	AC	103 ms; 13,404 KB

コンパイルメッセージ

warning: unnecessary parentheses around `if` condition
   --> Main.rs:266:12
    |
266 |         if (i != 0) {
    |            ^      ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
266 -         if (i != 0) {
266 +         if i != 0 {
    |

warning: unused variable: `flg`
   --> Main.rs:213:13
    |
213 |     let mut flg = true;
    |             ^^^ help: if this is intentional, prefix it with an underscore: `_flg`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: unused variable: `i`
   --> Main.rs:232:9
    |
232 |     for i in 0..m {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`

warning: unused variable: `nn`
   --> Main.rs:242:9
    |
242 |     let nn: usize = read();
    |         ^^ help: if this is intentional, prefix it with an underscore: `_nn`

warning: unused variable: `res`
   --> Main.rs:249:13
    |
249 |     let mut res = 0 as usize;
    |             ^^^ help: if this is intentional, prefix it with an underscore: `_res`

warning: unused variable: `seen`
   --> Main.rs:250:13
    |
250 |     let mut seen = vec![0; n];
    |             ^^^^ help: if this is intentional, prefix it with an underscore: `_seen`

warning: variable does not need to be mutable
   --> Main.rs:192:9
    |
192 |     let mut n = graph.len();
    |         ----^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable does not need to be mutable
   --> Main.rs:198:13
    |
198 |         let mut v = i;
    |             ----^
    |             |
    |             help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:200:17
    |
200 |             let mut nv = graph[v][j].0;
    |                 ----^^
    |                 |
    |                 help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:209:9
    |
209 |     let mut n = graph.len

ソースコード

// -*- 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 topo_sort_dfs(
    v: usize,
    graph: &Vec<Vec<(usize, usize)>>,
    used: &mut Vec<usize>,
    data: &mut Vec<usize>,
) {
    if used[v] == 1 {
        return;
    }

    used[v] = 1;
    for i in graph[v].iter() {
        let nv = (*i).0;
        if used[nv] == 1 {
            continue;
        }
        topo_sort_dfs(nv, &graph, used, data);
    }
    data.push(v);
    return;
}
fn topo_cycle_ditect(graph: &Vec<Vec<(usize, usize)>>, sorted: &Vec<usize>) -> bool {
    let mut flg = false;
    // let mut  = 0 as usize;
    let mut n = graph.len();
    let mut num = vec![0; n];
    for i in 0..n {
        num[sorted[i]] = i;
    }
    for i in 0..n {
        let mut v = i;
        for j in 0..graph[v].len() {
            let mut nv = graph[v][j].0;
            if num[v] > num[nv] {
                flg = true;
            }
        }
    }
    return flg;
}
fn topo_sort(graph: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
    let mut n = graph.len();
    // let mut = 0 as usize;c
    let mut used = vec![0; n];
    let mut res = vec![0; 0];
    let mut flg = true;
    for i in 0..n {
        topo_sort_dfs(i, &graph, &mut used, &mut res);
    }
    res.reverse();

    let mut flg_cycle = true;
    if flg_cycle {
        if topo_cycle_ditect(&graph, &res) {
            return vec![0; 0];
        }
    }
    return res;
}

fn solve() {
    let (n, m) = readuu();
    let mut aa: Vec<usize> = read_vec();
    let mut graph = vec![vec![(0 as usize, 0 as usize); (0) as usize]; (n) as usize];
    for i in 0..m {
        let (mut a, mut b) = readuu();
        a -= 1;
        b -= 1;
        if aa[a] < aa[b] {
            graph[a].push((b, 1));
        } else if aa[a] > aa[b] {
            graph[b].push((a, 1));
        }
    }
    let nn: usize = read();
    let mut b: Vec<usize> = read_vec();
    let mut lp = vec![0; n];
    for i in 0..b.len() {
        lp[b[i] - 1] = 1;
    }
    let mut sorted = topo_sort(&graph);
    let mut res = 0 as usize;
    let mut seen = vec![0; n];
    let mut res = vec![0; 0];
    for i in 0..n {
        let mut v = sorted[i];
        if lp[v] == 1 {
            res.push(v + 1);
        } else {
            continue;
        }
        for i in 0..graph[v].len() {
            let mut nv = graph[v][i];
            lp[nv.0] ^= 1;
        }
    }
    println!("{:?}", res.len());
    for i in 0..res.len() {
        if (i != 0) {
            print!("\n");
        }
        print!("{}", res[i])
    }
    println!("");
    return;
}

fn main() {
    solve()
}