Submission #40209384

Source Code Expand

#[allow(unused_imports)]
use petgraph::unionfind::UnionFind;
#[allow(unused_imports)]
use proconio::{fastout, input, marker::Chars, marker::Usize1};
#[allow(unused_imports)]
use std::collections::{BTreeSet, HashSet, VecDeque};

#[fastout]
fn main() {
    input! {
        n:usize,
        s:Chars,
    }
    for i in 0..n - 1 {
        if s[i] == s[i + 1] {
            println!("No");
            return;
        }
    }
    println!("Yes");
}

Submission Info

Submission Time
Task A - Alternately
User sou31415
Language Rust (1.42.0)
Score 100
Code Size 445 Byte
Status AC
Exec Time 4 ms
Memory 2136 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 11
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
random_01.txt AC 4 ms 2052 KiB
random_02.txt AC 3 ms 2028 KiB
random_03.txt AC 1 ms 2040 KiB
random_04.txt AC 4 ms 1948 KiB
random_05.txt AC 2 ms 2068 KiB
random_06.txt AC 2 ms 2068 KiB
random_07.txt AC 2 ms 2060 KiB
random_08.txt AC 2 ms 1988 KiB
sample_01.txt AC 2 ms 2072 KiB
sample_02.txt AC 2 ms 1988 KiB
sample_03.txt AC 2 ms 2136 KiB