#1145683 (Rust) No.3436 [Cherry 8th Tune B] この夏に何が起こるかな?

• 問題: No.3436 [Cherry 8th Tune B] この夏に何が起こるかな?
• ユーザー: 👑 ArcAki
• 提出日時: 2026-01-23 22:40:01
• 言語: Rust (1.92.0 + proconio + num + itertools)
• 結果: WA
• 実行時間: -
• コード長: 5,480 bytes
• コンパイル時間: 5,427 ms
• コンパイル使用メモリ: 236,416 KB
• 実行使用メモリ: 29,564 KB
• 最終ジャッジ日時: 2026-01-23 22:41:08
• 合計ジャッジ時間: 19,053 ms
• ジャッジサーバーID （参考情報）: judge3 / judge6

ファイルパターン	結果
sample	AC * 1
other	AC * 17 WA * 8 TLE * 1 -- * 17

コンパイルメッセージ

warning: type alias `FxSet` is never used
  --> src/main.rs:60:14
   |
60 |     pub type FxSet<K> = std::collections::HashSet<K, FxBuildHasher>;
   |              ^^^^^
   |
   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default

ソースコード

#[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 trait Chmax: PartialOrd + Copy {
    fn chmax(&mut self, rhs: Self) {
        if *self < rhs { *self = rhs; }
    }
}
impl<T: PartialOrd + Copy> Chmax for T {}

pub trait Chmin: PartialOrd + Copy {
    fn chmin(&mut self, rhs: Self) {
        if *self > rhs { *self = rhs; }
    }
}
impl<T: PartialOrd + Copy> Chmin for T {}

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, FxBuildHasher>;
    pub type FxSet<K> = std::collections::HashSet<K, FxBuildHasher>;
}
#[allow(unused_imports)]
use fxhash::{FxSet, FxMap, FxBuildHasher};

#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}, fastout};

#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const I: i32 = 1<<29;
#[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)]
pub fn c2d(c: u8)->(usize, usize){match c{b'U'=>(!0,0),b'D'=>(1,0),b'L'=>(0,!0),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
pub fn c2d_i64(c: u8)->(i64, i64){match c{b'U'=>(-1,0),b'D'=>(1,0),b'L'=>(0,-1),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];

/*
二分探索
昇順のAに於いて初めてt以上となる要素のindexを返す
 */

#[inline]
pub fn binary_search<T>(t: T, a: &Vec<T>) -> usize where T: Copy+PartialOrd+Ord {
    let mut l = 0;
    let mut r = a.len() + 1;
    while l + 1 < r {
        let m = (l + r)/2;
        if a[m - 1] < t {
            l = m;
        } else {
            r = m;
        }
    }
    l
}

const MULTI: bool = true;
#[fastout]
fn solve(){
    input!{
        n: usize, m: usize, k: usize, p: usize,
        t: [i64; n],
        c: [Usize1; n],
        b: [i64; m],
        d: [Usize1; m],
        s: [i64; k],
    }
    let mut l = 0;
    let mut r = 1<<31;
    let mut ct = vec![Vec::new(); k];
    let mut cb = vec![Vec::new(); k];
    for (i, &c) in c.iter().enumerate(){
        ct[c].push(t[i]);
    }
    for (i, &d) in d.iter().enumerate(){
        cb[d].push(b[i]);
    }
    for i in 0..k{
        ct[i].sort_unstable();
        cb[i].sort_unstable();
    }
    let mut bx = b.clone();
    bx.sort_unstable();
    for _ in 0..31{
        let mid = (l+r)/2;
        let mut ac = 0;
        for &v in &t{
            ac += binary_search(mid+1-v, &bx);
        }
        for i in 0..k{
            let mut r = cb[i].len();
            for &v in &ct[i]{
                while r > 0 && v+cb[i][r-1] >= mid+s[i]{
                    r -= 1;
                }
                ac += r;
            }
            r = cb[i].len();
            for &v in &ct[i]{
                while r > 0 && v+cb[i][r-1] >= mid{
                    r -= 1;
                }
                ac -= r;
            }
        }
        if ac < p{
            l = mid;
        } else {
            r = mid;
        }
    }
    let mut map = FxMap::default();
    for (i, (&b, &d)) in b.iter().zip(&d).enumerate(){
        map.entry(b).or_insert(FxMap::default()).insert(d, i);
    }
    for (i, (&t, &c)) in t.iter().zip(&c).enumerate(){
        if let Some(mp) = map.get(&(r-t)){
            while let Some((&p, &idx)) = mp.iter().next(){
                if p==c{continue;}
                println!("{} {}", i+1, idx+1);
                return;
            }
        }
        if let Some(mp) = map.get(&(r+s[c]-t)){
            if let Some(&res) = mp.get(&c){
                println!("{} {}", i+1, res);
                return;
            }
        }
    }
}

//#[fastout]
fn main() {
    if MULTI{
        input!{
            t: usize,
        }
        for _ in 0..t{
            solve();
        }
    } else {
        solve();
    }
}