#1174577 (Rust) No.3605 Grand Cross

• 問題: No.3605 Grand Cross
• ユーザー: akakimidori
• 提出日時: 2026-07-31 23:02:00
• 言語: Rust (1.94.0 + proconio + num + itertools)
• 結果: WA
• 実行時間: -
• コード長: 3,107 bytes
• コンパイル時間: 3,869 ms
• コンパイル使用メモリ: 193,844 KB
• 実行使用メモリ: 48,256 KB
• 最終ジャッジ日時: 2026-07-31 23:02:28
• 合計ジャッジ時間: 7,044 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_0

ファイルパターン	結果
sample	AC * 1
other	AC * 44 WA * 5

コンパイルメッセージ

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

warning: type alias `Deque` is never used
  --> src/main.rs:98:6
   |
98 | type Deque<T> = VecDeque<T>;
   |      ^^^^^

ソースコード

fn run<W: Write>(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter<W>) {
    let t: u32 = sc.next();
    for _ in 0..t {
        let n: usize = sc.next();
        let m: usize = sc.next();
        let c = sc.next_vec::<i64>(n);
        let d = sc.next_vec::<i64>(m);
        let a = sc.next_vec::<usize>(n);
        let b = sc.next_vec::<usize>(m);
        writeln!(out, "{}", solve(a, b, c, d)).ok();
    }
}

fn solve(a: Vec<usize>, b: Vec<usize>, mut c: Vec<i64>, mut d: Vec<i64>) -> i64 {
    let n = a.len();
    let m = b.len();
    let mut x = vec![vec![]; n + m + 1];
    let mut y = vec![vec![]; n + m + 1];
    for (i, a) in a.iter().enumerate() {
        x[*a].push(i);
    }
    for (i, a) in b.iter().enumerate() {
        y[*a].push(i);
    }
    c.push(0);
    for i in (1..c.len()).rev() {
        c[i - 1] += c[i];
    }
    d.push(0);
    for i in (1..d.len()).rev() {
        d[i - 1] += d[i];
    }
    let mut ans = -1;
    for _ in 0..2 {
        let n = c.len() - 1;
        let m = d.len() - 1;
        for (i, x) in x.iter().enumerate().filter(|p| !p.1.is_empty()) {
            if y[i].is_empty() {
                continue;
            }
            let y = &y[i];
            let mut po = 0;
            while po + 1 < x.len() && x[po + 1] * 2 < n {
                po += 1;
            }
            for i in [po, po + 1].iter() {
                if *i == x.len() {
                    continue;
                }
                let x = x[*i];
                for &y in y.iter() {
                    let l = x.min(n - 1 - x).min(y).min(m - 1 - y);
                    ans = ans.max(c[x - l] - c[x + l + 1] + d[y - l] - d[y + l + 1]);
                }
            }
        }
        std::mem::swap(&mut c, &mut d);
        std::mem::swap(&mut x, &mut y);
    }
    ans
}

// ---------- begin scannner ----------
#[allow(dead_code)]
mod scanner {
    use std::str::FromStr;
    pub struct Scanner<'a> {
        it: std::str::SplitWhitespace<'a>,
    }
    impl<'a> Scanner<'a> {
        pub fn new(s: &'a String) -> Scanner<'a> {
            Scanner {
                it: s.split_whitespace(),
            }
        }
        pub fn next<T: FromStr>(&mut self) -> T {
            self.it.next().unwrap().parse::<T>().ok().unwrap()
        }
        pub fn next_bytes(&mut self) -> Vec<u8> {
            self.it.next().unwrap().bytes().collect()
        }
        pub fn next_chars(&mut self) -> Vec<char> {
            self.it.next().unwrap().chars().collect()
        }
        pub fn next_vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
            (0..len).map(|_| self.next()).collect()
        }
    }
}
// ---------- end scannner ----------

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() {
    use std::io::Read;
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut sc = scanner::Scanner::new(&s);
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    run(&mut sc, &mut out);
}