examples/aizu_online_judge_lower_bound.rs

• View this file on GitHub
• Last update: 2024-04-26 00:41:30+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/courses/lesson/8/ITP2/6/ITP2_6_C

Depends on

• src/data_structure.rs
• src/data_structure/prefix_sum.rs
• src/data_structure/range_set.rs
• セグメント木 (src/data_structure/segment_tree.rs)
• src/data_structure/sorted_set.rs
• Union Find（素集合データ構造） (src/data_structure/union_find.rs)
• src/lib.rs
• src/math.rs
• src/math/binomial.rs
• src/utils.rs
• src/utils/binary_search.rs
• src/utils/compression.rs

Code

// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/lesson/8/ITP2/6/ITP2_6_C

use proconio::input;
use rust_procon_lib::utils::binary_search::binary_search::lower_bound;

fn main() {
    input! {
        n: usize,
        a: [usize; n],
        q: usize,
    }

    for _ in 0..q {
        input! {
            k: usize,
        }

        println!("{}", lower_bound(&a, k));
    }
}

Test cases

Env	Name	Status	Elapsed	Memory
Rust	00_sample_00.in	AC	5 ms	2 MB
Rust	01_small_00.in	AC	5 ms	2 MB
Rust	02_corner_00.in	AC	5 ms	2 MB
Rust	02_corner_01.in	AC	5 ms	2 MB
Rust	02_corner_02.in	AC	5 ms	2 MB
Rust	02_corner_03.in	AC	5 ms	2 MB
Rust	02_corner_04.in	AC	5 ms	2 MB
Rust	02_corner_05.in	AC	5 ms	2 MB
Rust	03_rand_00.in	AC	5 ms	2 MB
Rust	03_rand_01.in	AC	5 ms	2 MB
Rust	03_rand_02.in	AC	6 ms	2 MB
Rust	03_rand_03.in	AC	13 ms	2 MB
Rust	04_maximum_00.in	AC	6 ms	3 MB
Rust	04_maximum_01.in	AC	180 ms	5 MB
Rust	04_maximum_02.in	AC	194 ms	5 MB
Rust	04_maximum_03.in	AC	202 ms	5 MB
Rust	04_maximum_04.in	AC	190 ms	6 MB
Rust	04_maximum_05.in	AC	197 ms	6 MB
Rust	05_unique_00.in	AC	101 ms	4 MB
Rust	06_same_00.in	AC	176 ms	5 MB

Back to top page