Add atcoder/abc459/a.rs atcoder/abc459/b.rs atcoder/abc459/c.rs atcoder/abc459/d-alt.rs atcoder/abc459/d.rs atcoder/abc459/e.rs atcoder/abc459/remain.txt

Author: koba-e964

atcoder/abc459/a.rs

@@ -0,0 +1,12 @@
+fn getline() -> String {
+    let mut ret = String::new();
+    std::io::stdin().read_line(&mut ret).unwrap();
+    ret
+}
+
+fn main() {
+    let mut s = "HelloWorld".chars().collect::<Vec<_>>();
+    let n = getline().trim().parse::<usize>().unwrap() - 1;
+    s.remove(n);
+    println!("{}", s.into_iter().collect::<String>());
+}

atcoder/abc459/b.rs

@@ -0,0 +1,29 @@
+fn getline() -> String {
+    let mut ret = String::new();
+    std::io::stdin().read_line(&mut ret).unwrap();
+    ret
+}
+
+fn main() {
+    getline();
+    let s = getline().trim().split_whitespace()
+        .map(|x| x.trim().chars().collect::<Vec<_>>()[0])
+        .collect::<Vec<_>>();
+    fn f(c: char) -> u8 {
+        let i = c as u8 - b'a';
+        if c <= 'o' {
+            return i / 3 + 2;
+        }
+        if c <= 's' {
+            return 7;
+        }
+        if c <= 'v' {
+            return 8;
+        }
+        9
+    }
+    for c in s {
+        print!("{}", f(c));
+    }
+    println!();
+}

atcoder/abc459/c.rs

@@ -0,0 +1,34 @@
+fn getline() -> String {
+    let mut ret = String::new();
+    std::io::stdin().read_line(&mut ret).unwrap();
+    ret
+}
+
+fn main() {
+    let ints = getline().trim().split_whitespace()
+        .map(|x| x.parse::<usize>().unwrap())
+        .collect::<Vec<_>>();
+    let [n, q] = ints[..] else { panic!() };
+    let mut a = vec![0; n];
+    let mut f = vec![0; q + 1];
+    f[0] = n;
+    let mut mi = 0;
+    for _ in 0..q {
+        let s = getline().trim().split_whitespace()
+            .map(|x| x.parse::<usize>().unwrap())
+            .collect::<Vec<_>>();
+        let ty = s[0];
+        if ty == 1 {
+            let x = s[1] - 1;
+            a[x] += 1;
+            f[a[x]] += 1;
+            while mi < q && f[mi + 1] == n {
+                mi += 1;
+            }
+        } else {
+            let y = s[1];
+            let f = |y: usize| if y + mi <= q { f[y + mi] } else { 0 };
+            println!("{}", f(y));
+        }
+    }
+}

atcoder/abc459/d-alt.rs

@@ -0,0 +1,42 @@
+fn getline() -> String {
+    let mut ret = String::new();
+    std::io::stdin().read_line(&mut ret).unwrap();
+    ret
+}
+
+// Similar problems: https://atcoder.jp/contests/arc209/tasks/arc209_b
+fn main() {
+    let t = getline().trim().parse::<i32>().unwrap();
+    for _ in 0..t {
+        let s = getline().trim().chars().collect::<Vec<_>>();
+        let n = s.len();
+        let mut f = vec![0; 26];
+        for &c in &s {
+            f[(c as u8 - b'a') as usize] += 1;
+        }
+        let mut ma = (0, 0);
+        for i in 0..26 {
+            ma = ma.max((f[i], i));
+        }
+        if ma.0 * 2 - 1 > n {
+            println!("No");
+            continue;
+        }
+        println!("Yes");
+        let mut ans = "".to_string();
+        let mut last = 26;
+        for _ in 0..n {
+            let mut ma = (0, 0);
+            for i in 0..26 {
+                if i != last {
+                    ma = ma.max((f[i], i));
+                }
+            }
+            let c = ('a' as u8 + ma.1 as u8) as char;
+            ans.push(c);
+            f[ma.1] -= 1;
+            last = ma.1;
+        }
+        println!("{ans}");
+    }
+}

