結果

問題 No.3025 Chocol∀te
コンテスト
ユーザー 👑 ArcAki
提出日時 2025-10-31 19:54:15
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 327 ms / 2,000 ms
コード長 8,406 bytes
コンパイル時間 13,036 ms
コンパイル使用メモリ 399,480 KB
実行使用メモリ 20,992 KB
最終ジャッジ日時 2025-10-31 19:54:52
合計ジャッジ時間 31,399 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 77
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::{
    convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,},
    fs::{File}, hash::{Hash, Hasher, BuildHasherDefault}, iter::{Product, Sum}, marker::PhantomData,
    ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds},
    str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
    collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{swap},
    cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
    thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell,
    io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
};
pub trait SortD{ fn sort_d(&mut self); }
impl<T: Ord> SortD for Vec<T>{ fn sort_d(&mut self) {
    self.sort_by(|u, v| v.cmp(&u));
} }
pub trait Mx{fn max(&self, rhs: Self)->Self;}
impl Mx for f64{ fn max(&self, rhs: Self)->Self{if *self < rhs{ rhs } else { *self } }}
pub trait Mi{ fn min(&self, rhs: Self)->Self; }
impl Mi for f64{ fn min(&self, rhs: Self)->Self{ if *self > rhs{ rhs } else { *self } } }
pub fn gcd(mut a: i64, mut b: i64)->i64{ if b==0{return a;}(a,b)=(a.abs(),b.abs());while b!=0{ let c = a;a = b;b = c%b; }a }
pub fn factorial_i64(n: usize)->(Vec<i64>, Vec<i64>){ let mut res = vec![1; n+1];let mut inv = vec![1; n+1];for i in 0..n{ res[i+1] = (res[i]*(i+1)as i64)%MOD; }inv[n] = mod_inverse(res[n], MOD);for i in (0..n).rev(){ inv[i] = inv[i+1]*(i+1) as i64%MOD; }(res, inv) }
pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b}
pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64)
{if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}}
pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m}
pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{
    if a<b{return 0;}else if b==0 || a==b{ return 1; }
    else{let x=f[a as usize].0;
        let y=f[(a-b) as usize].1;let z=f[b as usize].1;return((x*y)%MOD)*z%MOD;}}
pub fn factorial(x: i64)->Vec<(i64, i64)>{
    let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64;
    let mut inv = vec![0; x as usize+10];inv[1] = 1;
    for i in 2..x+1{z=(z*i)%MOD;
        let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD;
        inv[i as usize] = w;
        f.push((z, (f[i as usize-1].1*w)%MOD));}return f;}
