Submission #1695287
Source Code Expand
// use std::ops::{Index, IndexMut}; // use std::cmp::{Ordering, min, max}; // use std::collections::{BinaryHeap, BTreeMap}; // use std::collections::btree_map::Entry::{Occupied, Vacant}; // use std::clone::Clone; fn getline() -> String{ let mut res = String::new(); std::io::stdin().read_line(&mut res).ok(); res } macro_rules! readl { ($t: ty) => { { let s = getline(); s.trim().parse::<$t>().unwrap() } }; ($( $t: ty),+ ) => { { let s = getline(); let mut iter = s.trim().split(' '); ($(iter.next().unwrap().parse::<$t>().unwrap(),)*) } }; } macro_rules! readlvec { ($t: ty) => { { let s = getline(); let iter = s.trim().split(' '); iter.map(|x| x.parse().unwrap()).collect::<Vec<$t>>() } } } macro_rules! mvec { ($v: expr, $s: expr) => { vec![$v; $s] }; ($v: expr, $s: expr, $($t: expr),*) => { vec![mvec!($v, $($t),*); $s] }; } macro_rules! debug { ($x: expr) => { println!("{}: {:?}", stringify!($x), $x) } } fn printiter<'a, T>(v: &'a T) where &'a T: std::iter::IntoIterator, <&'a T as std::iter::IntoIterator>::Item: std::fmt::Display { for (i,e) in v.into_iter().enumerate() { if i != 0 { print!(" "); } print!("{}", e); } println!(""); } fn main() { let n = readl!(usize); let a = readlvec!(i64); let x = (n as i64)*(n as i64+1)/2; let sum: i64 = a.iter().sum(); if sum%x != 0 { println!("NO"); } else { let num = sum/x; // debug!(num); let mut ans = "YES"; let ad = { let mut res = Vec::with_capacity(n); for i in 0..n-1 { res.push(a[i+1]-a[i]); } res.push(a[0]-a[n-1]); res = res.into_iter().map(|x| x-num).collect(); res }; // debug!(ad); for e in &ad { if !(*e <= 0 && *e%n as i64 == 0) { ans = "NO"; } } println!("{}", ans); } }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | sntea |
Language | Rust (1.15.1) |
Score | 500 |
Code Size | 2275 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 8444 KB |
Compile Error
warning: function is never used: `printiter`, #[warn(dead_code)] on by default --> ./Main.rs:54:1 | 54 | fn printiter<'a, T>(v: &'a T) | ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 8 ms | 8444 KB |
in10.txt | AC | 3 ms | 4352 KB |
in11.txt | AC | 9 ms | 8444 KB |
in12.txt | AC | 9 ms | 8444 KB |
in13.txt | AC | 8 ms | 6396 KB |
in14.txt | AC | 2 ms | 4352 KB |
in15.txt | AC | 2 ms | 4352 KB |
in16.txt | AC | 2 ms | 4352 KB |
in17.txt | AC | 2 ms | 4352 KB |
in18.txt | AC | 2 ms | 4352 KB |
in19.txt | AC | 2 ms | 4352 KB |
in2.txt | AC | 9 ms | 8444 KB |
in20.txt | AC | 2 ms | 4352 KB |
in21.txt | AC | 8 ms | 6396 KB |
in22.txt | AC | 8 ms | 6396 KB |
in23.txt | AC | 8 ms | 6396 KB |
in24.txt | AC | 2 ms | 4352 KB |
in25.txt | AC | 3 ms | 4352 KB |
in26.txt | AC | 9 ms | 8444 KB |
in27.txt | AC | 9 ms | 8444 KB |
in3.txt | AC | 10 ms | 8444 KB |
in4.txt | AC | 9 ms | 8444 KB |
in5.txt | AC | 10 ms | 8444 KB |
in6.txt | AC | 7 ms | 6396 KB |
in7.txt | AC | 7 ms | 6396 KB |
in8.txt | AC | 3 ms | 4352 KB |
in9.txt | AC | 3 ms | 4352 KB |
sample1.txt | AC | 2 ms | 4352 KB |
sample2.txt | AC | 2 ms | 4352 KB |
sample3.txt | AC | 2 ms | 4352 KB |