結果

問題 No.743 Segments on a Polygon
ユーザー phsplsphspls
提出日時 2022-12-04 17:31:16
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 75 ms / 2,000 ms
コード長 2,545 bytes
コンパイル時間 13,277 ms
コンパイル使用メモリ 394,344 KB
実行使用メモリ 6,688 KB
最終ジャッジ日時 2024-10-11 20:11:22
合計ジャッジ時間 15,888 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 10
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> src/main.rs:5:5
  |
3 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
4 |     n: usize,
5 |     orgn: usize,
  |     ^^^^
  |
  = note: `SegmentTree` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
  = note: `#[warn(dead_code)]` on by default

ソースコード

diff #
プレゼンテーションモードにする

#[derive(Debug, Clone)]
struct SegmentTree<F, T> {
n: usize,
orgn: usize,
unit: T,
mem: Vec<T>,
operator: F
}
impl<F, T> SegmentTree<F, T> where
T: std::fmt::Debug + Copy,
F: Fn(T, T) -> T
{
fn new(n: usize, unit: T, operator: F) -> Self {
let mut size = 1usize;
while size < n { size *= 2; }
Self {
n: size,
orgn: n,
unit: unit,
mem: vec![unit; size*2-1],
operator: operator,
}
}
fn find_closed(&self, l: usize, r: usize) -> T {
self.find(l, r+1)
}
fn find(&self, l: usize, r: usize) -> T {
self._find(l, r, 0, 0, self.n)
}
fn set(&mut self, pos: usize, val: T) {
let mut pos = pos + self.n - 1;
self.mem[pos] = val;
while pos > 0 {
pos = self._parent(pos);
self.mem[pos] = (self.operator)(self.mem[self._left(pos)], self.mem[self._right(pos)]);
}
}
fn get(&mut self, pos: usize) -> T {
self.mem[pos + self.n - 1]
}
fn _find(&self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T {
if r <= a || b <= l {
return self.unit;
} else if a <= l && r <= b {
return self.mem[nodenum];
}
let left = self._find(a, b, self._left(nodenum), l, (l+r)/2);
let right = self._find(a, b, self._right(nodenum), (l+r)/2, r);
(self.operator)(left, right)
}
fn _left(&self, k: usize) -> usize {
2*k+1
}
fn _right(&self, k: usize) -> usize {
2*k+2
}
fn _parent(&self, k: usize) -> usize {
(k-1)/2
}
}
fn main() {
let mut nm = String::new();
std::io::stdin().read_line(&mut nm).ok();
let nm: Vec<usize> = nm.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
let n = nm[0];
let m = nm[1];
let mut lines = (0..n).map(|_| {
let mut temp = String::new();
std::io::stdin().read_line(&mut temp).ok();
let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
let a = temp[0];
let b = temp[1];
(a.min(b), a.max(b))
})
.collect::<Vec<_>>();
lines.sort();
let mut result = 0usize;
let mut segtree = SegmentTree::new(m, 0usize, |x, y| x + y);
for &(a, b) in lines.iter() {
result += segtree.find_closed(a, b);
let val = segtree.get(b);
segtree.set(b, val+1);
}
println!("{}", result);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0