#1161447 (Rust) No.3516 Very Large Range Mod

• 問題: No.3516 Very Large Range Mod
• ユーザー: akakimidori
• 提出日時: 2026-04-24 22:45:10
• 言語: Rust (1.94.0 + proconio + num + itertools)
• 結果: WA
• 実行時間: -
• コード長: 3,618 bytes
• コンパイル時間: 11,623 ms
• コンパイル使用メモリ: 208,564 KB
• 実行使用メモリ: 9,344 KB
• 最終ジャッジ日時: 2026-04-24 22:45:28
• 合計ジャッジ時間: 17,376 ms
• ジャッジサーバーID （参考情報）: judge3_1 / judge2_1

ファイルパターン	結果
sample	AC * 3
other	WA * 8 RE * 22

コンパイルメッセージ

warning: unused import: `std::io::Write`
 --> src/main.rs:3:5
  |
3 | use std::io::Write;
  |     ^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default

warning: unused variable: `x`
  --> src/main.rs:26:18
   |
26 |             let (x, y, g) = ext_gcd(m, b - p);
   |                  ^ help: if this is intentional, prefix it with an underscore: `_x`
   |
   = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default

warning: unused variable: `x`
  --> src/main.rs:44:18
   |
44 |             let (x, y, g) = ext_gcd(m, b - p);
   |                  ^ help: if this is intentional, prefix it with an underscore: `_x`

warning: type alias `Map` is never used
 --> src/main.rs:6:6
  |
6 | type Map<K, V> = BTreeMap<K, V>;
  |      ^^^
  |
  = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default

warning: type alias `Set` is never used
 --> src/main.rs:7:6
  |
7 | type Set<T> = BTreeSet<T>;
  |      ^^^

ソースコード

// 尺取りしろという話だがどういうことか

use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    input! {
        n: usize,
        k: i64,
        m: i64,
        b: [i64; n],
        c: [i64; n],
    }
    let mut deq = Deque::<(i64, i64)>::new();
    let mut cnt = 0;
    let mut sum = 0;
    let mut ans = 0;
    for (mut c, b) in b.into_iter().zip(c) {
        while deq.len() > 0 && cnt - deq[0].0 + c >= k {
            let (p, q) = deq[0];
            // 0 <= i < q, sum + (b - p)i = 0 (mod M)
            let (x, y, g) = ext_gcd(m, b - p);
            if sum % g == 0 {
                let i = ((-sum / g) * y).rem_euclid(m / g);
                if i < q {
                    ans += (q - i - 1) / (m / g) + 1;
                }
            }
            deq.pop_front();
            cnt -= q;
            sum = (sum + m - p * q % m) % m;
        }
        if cnt + c > k && deq.len() > 0 {
            let need = cnt + c - k;
            let (p, q) = deq[0];
            assert!(need < q);
            deq[0].1 -= need;
            let q = need;
            // 0 <= i < q, sum + (b - p)i = 0 (mod M)
            let (x, y, g) = ext_gcd(m, b - p);
            if sum % g == 0 {
                let i = ((-sum / g) * y).rem_euclid(m / g);
                if i < q {
                    ans += (q - i - 1) / (m / g) + 1;
                }
            }
            cnt -= q;
            sum = (sum + m - p * q % m) % m;
        }
        if c > k {
            if k * b % m == 0 {
                ans += c - k;
            }
            c = k;
        }
        deq.push_back((b, c));
        cnt += b;
        sum = (sum + b * c) % m;
    }
    if sum % m == 0 {
        ans += 1;
    }
    println!("{}", ans);
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
// return (a, b, g)
// ax + by = gcd(x, y)
// gcd(x, y) = 0 の時は(0, 0) が返る
pub fn ext_gcd(x: i64, y: i64) -> (i64, i64, i64) {
    if y == 0 {
        return (x.signum(), 0, x.abs());
    }
    let q = x.div_euclid(y);
    let r = x.rem_euclid(y);
    let p = ext_gcd(y, r);
    (p.1, p.0 - q * p.1, p.2)
}