結果

問題 No.2808 Concentration
ユーザー akakimidoriakakimidori
提出日時 2024-07-12 21:34:09
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 5,831 bytes
コンパイル時間 14,160 ms
コンパイル使用メモリ 400,844 KB
実行使用メモリ 16,068 KB
最終ジャッジ日時 2024-07-12 21:34:29
合計ジャッジ時間 19,295 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 AC 43 ms
14,488 KB
testcase_03 WA -
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 18 ms
6,940 KB
testcase_08 WA -
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 26 ms
9,728 KB
testcase_11 WA -
testcase_12 AC 13 ms
6,944 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 36 ms
14,124 KB
testcase_16 WA -
testcase_17 AC 40 ms
14,292 KB
testcase_18 AC 38 ms
14,012 KB
testcase_19 WA -
testcase_20 AC 36 ms
13,308 KB
testcase_21 AC 31 ms
11,824 KB
testcase_22 WA -
testcase_23 AC 22 ms
8,704 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 36 ms
13,836 KB
testcase_27 AC 40 ms
14,028 KB
testcase_28 WA -
testcase_29 AC 39 ms
13,924 KB
testcase_30 AC 37 ms
14,524 KB
testcase_31 AC 38 ms
14,156 KB
testcase_32 AC 38 ms
14,448 KB
testcase_33 WA -
testcase_34 AC 38 ms
13,936 KB
testcase_35 AC 39 ms
14,928 KB
testcase_36 AC 39 ms
14,588 KB
testcase_37 AC 39 ms
14,020 KB
testcase_38 AC 39 ms
14,780 KB
testcase_39 AC 40 ms
15,168 KB
testcase_40 AC 39 ms
15,044 KB
testcase_41 AC 37 ms
15,492 KB
testcase_42 WA -
testcase_43 WA -
testcase_44 AC 39 ms
15,796 KB
testcase_45 AC 39 ms
14,608 KB
testcase_46 AC 37 ms
14,336 KB
testcase_47 AC 1 ms
6,940 KB
testcase_48 WA -
testcase_49 AC 1 ms
6,944 KB
testcase_50 AC 1 ms
6,944 KB
testcase_51 AC 1 ms
6,944 KB
testcase_52 AC 1 ms
6,944 KB
testcase_53 AC 1 ms
6,940 KB
testcase_54 AC 1 ms
6,944 KB
testcase_55 AC 1 ms
6,944 KB
testcase_56 AC 1 ms
6,944 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused import: `std::io::Write`
 --> src/main.rs:1:5
  |
1 | use std::io::Write;
  |     ^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

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

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

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

ソースコード

diff # 

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,
        s: i64,
        h: i64,
        p: [(i64, i64, i64); n],
    }
    let mut p = p;
    p.retain(|p| p.1 - p.0 <= s);
    let n = p.len();
    let mut max = 0;
    let mut sum = 0;
    let mut x = 0;
    let mut y = 0;
    let mut dp = vec![0; n + 1];
    for i in 0..n {
        sum += p[i].2;
        let a = p[i].1 - h - s;
        let b = p[i].1 - s;
        while p[x].1 <= a {
            max = max.max(dp[x + 1]);
            x += 1;
        }
        while p[y].0 < b {
            sum -= p[y].2;
            y += 1;
        }
        dp[i + 1] = max + sum;
    }
    println!("{}", dp.into_iter().max().unwrap());
}

// ---------- 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 ----------
// ---------- begin segment tree Point Update Range Query ----------
pub struct SegmentTreePURQ<T, F> {
    n: usize,
    size: usize,
    data: Vec<T>,
    e: T,
    op: F,
}

impl<T, F> SegmentTreePURQ<T, F>
where
    T: Clone,
    F: Fn(&T, &T) -> T,
{
    pub fn new(n: usize, e: T, op: F) -> Self {
        assert!(n > 0);
        let size = n.next_power_of_two();
        let data = vec![e.clone(); 2 * size];
        SegmentTreePURQ {
            n,
            size,
            data,
            e,
            op,
        }
    }
    pub fn update_tmp(&mut self, x: usize, v: T) {
        assert!(x < self.n);
        self.data[x + self.size] = v;
    }
    pub fn update_all(&mut self) {
        for i in (1..self.size).rev() {
            self.data[i] = (self.op)(&self.data[2 * i], &self.data[2 * i + 1]);
        }
    }
    pub fn update(&mut self, x: usize, v: T) {
        assert!(x < self.n);
        let mut x = x + self.size;
        self.data[x] = v;
        x >>= 1;
        while x > 0 {
            self.data[x] = (self.op)(&self.data[2 * x], &self.data[2 * x + 1]);
            x >>= 1;
        }
    }
    pub fn find(&self, l: usize, r: usize) -> T {
        assert!(l <= r && r <= self.n);
        if l == r {
            return self.e.clone();
        }
        let mut l = self.size + l;
        let mut r = self.size + r;
        let mut x = self.e.clone();
        let mut y = self.e.clone();
        while l < r {
            if l & 1 == 1 {
                x = (self.op)(&x, &self.data[l]);
                l += 1;
            }
            if r & 1 == 1 {
                r -= 1;
                y = (self.op)(&self.data[r], &y);
            }
            l >>= 1;
            r >>= 1;
        }
        (self.op)(&x, &y)
    }
    pub fn max_right<P>(&self, l: usize, f: P) -> usize
    where
        P: Fn(&T) -> bool,
    {
        assert!(l <= self.n);
        assert!(f(&self.e));
        if l == self.n {
            return self.n;
        }
        let mut l = l + self.size;
        let mut sum = self.e.clone();
        while {
            l >>= l.trailing_zeros();
            let v = (self.op)(&sum, &self.data[l]);
            if !f(&v) {
                while l < self.size {
                    l <<= 1;
                    let v = (self.op)(&sum, &self.data[l]);
                    if f(&v) {
                        sum = v;
                        l += 1;
                    }
                }
                return l - self.size;
            }
            sum = v;
            l += 1;
            l.count_ones() > 1
        } {}
        self.n
    }
    pub fn min_left<P>(&self, r: usize, f: P) -> usize
    where
        P: Fn(&T) -> bool,
    {
        assert!(r <= self.n);
        assert!(f(&self.e));
        if r == 0 {
            return 0;
        }
        let mut r = r + self.size;
        let mut sum = self.e.clone();
        while {
            r -= 1;
            while r > 1 && r & 1 == 1 {
                r >>= 1;
            }
            let v = (self.op)(&self.data[r], &sum);
            if !f(&v) {
                while r < self.size {
                    r = 2 * r + 1;
                    let v = (self.op)(&self.data[r], &sum);
                    if f(&v) {
                        sum = v;
                        r -= 1;
                    }
                }
                return r + 1 - self.size;
            }
            sum = v;
            (r & (!r + 1)) != r
        } {}
        0
    }
}
// ---------- end segment tree Point Update Range Query ----------
0