結果
問題 | No.1703 Much Matching |
ユーザー |
|
提出日時 | 2021-10-08 23:17:11 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 380 ms / 2,000 ms |
コード長 | 4,130 bytes |
コンパイル時間 | 13,551 ms |
コンパイル使用メモリ | 403,004 KB |
実行使用メモリ | 22,912 KB |
最終ジャッジ日時 | 2024-07-23 07:07:50 |
合計ジャッジ時間 | 16,831 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
コンパイルメッセージ
warning: unused import: `BufWriter`
--> src/main.rs:5:22
|
5 | use std::io::{Write, BufWriter};
| ^^^^^^^^^
|
= note: `#[warn(unused_imports)]` on by default
warning: unused import: `Write`
--> src/main.rs:5:15
|
5 | use std::io::{Write, BufWriter};
| ^^^^^
warning: unused variable: `n`
--> src/main.rs:115:9
|
115 | n: usize, m: usize, q: usize,
| ^
|
help: `n` is captured in macro and introduced a unused variable
--> src/main.rs:25:13
|
25 | let next, $t);
| ^^^^
...
114 | / input! {
115 | | n: usize, m: usize, q: usize,
116 | | ab: [(usize1, usize1); q],
117 | | }
| |_____- in this macro invocation
= note: `#[warn(unused_variables)]` on by default
= note: this warning originates in the macro `input_inner` which comes from the expansion of the macro `input` (in Nightly builds, run with -Z macro-backtrace for more info)
ソースコード
#[allow(unused_imports)]use std::cmp::*;#[allow(unused_imports)]use std::collections::*;use std::io::{Write, BufWriter};// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_rules! input {($($r:tt)*) => {let stdin = std::io::stdin();let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));let mut next = move || -> String{bytes.by_ref().map(|r|r.unwrap() as char).skip_while(|c|c.is_whitespace()).take_while(|c|!c.is_whitespace()).collect()};input_inner!{next, $($r)*}};}macro_rules! input_inner {($next:expr) => {};($next:expr,) => {};($next:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($next, $t);input_inner!{$next $($r)*}};}macro_rules! read_value {($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };($next:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()};($next:expr, chars) => {read_value!($next, String).chars().collect::<Vec<char>>()};($next:expr, usize1) => (read_value!($next, usize) - 1);($next:expr, [ $t:tt ]) => {{let len = read_value!($next, usize);read_value!($next, [$t; len])}};($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));}/*** Segment Tree. This data structure is useful for fast folding on intervals of an array* whose elements are elements of monoid I. Note that constructing this tree requires the identity* element of I and the operation of I.* Verified by: yukicoder No. 259 (http://yukicoder.me/submissions/100581)* AGC015-E (http://agc015.contest.atcoder.jp/submissions/1461001)* yukicoder No. 833 (https://yukicoder.me/submissions/703521)*/struct SegTree<I, BiOp> {n: usize,dat: Vec<I>,op: BiOp,e: I,}impl<I, BiOp> SegTree<I, BiOp>where BiOp: Fn(I, I) -> I,I: Copy {pub fn new(n_: usize, op: BiOp, e: I) -> Self {let mut n = 1;while n < n_ { n *= 2; } // n is a power of 2SegTree {n: n, dat: vec![e; 2 * n - 1], op: op, e: e}}/* ary[k] <- v */pub fn update(&mut self, idx: usize, v: I) {let mut k = idx + self.n - 1;self.dat[k] = v;while k > 0 {k = (k - 1) / 2;self.dat[k] = (self.op)(self.dat[2 * k + 1], self.dat[2 * k + 2]);}}/* [a, b) (note: half-inclusive)* http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */#[allow(unused)]pub fn query(&self, mut a: usize, mut b: usize) -> I {let mut left = self.e;let mut right = self.e;a += self.n - 1;b += self.n - 1;while a < b {if (a & 1) == 0 {left = (self.op)(left, self.dat[a]);}if (b & 1) == 0 {right = (self.op)(self.dat[b - 1], right);}a = a / 2;b = (b - 1) / 2;}(self.op)(left, right)}}trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }impl<T: PartialOrd> Change for T {fn chmax(&mut self, x: T) { if *self < x { *self = x; } }fn chmin(&mut self, x: T) { if *self > x { *self = x; } }}fn main() {// In order to avoid potential stack overflow, spawn a new thread.let stack_size = 104_857_600; // 100 MBlet thd = std::thread::Builder::new().stack_size(stack_size);thd.spawn(|| solve()).unwrap().join().unwrap();}fn solve() {input! {n: usize, m: usize, q: usize,ab: [(usize1, usize1); q],}let mut ab = ab;ab.sort_by_key(|&(a, b)| (a, Reverse(b)));const INF: i64 = 1 << 50;let mut st = SegTree::new(m + 1, max, -INF);st.update(m, 0);for &(_a, b) in ab.iter().rev() {let val = st.query(b + 1, m + 1) + 1;let val = max(val, st.query(b, b + 1));st.update(b, val);}println!("{}", st.query(0, m + 1));}