結果
| 問題 | No.992 最長増加部分列の数え上げ |
| ユーザー |
 akiradeveloper
|
| 提出日時 | 2020-02-14 23:24:40 |
| 言語 | Rust (1.77.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,356 bytes |
| コンパイル時間 | 1,534 ms |
| コンパイル使用メモリ | 178,560 KB |
| 実行使用メモリ | 10,880 KB |
| 最終ジャッジ日時 | 2024-04-16 02:56:39 |
| 合計ジャッジ時間 | 11,602 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
5,248 KB |
| testcase_01 | AC | 1 ms
5,376 KB |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | WA | - |
| testcase_36 | WA | - |
| testcase_37 | WA | - |
| testcase_38 | WA | - |
| testcase_39 | WA | - |
| testcase_40 | WA | - |
| testcase_41 | WA | - |
| testcase_42 | WA | - |
| testcase_43 | WA | - |
| testcase_44 | WA | - |
コンパイルメッセージ
warning: type `SUM_RAQ` should have an upper camel case name
--> main.rs:135:8
|
135 | struct SUM_RAQ;
| ^^^^^^^ help: convert the identifier to upper camel case: `SumRaq`
|
= note: `#[warn(non_camel_case_types)]` on by default
warning: unused variable: `len`
--> main.rs:204:39
|
204 | fn propagate(&mut self, k: usize, len: usize) {
| ^^^ help: if this is intentional, prefix it with an underscore: `_len`
|
= note: `#[warn(unused_variables)]` on by default
warning: method `set_weight` is never used
--> main.rs:201:8
|
171 | impl<T: SEGImpl> SEG<T> {
| ----------------------- method in this implementation
...
201 | fn set_weight(&mut self, weight: &[usize]) {
| ^^^^^^^^^^
|
= note: `#[warn(dead_code)]` on by default
warning: unused `Result` that must be used
--> main.rs:130:13
|
130 | writeln!(out,"{}",cnt.query(i,i+1));
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
|
= note: this `Result` may be an `Err` variant, which should be handled
= note: `#[warn(unused_must_use)]` on by default
= note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info)
warning: 4 warnings emitted
ソースコード
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[macro_export]
macro_rules ! chmax { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: max ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! chmin { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: min ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! max { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: max ( $ x , max ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: min ( $ x , min ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! dvec { ( $ t : expr ; $ len : expr ) => { vec ! [ $ t ; $ len ] } ; ( $ t : expr ; $ len : expr , $ ( $ rest : expr ) ,* ) => { vec ! [ dvec ! ( $ t ; $ ( $ rest ) ,* ) ; $ len ] } ; }
#[doc = " main"]
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[macro_export]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut parser = Parser :: from_str ( $ s ) ; input_inner ! { parser , $ ( $ r ) * } } ; ( parser = $ parser : ident , $ ( $ r : tt ) * ) => { input_inner ! { $ parser , $ ( $ r ) * } } ; ( new_stdin_parser = $ parser : ident , $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let reader = std :: io :: BufReader :: new ( stdin . lock ( ) ) ; let mut $ parser = Parser :: new ( reader ) ; input_inner ! { $ parser , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { input ! { new_stdin_parser = parser , $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! input_inner { ( $ parser : ident ) => { } ; ( $ parser : ident , ) => { } ; ( $ parser : ident , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ parser , $ t ) ; input_inner ! { $ parser $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! read_value { ( $ parser : ident , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ parser , $ t ) ) ,* ) } ; ( $ parser : ident , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ parser , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ parser : ident , chars ) => { read_value ! ( $ parser , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ parser : ident , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
reader: R,
buf: Vec<u8>,
pos: usize,
}
impl Parser<io::Empty> {
pub fn from_str(s: &str) -> Parser<io::Empty> {
Parser {
reader: io::empty(),
buf: s.as_bytes().to_vec(),
pos: 0,
}
}
}
impl<R: BufRead> Parser<R> {
pub fn new(reader: R) -> Parser<R> {
Parser {
reader: reader,
buf: vec![],
pos: 0,
}
}
pub fn update_buf(&mut self) {
self.buf.clear();
self.pos = 0;
loop {
let (len, complete) = {
let buf2 = self.reader.fill_buf().unwrap();
self.buf.extend_from_slice(buf2);
let len = buf2.len();
if len == 0 {
break;
}
(len, buf2[len - 1] <= 0x20)
};
self.reader.consume(len);
if complete {
break;
}
}
}
pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
loop {
let mut begin = self.pos;
while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
begin += 1;
}
let mut end = begin;
while end < self.buf.len() && (self.buf[end] > 0x20) {
end += 1;
}
if begin != self.buf.len() {
self.pos = end;
return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
} else {
self.update_buf();
}
}
}
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
use std::thread;
if BIG_STACK_SIZE {
thread::Builder::new()
.stack_size(32 * 1024 * 1024)
.name("solve".into())
.spawn(solve)
.unwrap()
.join()
.unwrap();
} else {
solve();
}
}
fn solve() {
let out = stdout();
let mut out = BufWriter::new(out.lock());
input!{
n:usize,
a:[i64;n],
}
let inf = std::i64::MAX;
let mut dp = vec![inf;n];
let mut cnt: SEG<SUM_RAQ> = SEG::new(0, n);
for i in 0..n {
let x = a[i];
let r = dp.lower_bound(&x);
dp[r] = min(dp[r], x);
cnt.update(r,r+1,1);
if cnt.query(r,r+1) > 1 {
cnt.update(r+1,n,1);
}
}
for i in (0..n).rev() {
if dp[i] != inf {
writeln!(out,"{}",cnt.query(i,i+1));
return
}
}
}
struct SUM_RAQ;
impl SEGImpl for SUM_RAQ {
type Monoid = i64;
type OperatorMonoid = i64;
fn m0() -> Self::Monoid {
0
}
fn om0() -> Self::OperatorMonoid {
0
}
fn f(x: Self::Monoid, y: Self::Monoid) -> Self::Monoid {
x + y
}
fn g(x: Self::Monoid, y: Self::OperatorMonoid, len: usize) -> Self::Monoid {
x + (len as i64) * y
}
fn h(x: Self::OperatorMonoid, y: Self::OperatorMonoid) -> Self::OperatorMonoid {
x + y
}
}
#[doc = " https://ei1333.github.io/luzhiled/snippets/structure/segment-tree.html"]
trait SEGImpl {
type Monoid: Copy;
type OperatorMonoid: Copy + PartialEq;
fn m0() -> Self::Monoid;
fn om0() -> Self::OperatorMonoid;
fn f(x: Self::Monoid, y: Self::Monoid) -> Self::Monoid;
fn g(x: Self::Monoid, y: Self::OperatorMonoid, len: usize) -> Self::Monoid;
fn h(x: Self::OperatorMonoid, y: Self::OperatorMonoid) -> Self::OperatorMonoid;
}
struct SEG<T: SEGImpl> {
n: usize,
data: Vec<T::Monoid>,
lazy: Vec<T::OperatorMonoid>,
weight: Vec<usize>,
}
impl<T: SEGImpl> SEG<T> {
fn new(init: T::Monoid, n: usize) -> SEG<T> {
let mut m = 1;
while m < n {
m *= 2;
}
SEG {
n: m,
data: vec![init; m * 2],
lazy: vec![T::om0(); m * 2],
weight: Self::mk_weight(&vec![1; n]),
}
}
fn mk_weight(xs: &[usize]) -> Vec<usize> {
let n = xs.len();
let mut m = 1;
while m < n {
m *= 2;
}
let mut res = vec![0; 2 * m];
for i in 0..n {
res[m + i] = xs[i];
}
for k in (1..m).rev() {
let l = 2 * k;
let r = 2 * k + 1;
res[k] = res[l] + res[r];
}
res
}
fn set_weight(&mut self, weight: &[usize]) {
self.weight = Self::mk_weight(weight);
}
fn propagate(&mut self, k: usize, len: usize) {
let len = self.weight[k];
if self.lazy[k] != T::om0() {
if k < self.n {
self.lazy[2 * k + 0] = T::h(self.lazy[2 * k + 0], self.lazy[k]);
self.lazy[2 * k + 1] = T::h(self.lazy[2 * k + 1], self.lazy[k]);
}
self.data[k] = T::g(self.data[k], self.lazy[k], len);
self.lazy[k] = T::om0();
}
}
fn do_update(
&mut self,
a: usize,
b: usize,
x: T::OperatorMonoid,
k: usize,
l: usize,
r: usize,
) -> T::Monoid {
self.propagate(k, r - l);
if r <= a || b <= l {
self.data[k]
} else if a <= l && r <= b {
self.lazy[k] = T::h(self.lazy[k], x);
self.propagate(k, r - l);
self.data[k]
} else {
self.data[k] = T::f(
self.do_update(a, b, x, 2 * k + 0, l, (l + r) >> 1),
self.do_update(a, b, x, 2 * k + 1, (l + r) >> 1, r),
);
self.data[k]
}
}
fn update(&mut self, a: usize, b: usize, x: T::OperatorMonoid) -> T::Monoid {
let n = self.n;
self.do_update(a, b, x, 1, 0, n)
}
fn do_query(&mut self, a: usize, b: usize, k: usize, l: usize, r: usize) -> T::Monoid {
self.propagate(k, r - l);
if r <= a || b <= l {
T::m0()
} else if a <= l && r <= b {
self.data[k]
} else {
T::f(
self.do_query(a, b, 2 * k + 0, l, (l + r) >> 1),
self.do_query(a, b, 2 * k + 1, (l + r) >> 1, r),
)
}
}
fn query(&mut self, a: usize, b: usize) -> T::Monoid {
let n = self.n;
self.do_query(a, b, 1, 0, n)
}
}
#[doc = " Equivalent to std::lowerbound and std::upperbound in c++"]
pub trait LowerBound<T> {
fn lower_bound(&self, x: &T) -> usize;
fn upper_bound(&self, x: &T) -> usize;
}
impl<T: Ord> LowerBound<T> for [T] {
fn lower_bound(&self, x: &T) -> usize {
let mut low = 0;
let mut high = self.len();
while low != high {
let mid = (low + high) / 2;
match self[mid].cmp(x) {
Ordering::Less => {
low = mid + 1;
}
Ordering::Equal | Ordering::Greater => {
high = mid;
}
}
}
low
}
fn upper_bound(&self, x: &T) -> usize {
let mut low = 0;
let mut high = self.len();
while low != high {
let mid = (low + high) / 2;
match self[mid].cmp(x) {
Ordering::Less | Ordering::Equal => {
low = mid + 1;
}
Ordering::Greater => {
high = mid;
}
}
}
low
}
}