結果
問題 |
No.3085 Easy Problems
|
ユーザー |
|
提出日時 | 2025-04-04 22:03:43 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 531 ms / 2,000 ms |
コード長 | 2,155 bytes |
コンパイル時間 | 26,762 ms |
コンパイル使用メモリ | 377,600 KB |
実行使用メモリ | 30,720 KB |
最終ジャッジ日時 | 2025-04-04 22:04:55 |
合計ジャッジ時間 | 35,936 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 31 |
ソースコード
//#![allow(unused)] #[allow(unused_imports)] use std::{ cell::RefCell, convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,}, fs::{File}, hash::{Hash, Hasher}, iter::{Product, Sum}, marker::PhantomData, ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds}, str::{FromStr, SplitWhitespace}, sync::{atomic::{self, AtomicU32, AtomicU64}, Once}, collections::{*, btree_map::Range}, mem::{swap}, cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd}, thread::LocalKey, f64::consts::PI, time::Instant, rc::Rc, io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write}, }; #[allow(unused_imports)] use proconio::{input, input_interactive, marker::{*}}; #[allow(unused_imports)] //use rand::{thread_rng, Rng, seq::SliceRandom}; #[allow(unused_imports)] //use ac_library::{*}; #[allow(dead_code)] const INF: i64 = 1<<60; #[allow(dead_code)] const MOD: i64 = 1000000007; #[allow(dead_code)] const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)]; //use proconio::fastout; //#[fastout] fn main() { input!{ n: usize, problem: [(i64, i64); n], q: usize, people: [(i64, i64); q], } let mut ty = Vec::new(); for &(_, v) in &problem{ ty.push(v); } for &(_, v) in &people{ ty.push(v); } ty.sort(); ty.dedup(); let mut dic = HashMap::new(); for (i, &v) in ty.iter().enumerate(){ dic.insert(v, i); } let k = ty.len(); let mut c = vec![Vec::new(); k]; let mut all = Vec::new(); for &(x, y) in &problem{ all.push(x); c[dic[&y]].push(x); } for i in 0..k{ c[i].sort(); } all.sort(); for &(x, y) in &people{ println!("{}", binary_search(x, &all)-binary_search(x, &c[dic[&y]])); } } 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 }