Submission #1221283
Source Code Expand
use std::io::{self, Stdin}; use std::str::{self, FromStr}; use std::error::Error; fn exec() { let mut sc = Scanner::new(); let n: usize = sc.ne(); let a: Vec<i64> = (0..n).map(|_| sc.ne()).collect(); enum State { Down, Up, Same, } let mut s = State::Same; let mut cnt = 1; for i in 1..n { let b = a[i - 1]; let c = a[i]; if b == c { continue; } if b > c { s = match s { State::Up => { cnt += 1; State::Same } _ => State::Down, }; } else if b < c { s = match s { State::Down => { cnt += 1; State::Same } _ => State::Up, } } } println!("{}", cnt); } fn main() { const STACK: usize = 16 * 1024 * 1024; let _ = std::thread::Builder::new() .stack_size(STACK) .spawn(|| { exec(); }) .unwrap() .join() .unwrap(); } #[allow(dead_code)] struct Scanner { stdin: Stdin, id: usize, buf: Vec<u8>, } #[allow(dead_code)] impl Scanner { fn new() -> Scanner { Scanner { stdin: io::stdin(), id: 0, buf: Vec::new(), } } fn next_line(&mut self) -> Option<String> { let mut res = String::new(); match self.stdin.read_line(&mut res) { Ok(0) => None, Ok(_) => Some(res), Err(why) => panic!("error in read_line: {}", why.description()), } } fn next<T: FromStr>(&mut self) -> Option<T> { while self.buf.len() == 0 { self.buf = match self.next_line() { Some(r) => { self.id = 0; r.trim().as_bytes().to_owned() } None => return None, }; } let l = self.id; assert!(self.buf[l] != b' '); let n = self.buf.len(); let mut r = l; while r < n && self.buf[r] != b' ' { r += 1; } let res = match str::from_utf8(&self.buf[l..r]).ok().unwrap().parse::<T>() { Ok(s) => Some(s), Err(_) => { panic!("parse error, {:?}", String::from_utf8(self.buf[l..r].to_owned())) } }; while r < n && self.buf[r] == b' ' { r += 1; } if r == n { self.buf.clear(); } else { self.id = r; } res } fn ne<T: FromStr>(&mut self) -> T { self.next::<T>().unwrap() } }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | mio_h1917 |
Language | Rust (1.15.1) |
Score | 300 |
Code Size | 2851 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 12668 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 3 ms | 8572 KB |
sample_02.txt | AC | 3 ms | 8572 KB |
sample_03.txt | AC | 3 ms | 8572 KB |
subtask_1_01.txt | AC | 7 ms | 10620 KB |
subtask_1_02.txt | AC | 5 ms | 8572 KB |
subtask_1_03.txt | AC | 4 ms | 8572 KB |
subtask_1_04.txt | AC | 9 ms | 12668 KB |
subtask_1_05.txt | AC | 9 ms | 12668 KB |
subtask_1_06.txt | AC | 9 ms | 12668 KB |
subtask_1_07.txt | AC | 9 ms | 12668 KB |
subtask_1_08.txt | AC | 9 ms | 12668 KB |
subtask_1_09.txt | AC | 9 ms | 12668 KB |
subtask_1_10.txt | AC | 3 ms | 8572 KB |
subtask_1_11.txt | AC | 3 ms | 8572 KB |