結果

問題 No.2373 wa, wo, n
ユーザー kenichikenichi
提出日時 2023-07-13 17:07:34
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 7,782 bytes
コンパイル時間 14,124 ms
コンパイル使用メモリ 378,872 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-15 03:27:26
合計ジャッジ時間 16,092 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 1 ms
5,248 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 1 ms
5,376 KB
testcase_11 AC 1 ms
5,376 KB
testcase_12 AC 1 ms
5,376 KB
testcase_13 AC 1 ms
5,376 KB
testcase_14 WA -
testcase_15 AC 1 ms
5,376 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 3 ms
5,376 KB
testcase_21 AC 1 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 2 ms
5,376 KB
testcase_24 AC 1 ms
5,376 KB
testcase_25 AC 1 ms
5,376 KB
testcase_26 AC 1 ms
5,376 KB
testcase_27 AC 1 ms
5,376 KB
testcase_28 AC 1 ms
5,376 KB
testcase_29 AC 1 ms
5,376 KB
testcase_30 WA -
testcase_31 AC 1 ms
5,376 KB
testcase_32 WA -
testcase_33 AC 3 ms
5,376 KB
testcase_34 AC 4 ms
5,376 KB
testcase_35 AC 3 ms
5,376 KB
testcase_36 AC 4 ms
5,376 KB
testcase_37 AC 3 ms
5,376 KB
testcase_38 AC 3 ms
5,376 KB
testcase_39 AC 3 ms
5,376 KB
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #

use std::io::*;
use std::str::FromStr;
/*
//use std::num;
//use std::cmp;
//use std::collections::VecDeque;
//use std::io::{self, BufRead};
const LOW_CASE_ALPHABET: [char; 26] = [
    'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
    't', 'u', 'v', 'w', 'x', 'y', 'z',
];
*/

fn main() {
    let n: usize = read();
    let s = read_array();
    let mut flag = 1;
    let mut i = 0;

    //for _i in 0..tmp.len(){

    for _i in 0..n {
        if s[_i] != '?' && s[_i] != 'a' && s[_i] != 'w' && s[_i] != 'n' && s[_i] != 'o' {
            flag = 0;
        }
    }

    if flag != 0 {
        loop {
            if i >= s.len() - 1 {
                break;
            }

            if (s[i] == 'w' || s[i] == '?') && i != s.len() - 1 && s[i + 1] == '?' {
                flag = 1;
            } else if (s[i + 1] == 'a' || s[i + 1] == 'o') && s[i] == '?' {
                flag = 1;
            } else if s[i] == '?' && s[i + 1] == '?' {
                flag = 1;
            }

            if (s[i + 1] == 'a' || s[i + 1] == 'o') && (s[i] != 'w' && s[i] != '?') {
                flag = 0;
                break;
            } else if (s[i] != 'a' && s[i] != 'o' && s[i] != '?') && s[i + 1] == 'w' && s[i + 2] == 'n'{
                flag = 0;
                break;
            } else if s[i] == 'w' && s[i + 1] == '?' && (s[i + 2] != 'n' && s[i + 2] != '?') {
                flag = 0;
                break;
            } else if n == 2 && (s[i] != 'w' && s[i] != '?' && s[i] != 'n')
                && (s[i + 1] == 'w' || s[i + 1] == 'n' || s[i + 1] == '?')
            {
                flag = 0;
                break;
            }

            /*
                        if s[i] == 'w' && i != s.len() - 1{
                            if s[i + 1] == 'a' || s[i + 1] == 'o'{
                                flag = 1;
                                i += 1;
                            }else{
                                flag = 0;
                                i += 1;
                            }
                        }else if s[i] == 'n'{
                            flag = 1;
                        }else if s[i] != 'w' && s[i] != 'n'{
                            flag = 0;
                        }
            */

            if s[i] == 'w' {
                i += 2;
            }else{
                i += 1;
            }
        }
    }

    //}

    if n == 1 && (s[0] != 'n' && s[0] != '?') {
        flag = 0;
    }

    if flag == 0 {
        print!("No");
    } else {
        print!("Yes");
    }
}
/*
let mut temp = String::new();
    std::io::stdin().read_line(&mut temp).ok();
    let temp = temp
        .trim()
        .chars()
        .map(|c| c as usize - '0' as usize)
        .collect::<Vec<_>>();

    let mut iter = temp.iter(); // イテレータを取得

    let a: isize = *iter.next().unwrap() as isize;
    let b: isize = *iter.next().unwrap() as isize;
    let c: isize = *iter.next().unwrap() as isize;

*/
pub fn quicksort(numbers: &mut Vec<u64>) {
    if numbers.len() <= 1 {
        return;
    }

    let pivot = numbers.pop().unwrap();
    let mut lesser = Vec::new();
    let mut greater = Vec::new();

    for num in numbers.iter() {
        if *num <= pivot {
            lesser.push(*num);
        } else {
            greater.push(*num);
        }
    }

    quicksort(&mut lesser);
    quicksort(&mut greater);

    numbers.clear();
    numbers.extend(lesser);
    numbers.push(pivot);
    numbers.extend(greater);
}

