結果

問題 No.464 PPAP
コンテスト
ユーザー hatoo
提出日時 2017-11-03 19:28:37
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 3,560 bytes
コンパイル時間 13,005 ms
コンパイル使用メモリ 390,420 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-22 15:41:48
合計ジャッジ時間 14,009 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 11 WA * 11
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{HashMap, HashSet, BinaryHeap, VecDeque};
#[allow(unused_imports)]
use std::iter::FromIterator;

mod util {
    use std::io::stdin;
    use std::str::FromStr;
    use std::fmt::Debug;

    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }

    #[allow(dead_code)]
    pub fn get<T: FromStr>() -> T
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().parse().unwrap()
    }

    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }

    #[allow(dead_code)]
    pub fn get2<T: FromStr, U: FromStr>() -> (T, U)
    where
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }

    #[allow(dead_code)]
    pub fn get3<S: FromStr, T: FromStr, U: FromStr>() -> (S, T, U)
    where
        <S as FromStr>::Err: Debug,
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }
}

#[allow(unused_macros)]
macro_rules! debug {
    ($x: expr) => {
        println!("{}: {:?}", stringify!($x), $x)
    }
}

fn main() {
    let s: Vec<char> = util::line().chars().collect();
    let mut front = Vec::new();
    let mut back = Vec::new();

    {
        let mut a = VecDeque::new();
        let mut b = VecDeque::new();

        for (i, &c) in s.iter().enumerate() {
            a.push_front(c);
            b.push_back(c);

            if a == b {
                front.push(i);
            }
        }
    }

    {
        let mut a = VecDeque::new();
        let mut b = VecDeque::new();

        for (i, &c) in s.iter().enumerate().rev() {
            a.push_front(c);
            b.push_back(c);

            if a == b {
                back.push(i);
            }
        }
    }

    let mut ans = 0;
    back.sort();
    for &p in &front {
        //let mut a = VecDeque::new();
        //let mut b = VecDeque::new();
        // Maybe it works.
        let mut a = 0;
        let mut b = 0;
        let mut sum = 0;

        for (&c, i) in s[p + 1..].iter().zip(1..) {
            //a.push_front(c);
            //b.push_back(c);
            a += i as u64 * c as u64;
            b += sum + c as u64;
            sum += c as u64;

            if a == b {
                ans += back.len() as u64 -
                    match back.binary_search(&(p + i + 2)) {
                        Ok(x) => x as u64,
                        Err(x) => x as u64,
                    };
            }
        }

    }
    println!("{}", ans);

}
0