#952578 (Rust) No.2639 Longest Increasing Walk

• 問題: No.2639 Longest Increasing Walk
• ユーザー: Moss_Local
• 提出日時: 2024-02-19 21:37:26
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 40 ms / 2,000 ms
• コード長: 4,413 bytes
• コンパイル時間: 1,153 ms
• コンパイル使用メモリ: 194,248 KB
• 実行使用メモリ: 12,656 KB
• 最終ジャッジ日時: 2024-02-19 21:37:35
• 合計ジャッジ時間: 2,969 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,676 KB
testcase_01	AC	0 ms; 6,676 KB
testcase_02	AC	1 ms; 6,676 KB
testcase_03	AC	1 ms; 6,676 KB
testcase_04	AC	26 ms; 10,752 KB
testcase_05	AC	34 ms; 12,104 KB
testcase_06	AC	37 ms; 12,092 KB
testcase_07	AC	37 ms; 12,528 KB
testcase_08	AC	38 ms; 12,116 KB
testcase_09	AC	40 ms; 12,656 KB
testcase_10	AC	39 ms; 10,436 KB
testcase_11	AC	34 ms; 7,040 KB
testcase_12	AC	5 ms; 6,676 KB
testcase_13	AC	40 ms; 9,088 KB
testcase_14	AC	23 ms; 6,676 KB
testcase_15	AC	0 ms; 6,676 KB
testcase_16	AC	1 ms; 6,676 KB
testcase_17	AC	21 ms; 6,676 KB
testcase_18	AC	28 ms; 7,040 KB
testcase_19	AC	8 ms; 6,676 KB
testcase_20	AC	17 ms; 6,676 KB
testcase_21	AC	35 ms; 7,040 KB
testcase_22	AC	12 ms; 6,676 KB
testcase_23	AC	1 ms; 6,676 KB
testcase_24	AC	1 ms; 6,676 KB
testcase_25	AC	2 ms; 6,676 KB
testcase_26	AC	1 ms; 6,676 KB
testcase_27	AC	1 ms; 6,676 KB
testcase_28	AC	1 ms; 6,676 KB
testcase_29	AC	1 ms; 6,676 KB
testcase_30	AC	1 ms; 6,676 KB
testcase_31	AC	1 ms; 6,676 KB
testcase_32	AC	1 ms; 6,676 KB

コンパイルメッセージ

warning: variable does not need to be mutable
   --> Main.rs:122:9
    |
122 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable does not need to be mutable
   --> Main.rs:128:9
    |
128 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:133:9
    |
133 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:139:9
    |
139 |     let mut vec: Vec<f64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:144:9
    |
144 |     let mut vec: Vec<char> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:149:9
    |
149 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:154:9
    |
154 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:160:9
    |
160 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: unused variable: `cnt`
   --> Main.rs:184:17
    |
184 |         let mut cnt = 1;
    |                 ^^^ help: if this is intentional, prefix it with an underscore: `_cnt`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
   --> Main.rs:184:13
    |
184 |         let mut cnt = 1;
    |             ---

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{
    // declear btreemap
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{
    // declear btreemap
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

fn main() {
    solve();
}

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

fn read_imat(h: usize) -> Vec<Vec<i64>> {
    (0..h).map(|_| read_vec()).collect()
}
fn read_cmat(h: usize) -> Vec<Vec<char>> {
    (0..h).map(|_| read::<String>().chars().collect()).collect()
}

fn solve() {
    let (h, w) = readuu();
    let mat = read_imat(h);
    let mut data = vec![];
    for i in 0..h {
        for j in 0..w {
            data.push((mat[i][j], i, j));
        }
    }
    data.sort();
    let mut dp = vec![vec![1; w]; h];
    for d in data {
        let (val, i, j) = d;
        let mut cnt = 1;
        for (dx, dy) in vec![(0, 1), (0, -1), (1, 0), (-1, 0)] {
            let ni = i as i64 + dx;
            let nj = j as i64 + dy;
            if ni < 0 || nj < 0 || ni >= h as i64 || nj >= w as i64 {
                continue;
            }
            if mat[ni as usize][nj as usize] > val {
                dp[ni as usize][nj as usize] = max(dp[ni as usize][nj as usize], dp[i][j] + 1);
            }
        }
    }
    let ma = dp.iter().map(|x| x.iter().max().unwrap()).max().unwrap();
    p!(ma);
    return;
}