pub fn is_leap_year(year: isize) -> bool {
    if ((year % 4 == 0) && (year % 100 != 0)) || (year % 400 == 0) {
        return true;
    } else {
        return false;
    }
}

pub fn ctoi(c: char) -> isize {
    let n = c as isize - '0' as isize;

    return n;
}

pub fn stoi(c: String) -> isize {
    let n = c.parse::<isize>().unwrap();

    return n;
}

pub fn find_char(sentence: Vec<char>, target: char, start: isize) -> isize {
    for _i in start as usize..sentence.len() {
        if sentence[_i] == target {
            return _i as isize;
        }
    }
    return -1;
}

pub fn hex_to_binary(hex_string: &str, x: u32) -> Option<String> {
    match i64::from_str_radix(hex_string, x) {
        Ok(decimal) => Some(format!("{}", decimal)),
        Err(_) => None,
    }
}

pub fn my_floor(x: f64) -> f64 {
    let rounded = (x * 1000.0).floor() / 1000.0;

    rounded
}

pub fn upper_lower(x: char) -> char {
    let result: char;

    if x.is_uppercase() {
        result = x.to_ascii_lowercase();
    } else if x.is_lowercase() {
        result = x.to_ascii_uppercase();
    } else {
        result = x;
    }

    result
}

pub fn maxf_2(x: f64, y: f64) -> f64 {
    let result;

    if x >= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn max_2(x: isize, y: isize) -> isize {
    let result;

    if x >= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn max_u_2(x: usize, y: usize) -> usize {
    let result;

    if x >= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn min_u_2(x: usize, y: usize) -> usize {
    let result;

    if x <= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn min_2(x: isize, y: isize) -> isize {
    let result;

    if x >= y {
        result = y;
    } else {
        result = x;
    }

    result
}

pub fn min_2_i32(x: i32, y: i32) -> i32 {
    let result;

    if x >= y {
        result = y;
    } else {
        result = x;
    }

    result
}

pub fn max_3(x: isize, y: isize, z: isize) -> isize {
    let result;
    if x >= y && y >= z {
        result = x;
    } else if x >= z && z >= y {
        result = x;
    } else if y >= x && x >= z {
        result = y;
    } else if y >= z && z >= x {
        result = y;
    } else if z >= x && x >= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn max_u_3(x: usize, y: usize, z: usize) -> usize {
    let result;
    if x >= y && y >= z {
        result = x;
    } else if x >= z && z >= y {
        result = x;
    } else if y >= x && x >= z {
        result = y;
    } else if y >= z && z >= x {
        result = y;
    } else if z >= x && x >= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn min_3(x: isize, y: isize, z: isize) -> isize {
    let result;
    if x <= y && y <= z {
        result = x;
    } else if x <= z && z <= y {
        result = x;
    } else if y <= x && x <= z {
        result = y;
    } else if y <= z && z <= x {
        result = y;
    } else if z <= x && x <= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn min_u_3(x: usize, y: usize, z: usize) -> usize {
    let result;
    if x <= y && y <= z {
        result = x;
    } else if x <= z && z <= y {
        result = x;
    } else if y <= x && x <= z {
        result = y;
    } else if y <= z && z <= x {
        result = y;
    } else if z <= x && x <= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn read_text() -> String {
    let mut word = String::new();
    std::io::stdin().read_line(&mut word).ok();
    let answer = word.trim().to_string();

    answer
}

pub fn read_array() -> Vec<char> {
    let array: String = read();
    let chars: Vec<char> = array.trim().chars().collect::<Vec<char>>();
    chars
}

pub fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}
0