#910306 (Rust) No.2454 Former < Latter

• 問題: No.2454 Former < Latter
• ユーザー: Moss_Local
• 提出日時: 2023-09-01 23:50:06
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 204 ms / 2,000 ms
• コード長: 7,759 bytes
• コンパイル時間: 13,198 ms
• コンパイル使用メモリ: 378,408 KB
• 実行使用メモリ: 5,688 KB
• 最終ジャッジ日時: 2024-06-11 06:06:08
• 合計ジャッジ時間: 12,316 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	0 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	6 ms; 5,684 KB
testcase_03	AC	5 ms; 5,644 KB
testcase_04	AC	5 ms; 5,680 KB
testcase_05	AC	4 ms; 5,684 KB
testcase_06	AC	5 ms; 5,552 KB
testcase_07	AC	5 ms; 5,684 KB
testcase_08	AC	4 ms; 5,376 KB
testcase_09	AC	4 ms; 5,376 KB
testcase_10	AC	5 ms; 5,376 KB
testcase_11	AC	5 ms; 5,688 KB
testcase_12	AC	5 ms; 5,664 KB
testcase_13	AC	5 ms; 5,680 KB
testcase_14	AC	5 ms; 5,684 KB
testcase_15	AC	6 ms; 5,376 KB
testcase_16	AC	5 ms; 5,376 KB
testcase_17	AC	204 ms; 5,376 KB
testcase_18	AC	8 ms; 5,376 KB
testcase_19	AC	6 ms; 5,684 KB
testcase_20	AC	7 ms; 5,680 KB
testcase_21	AC	6 ms; 5,376 KB
testcase_22	AC	5 ms; 5,376 KB
testcase_23	AC	5 ms; 5,376 KB

コンパイルメッセージ

warning: variable does not need to be mutable
   --> src/main.rs:268:9
    |
268 |     let mut v: Vec<char> = read::<String>().chars().map(|c| c as char).collect();
    |         ----^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: unused variable: `i`
   --> src/main.rs:300:9
    |
300 |     for i in 0..n {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`
    |
    = note: `#[warn(unused_variables)]` on by default

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::arch::x86_64::_MM_FROUND_NEARBYINT;
// 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");
        }
    };
}

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 str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readimat(h: usize, w: usize) -> Vec<Vec<i64>> {
    let mut mat = vec![vec![0; w]; h];
    for i in 0..h {
        let mut str = String::new();
        let _ = stdin().read_line(&mut str).unwrap();
        let mut iter = str.split_whitespace();
        for j in 0..w {
            mat[i][j] = iter.next().unwrap().parse::<i64>().unwrap();
        }
    }
    mat
}

fn readcmat(h: usize, w: usize) -> Vec<Vec<char>> {
    let mut mat = vec![vec!['.'; w]; h];
    for i in 0..h {
        let mut str = String::new();
        let _ = stdin().read_line(&mut str).unwrap();
        let mut iter = str.chars();
        for j in 0..w {
            mat[i][j] = iter.next().unwrap();
        }
    }
    mat
}

pub use self::z_algorithm::Zarray;
//https://atcoder.jp/contests/abc257/submissions/32730455
mod z_algorithm {
    #[derive(Clone, Debug)]
    pub struct Zarray {
        z: Vec<usize>,
    }
    impl Zarray {
        pub fn new<T: Eq>(s: &[T]) -> Self {
            let n = s.len();
            let mut z = vec![0; n];
            z[0] = n;
            let (mut i, mut j) = (1, 0);
            while i < n {
                while i + j < n && s[j] == s[i + j] {
                    j += 1;
                }
                z[i] = j;
                if j == 0 {
                    i += 1;
                    continue;
                }
                let mut k = 1;
                while i + k < n && k + z[k] < j {
                    z[i + k] = z[k];
                    k += 1;
                }
                i += k;
                j -= k;
            }
            Self { z }
        }
        pub fn search<T: Eq>(s: &[T], pat: &[T], sep: T) -> Vec<usize> {
            let mut res = vec![];
            let mut t = vec![];
            t.extend(pat);
            t.push(&sep);
            t.extend(s);
            let zarray = Self::new(&t);
            for i in 0..t.len() {
                if zarray[i] == pat.len() {
                    res.push(i - pat.len() - 1);
                }
            }
            res
        }
    }
    impl std::ops::Index<usize> for Zarray {
        type Output = usize;
        fn index(&self, index: usize) -> &usize {
            &self.z[index]
        }
    }
}

fn solve_part() {
    let n: usize = read();
    let mut v: Vec<char> = read::<String>().chars().map(|c| c as char).collect();
    let mut res = 0;
    let arr = Zarray::new(&v);
    for i in 1..n {
        let match_len = arr[i];
        let l_len = i;
        let r_len = n - i;
        if match_len > l_len {
            res += 1;
            continue;
        } else if match_len >= r_len {
            continue;
        }
        if match_len == l_len {
            if l_len < r_len {
                res += 1;
            }
            continue;
        }

        assert!(match_len + i < n);
        let l_c = v[match_len];
        let r_c = v[match_len + i];
        if l_c < r_c {
            res += 1;
        }
    }
    p!(res);
    return;
}
fn solve() {
    let n: usize = read();
    for i in 0..n {
        solve_part();
    }
    return;
}