#952657 (Rust) No.2640 traO Stamps

• 問題: No.2640 traO Stamps
• ユーザー: Moss_Local
• 提出日時: 2024-02-19 21:48:44
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 185 ms / 2,000 ms
• コード長: 7,629 bytes
• コンパイル時間: 1,376 ms
• コンパイル使用メモリ: 192,004 KB
• 実行使用メモリ: 7,388 KB
• 最終ジャッジ日時: 2024-02-19 21:48:53
• 合計ジャッジ時間: 8,729 ms
• ジャッジサーバーID （参考情報）: judge12 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,676 KB
testcase_01	AC	1 ms; 6,676 KB
testcase_02	AC	1 ms; 6,676 KB
testcase_03	AC	0 ms; 6,676 KB
testcase_04	AC	1 ms; 6,676 KB
testcase_05	AC	1 ms; 6,676 KB
testcase_06	AC	147 ms; 6,676 KB
testcase_07	AC	159 ms; 6,676 KB
testcase_08	AC	182 ms; 6,776 KB
testcase_09	AC	152 ms; 6,676 KB
testcase_10	AC	162 ms; 6,796 KB
testcase_11	AC	148 ms; 6,676 KB
testcase_12	AC	158 ms; 7,036 KB
testcase_13	AC	142 ms; 6,676 KB
testcase_14	AC	167 ms; 6,824 KB
testcase_15	AC	162 ms; 6,676 KB
testcase_16	AC	139 ms; 6,676 KB
testcase_17	AC	155 ms; 6,676 KB
testcase_18	AC	169 ms; 6,676 KB
testcase_19	AC	165 ms; 7,104 KB
testcase_20	AC	158 ms; 6,964 KB
testcase_21	AC	161 ms; 6,676 KB
testcase_22	AC	169 ms; 6,996 KB
testcase_23	AC	154 ms; 6,676 KB
testcase_24	AC	161 ms; 6,676 KB
testcase_25	AC	159 ms; 7,200 KB
testcase_26	AC	176 ms; 7,388 KB
testcase_27	AC	179 ms; 7,388 KB
testcase_28	AC	164 ms; 7,388 KB
testcase_29	AC	185 ms; 7,388 KB
testcase_30	AC	184 ms; 7,172 KB
testcase_31	AC	182 ms; 7,200 KB
testcase_32	AC	180 ms; 6,676 KB
testcase_33	AC	169 ms; 6,676 KB

コンパイルメッセージ

warning: unnecessary parentheses around match arm expression
   --> Main.rs:224:46
    |
224 |             std::ops::Bound::Included(&x) => (x + 1),
    |                                              ^     ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
224 -             std::ops::Bound::Included(&x) => (x + 1),
224 +             std::ops::Bound::Included(&x) => x + 1,
    |

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

warning: variable does not need to be mutable
   --> Main.rs:128:9
    |
128 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:133:9
    |
133 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:139:9
    |
139 |     let mut vec: Vec<f64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:144:9
    |
144 |     let mut vec: Vec<char> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:149:9
    |
149 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:154:9
    |
154 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:160:9
    |
160 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^

ソースコード

// -*- 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 MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// 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) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{
    // declear btreemap
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{
    // declear btreemap
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

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 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 vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

fn read_imat(h: usize) -> Vec<Vec<i64>> {
    (0..h).map(|_| read_vec()).collect()
}
fn read_cmat(h: usize) -> Vec<Vec<char>> {
    (0..h).map(|_| read::<String>().chars().collect()).collect()
}

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 = usize;
    fn id() -> Self::T {
        0
    }
    fn op(a: &Self::T, b: &Self::T) -> Self::T {
        *a + *b
    }
}
fn solve() {
    let (n, m, k) = readuuu();
    let mut dist = vec![vec! {INF; n}; n];
    let mut s: Vec<usize> = read_vec();
    for i in 0..n {
        dist[i][i] = 0;
    }
    for _ in 0..m {
        let (a, b, c) = readuuu();
        dist[a - 1][b - 1] = c as i64;
        dist[b - 1][a - 1] = c as i64;
    }
    for k in 0..n {
        for i in 0..n {
            for j in 0..n {
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
    // d!(dist);
    s.iter_mut().for_each(|x| *x -= 1);
    let mut seg: SEG<MON> = SEG::new(k);
    let mut cur_pos = s[0];
    for i in 1..=k {
        let d = dist[cur_pos][s[i]];
        seg.update(i - 1, d as usize);
        cur_pos = s[i];
    }
    let q: usize = read();
    for i in 0..q {
        let (t, x, y) = readuuu();
        if t == 1 {
            let x = x;
            let y = y - 1;
            let prev_pos = s[x];
            s[x] = y;
            if x == 0 {
                let d2 = dist[y][s[1]];
                seg.update(0, d2 as usize);
            } else if x == k {
                let d1 = dist[s[k - 1]][y];
                seg.update(k - 1, d1 as usize);
            } else {
                let d1 = dist[s[x - 1]][y];
                let d2 = dist[y][s[x + 1]];
                seg.update(x - 1, d1 as usize);
                seg.update(x, d2 as usize);
            }
        } else {
            if x == y {
                println!("0");
            } else if x == 0 {
                println!("{}", seg.query(0, y));
            } else if y == k {
                println!("{}", seg.query(x, k));
            } else {
                println!("{}", seg.query(x, y));
            }
        }
    }
    return;
}