Submission #1661323


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 mut a = Vec::with_capacity(n);
    for _ in 0..n {
        let x = readl!(usize);
        a.push(x);
    }
    let a = a;
    let mut num = 1;
    let mut ans = 0;
    for (i, e) in a.iter().enumerate() {
        // debug!(num);
        if *e%num == 0 {
            // debug!(*e/num-1);
            // debug!(i);
            ans += *e/num-1;
            if(num == 1 || *e == num){
                num += 1;
            }
        } else {
            // debug!(*e/num);
            ans += *e/num;
        }
    }
    // debug!(num);
    println!("{}", ans);
}

Submission Info

Submission Time
Task D - Greedy customers
User sntea
Language Rust (1.15.1)
Score 700
Code Size 2141 Byte
Status AC
Exec Time 17 ms
Memory 4352 KB

Compile Error

warning: unnecessary parentheses around `if` condition, #[warn(unused_parens)] on by default
  --> ./Main.rs:83:15
   |
83 |             if(num == 1 || *e == num){
   |               ^^^^^^^^^^^^^^^^^^^^^^^

warning: function is never used: `printiter`, #[warn(dead_code)] on by default
  --> ./Main.rs:54:1
   |
54 | fn printiter<'a, T>(v: &'a T)
   | ^

warning: unused variable: `i`, #[warn(unused_variables)] on by default
  --> ./Main.rs:77:10
   |
77 |     for (i, e) in a.iter().enumerate() {
   |          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 46
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 17 ms 4352 KB
02.txt AC 17 ms 4352 KB
03.txt AC 16 ms 4352 KB
04.txt AC 16 ms 4352 KB
05.txt AC 15 ms 4352 KB
06.txt AC 15 ms 4352 KB
07.txt AC 14 ms 4352 KB
08.txt AC 14 ms 4352 KB
09.txt AC 14 ms 4352 KB
10.txt AC 14 ms 4352 KB
11.txt AC 13 ms 4352 KB
12.txt AC 14 ms 4352 KB
13.txt AC 16 ms 4352 KB
14.txt AC 16 ms 4352 KB
15.txt AC 16 ms 4352 KB
16.txt AC 16 ms 4352 KB
17.txt AC 16 ms 4352 KB
18.txt AC 16 ms 4352 KB
19.txt AC 16 ms 4352 KB
20.txt AC 16 ms 4352 KB
21.txt AC 15 ms 4352 KB
22.txt AC 15 ms 4352 KB
23.txt AC 15 ms 4352 KB
24.txt AC 15 ms 4352 KB
25.txt AC 15 ms 4352 KB
26.txt AC 15 ms 4352 KB
27.txt AC 15 ms 4352 KB
28.txt AC 16 ms 4352 KB
29.txt AC 14 ms 4352 KB
30.txt AC 13 ms 4352 KB
31.txt AC 13 ms 4352 KB
32.txt AC 15 ms 4352 KB
33.txt AC 15 ms 4352 KB
34.txt AC 15 ms 4352 KB
35.txt AC 15 ms 4352 KB
36.txt AC 2 ms 4352 KB
37.txt AC 2 ms 4352 KB
38.txt AC 2 ms 4352 KB
39.txt AC 2 ms 4352 KB
40.txt AC 2 ms 4352 KB
41.txt AC 2 ms 4352 KB
42.txt AC 2 ms 4352 KB
43.txt AC 2 ms 4352 KB
44.txt AC 2 ms 4352 KB
s1.txt AC 2 ms 4352 KB
s2.txt AC 2 ms 4352 KB