結果

問題 No.135 とりあえず1次元の問題
ユーザー kenichikenichi
提出日時 2023-07-09 17:25:29
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 5,112 bytes
コンパイル時間 16,026 ms
コンパイル使用メモリ 376,344 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-23 14:39:49
合計ジャッジ時間 13,325 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
6,812 KB
testcase_01 AC 0 ms
6,812 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 WA -
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 1 ms
6,944 KB
testcase_11 AC 1 ms
6,944 KB
testcase_12 AC 1 ms
6,944 KB
testcase_13 AC 0 ms
6,940 KB
testcase_14 AC 1 ms
6,948 KB
testcase_15 AC 1 ms
6,940 KB
testcase_16 AC 1 ms
6,940 KB
testcase_17 AC 1 ms
6,944 KB
testcase_18 AC 1 ms
6,944 KB
testcase_19 AC 1 ms
6,940 KB
testcase_20 AC 1 ms
6,944 KB
testcase_21 AC 10 ms
6,940 KB
testcase_22 AC 17 ms
6,940 KB
evil01.txt AC 16 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

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 mut x = vec![0; n];
	let mut abs = vec![0; n - 1];
	let mut ans = 1000000;

	for _i in 0..x.len(){
		x[_i] = read();
	}

	x.sort();

	for _i in 0..abs.len(){
		abs[_i] = x[_i + 1] - x[_i];
		if abs[_i] < ans && abs[_i] != 0{
			ans = abs[_i];
		}
	}

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

/*
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