atcoder/abc459/d.rs

@@ -0,0 +1,44 @@
+fn getline() -> String {
+    let mut ret = String::new();
+    std::io::stdin().read_line(&mut ret).unwrap();
+    ret
+}
+
+// Similar problems: https://atcoder.jp/contests/arc209/tasks/arc209_b
+fn main() {
+    let t = getline().trim().parse::<i32>().unwrap();
+    for _ in 0..t {
+        let s = getline().trim().chars().collect::<Vec<_>>();
+        let n = s.len();
+        let mut f = vec![0; 26];
+        for &c in &s {
+            f[(c as u8 - b'a') as usize] += 1;
+        }
+        let mut ma = (0, 0);
+        for i in 0..26 {
+            ma = ma.max((f[i], i));
+        }
+        if ma.0 * 2 - 1 > n {
+            println!("No");
+            continue;
+        }
+        println!("Yes");
+        let mut buc = vec!["".to_string(); ma.0];
+        let mut tmp = vec![];
+        for i in 0..26 {
+            let x = (i + ma.1) % 26;
+            let c = ('a' as u8 + x as u8) as char;
+            for _ in 0..f[x] {
+                tmp.push(c);
+            }
+        }
+        for i in 0..tmp.len() {
+            buc[i % ma.0].push(tmp[i]);
+        }
+        let mut ans = "".to_string();
+        for b in buc {
+            ans += &b;
+        }
+        println!("{ans}");
+    }
+}

atcoder/abc459/e.rs