pub fn fast_mod_pow(x: i64,p: usize, m: i64)->i64{
    let mut res=1;let mut t=x;let mut z=p;while z > 0{
        if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res}
pub fn vec_out<T>(v: Vec<T>) where T: ToString{ println!("{}", v.iter().map(|x| x.to_string()).collect::<Vec<_>>().join(" ")); }
pub fn one_add_out(v: Vec<usize>){println!("{}", v.iter().map(|x| (x+1).to_string()).collect::<Vec<_>>().join(" "));}
pub trait Chmax{
    fn chmax(&mut self, rhs: Self);
}
impl Chmax for i64{
    fn chmax(&mut self, rhs: Self) {
        *self = (*self).max(rhs)
    }
}
impl Chmax for i32{
    fn chmax(&mut self, rhs: Self) {
        *self = (*self).max(rhs)
    }
}
impl Chmax for f64{
    fn chmax(&mut self, rhs: Self) {
        *self = (*self).max(rhs)
    }
}
impl Chmax for usize{
    fn chmax(&mut self, rhs: Self) {
        *self = (*self).max(rhs)
    }
}
pub trait Chmin {
    fn chmin(&mut self, rhs: Self);
}
impl Chmin for i64{
    fn chmin(&mut self, rhs: Self) {
        *self = (*self).min(rhs)
    }
}
impl Chmin for i32{
    fn chmin(&mut self, rhs: Self) {
        *self = (*self).min(rhs)
    }
}
impl Chmin for f64{
    fn chmin(&mut self, rhs: Self) {
        *self = (*self).min(rhs)
    }
}
impl Chmin for usize{
    fn chmin(&mut self, rhs: Self) {
        *self = (*self).min(rhs)
    }
}
#[allow(unused)]
mod fxhash{
    use std::hash::BuildHasherDefault;

    #[derive(Default)]
    pub struct FxHasher{
        pub hash: u64,
    }
    impl std::hash::Hasher for FxHasher{
        #[inline(always)]
        fn finish(&self) -> u64 {
            self.hash
        }

        #[inline(always)]
        fn write(&mut self, bytes: &[u8]) {
            let mut h = self.hash;
            for &b in bytes{
                h = h.rotate_left(5)^(b as u64);
                h = h.wrapping_mul(0x517cc1b727220a95);
            }
            self.hash = h;
        }
    }
    pub type FxBuildHasher = BuildHasherDefault<FxHasher>;
    pub type FxMap<K, V> = std::collections::HashMap<K, V, BuildHasherDefault<FxBuildHasher>>;
    pub type FxSet<K> = std::collections::HashSet<K, BuildHasherDefault<FxHasher>>;
}
#[allow(unused_imports)]
use fxhash::{FxSet, FxMap, FxBuildHasher};
#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}, fastout};
/*
#[allow(unused_imports)]
use rustc_hash::FxHasher;
#[allow(dead_code)]
type FxMap<K, V> = HashMap<K, V, BuildHasherDefault<FxHasher>>;
#[allow(dead_code)]
type FxSet<K> = HashSet<K, BuildHasherDefault<FxHasher>>;
#[allow(unused_imports)]
use rand::{thread_rng, Rng, seq::SliceRandom, prelude::*};
#[allow(unused_imports)]
use itertools::{Itertools};
#[allow(unused_imports)]
use ordered_float::OrderedFloat;
#[allow(unused_imports)]
use ac_library::{*, ModInt998244353 as mint};

#[allow(dead_code)]
type MI = StaticModInt<Mod998244353>;pub fn factorial_mint(n: usize)->(Vec<MI>, Vec<MI>){ let mut res = vec![mint::new(1); n+1];let mut inv = vec![mint::new(1); n+1];for i in 0..n{res[i+1] = res[i]*(i+1);}inv[n] = mint::new(1)/res[n];for i in (0..n).rev(){inv[i] = inv[i+1]*(i+1);}(res, inv)}
 */
#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const I: i32 = 1<<28;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];

const B: usize = 500;

#[fastout]
fn main() {
    input! {
        n: usize, m: usize,
        e: [(Usize1, Usize1); m],
        mut a: [i64; n], q: usize,
    }
    let mut edge = vec![FxSet::default(); n];
    let mut ans = vec![0; n];
    for &(u, v) in &e{
        edge[u].insert(v);
        edge[v].insert(u);
    }
    let mut large = FxSet::default();
    for i in 0..n{
        if edge[i].len() >= B{
            large.insert(i);
        }
    }
    for &(u, v) in &e{
        if edge[v].len() < B{
            ans[u] += a[v];
        }
        if edge[u].len() < B{
            ans[v] += a[u];
        }
    }
    for _i in 0..q{
        input!{
            t: u8,
        }
        if t==1{
            input!{
                u: Usize1, v: Usize1,
            }
            if edge[u].contains(&v){
                edge[u].remove(&v);
                edge[v].remove(&u);
                if edge[u].len()==B-1{
                    for &p in &edge[u]{
                        ans[p] += a[u];
                    }
                    large.remove(&u);
                } else if edge[u].len() < B-1{
                    ans[v] -= a[u];
                }
                if edge[v].len()==B-1{
                    for &p in &edge[v]{
                        ans[p] += a[v];
                    }
                    large.remove(&v);
                } else if edge[v].len() < B-1{
                    ans[u] -= a[v];
                }
            } else {
                if edge[u].len()+1==B{
                    for &p in &edge[u]{
                        ans[p] -= a[u];
                    }
                    large.insert(u);
                } else if edge[u].len()+1 < B{
                    ans[v] += a[u];
                }
                if edge[v].len()+1==B{
                    for &p in &edge[v]{
                        ans[p] -= a[v];
                    }
                    large.insert(v);
                } else if edge[v].len()+1 < B{
                    ans[u] += a[v];
                }
                edge[u].insert(v);
                edge[v].insert(u);
            }
        } else if t==2{
            input!{
                p: Usize1, x: i64,
            }
            if edge[p].len() < B{
                for &np in &edge[p]{
                    ans[np] += x-a[p];
                }
            }
            a[p] = x;
        } else {
            input!{
                c: Usize1,
            }
            let mut res = ans[c];
            for &p in &large{
                if edge[c].contains(&p){
                    res += a[p];
                }
            }
            println!("{}", res);
        }
    }
}
0