@@ -0,0 +1,172 @@
+fn getline() -> String {
+    let mut ret = String::new();
+    std::io::stdin().read_line(&mut ret).unwrap();
+    ret
+}
+
+/// Verified by https://atcoder.jp/contests/abc198/submissions/21774342
+mod mod_int {
+    use std::ops::*;
+    pub trait Mod: Copy { fn m() -> i64; }
+    #[derive(Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)]
+    pub struct ModInt<M> { pub x: i64, phantom: ::std::marker::PhantomData<M> }
+    impl<M: Mod> ModInt<M> {
+        // x >= 0
+        pub fn new(x: i64) -> Self { ModInt::new_internal(x % M::m()) }
+        fn new_internal(x: i64) -> Self {
+            ModInt { x: x, phantom: ::std::marker::PhantomData }
+        }
+        pub fn pow(self, mut e: i64) -> Self {
+            debug_assert!(e >= 0);
+            let mut sum = ModInt::new_internal(1);
+            let mut cur = self;
+            while e > 0 {
+                if e % 2 != 0 { sum *= cur; }
+                cur *= cur;
+                e /= 2;
+            }
+            sum
+        }
+        #[allow(dead_code)]
+        pub fn inv(self) -> Self { self.pow(M::m() - 2) }
+    }
+    impl<M: Mod> Default for ModInt<M> {
+        fn default() -> Self { Self::new_internal(0) }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> Add<T> for ModInt<M> {
+        type Output = Self;
+        fn add(self, other: T) -> Self {
+            let other = other.into();
+            let mut sum = self.x + other.x;
+            if sum >= M::m() { sum -= M::m(); }
+            ModInt::new_internal(sum)
+        }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> Sub<T> for ModInt<M> {
+        type Output = Self;
+        fn sub(self, other: T) -> Self {
+            let other = other.into();
+            let mut sum = self.x - other.x;
+            if sum < 0 { sum += M::m(); }
+            ModInt::new_internal(sum)
+        }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> Mul<T> for ModInt<M> {
+        type Output = Self;
+        fn mul(self, other: T) -> Self { ModInt::new(self.x * other.into().x % M::m()) }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> AddAssign<T> for ModInt<M> {
+        fn add_assign(&mut self, other: T) { *self = *self + other; }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> SubAssign<T> for ModInt<M> {
+        fn sub_assign(&mut self, other: T) { *self = *self - other; }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> MulAssign<T> for ModInt<M> {
+        fn mul_assign(&mut self, other: T) { *self = *self * other; }
+    }
+    impl<M: Mod> Neg for ModInt<M> {
+        type Output = Self;
+        fn neg(self) -> Self { ModInt::new(0) - self }
+    }
+    impl<M> ::std::fmt::Display for ModInt<M> {
+        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
+            self.x.fmt(f)
+        }
+    }
+    impl<M: Mod> ::std::fmt::Debug for ModInt<M> {
+        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
+            let (mut a, mut b, _) = red(self.x, M::m());
+            if b < 0 {
+                a = -a;
+                b = -b;
+            }
+            write!(f, "{}/{}", a, b)
+        }
+    }
+    impl<M: Mod> From<i64> for ModInt<M> {
+        fn from(x: i64) -> Self { Self::new(x) }
+    }
+    // Finds the simplest fraction x/y congruent to r mod p.
+    // The return value (x, y, z) satisfies x = y * r + z * p.
+    fn red(r: i64, p: i64) -> (i64, i64, i64) {
+        if r.abs() <= 10000 {
+            return (r, 1, 0);
+        }
+        let mut nxt_r = p % r;
+        let mut q = p / r;
+        if 2 * nxt_r >= r {
+            nxt_r -= r;
+            q += 1;
+        }
+        if 2 * nxt_r <= -r {
+            nxt_r += r;
+            q -= 1;
+        }
+        let (x, z, y) = red(nxt_r, r);
+        (x, y - q * z, z)
+    }
+} // mod mod_int
+
+macro_rules! define_mod {
+    ($struct_name: ident, $modulo: expr) => {
+        #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
+        pub struct $struct_name {}
+        impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }
+    }
+}
+const MOD: i64 = 998_244_353;
+define_mod!(P, MOD);
+type MInt = mod_int::ModInt<P>;
+
+// Depends on MInt.rs
+fn fact_init(w: usize) -> (Vec<MInt>, Vec<MInt>) {
+    let mut fac = vec![MInt::new(1); w];
+    let mut invfac = vec![0.into(); w];
+    for i in 1..w {
+        fac[i] = fac[i - 1] * i as i64;
+    }
+    invfac[w - 1] = fac[w - 1].inv();
+    for i in (0..w - 1).rev() {
+        invfac[i] = invfac[i + 1] * (i as i64 + 1);
+    }
+    (fac, invfac)
+}
+
+fn dfs(ch: &[Vec<usize>], c: &[i64], d: &[usize], invfac: &[MInt], v: usize) -> (MInt, i64) {
+    let mut ans = MInt::new(1);
+    let mut rest = c[v];
+    for &w in &ch[v] {
+        let (subans, subrest) = dfs(ch, c, d, invfac, w);
+        ans *= subans;
+        rest += subrest;
+    }
+    if rest < d[v] as i64 {
+        return (0.into(), 0);
+    }
+    for i in 0..d[v] {
+        ans *= MInt::new(rest) - i as i64;
+    }
+    ans *= invfac[d[v]];
+    rest -= d[v] as i64;
+    (ans, rest)
+}
+
+fn main() {
+    let n = getline().trim().parse::<usize>().unwrap();
+    let p = getline().trim().split_whitespace()
+        .map(|x| x.parse::<usize>().unwrap() - 1)
+        .collect::<Vec<_>>();
+    let c = getline().trim().split_whitespace()
+        .map(|x| x.parse::<i64>().unwrap())
+        .collect::<Vec<_>>();
+    let d = getline().trim().split_whitespace()
+        .map(|x| x.parse::<usize>().unwrap())
+        .collect::<Vec<_>>();
+    let (_fac, invfac) = fact_init(1_000_001);
+    let mut ch = vec![vec![]; n];
+    for i in 1..n {
+        ch[p[i - 1]].push(i);
+    }
+    let ans = dfs(&ch, &c, &d, &invfac, 0);
+    println!("{}", ans.0);
+}

atcoder/abc459/remain.txt

@@ -0,0 +1,2 @@
+f
+g