結果
問題 | No.1619 Coccinellidae |
ユーザー |
![]() |
提出日時 | 2021-07-22 22:32:08 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 125 ms / 2,000 ms |
コード長 | 1,936 bytes |
コンパイル時間 | 12,428 ms |
コンパイル使用メモリ | 401,920 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-17 18:43:48 |
合計ジャッジ時間 | 15,021 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 16 |
ソースコード
#![allow(unused_imports)] use std::cmp::*; use std::collections::*; use std::io::Write; use std::ops::Bound::*; #[allow(unused_macros)] macro_rules! debug { ($($e:expr),*) => { #[cfg(debug_assertions)] $({ let (e, mut err) = (stringify!($e), std::io::stderr()); writeln!(err, "{} = {:?}", e, $e).unwrap() })* }; } fn main() { let v = read_vec::<i64>(); let (n, m, k) = (v[0], v[1], v[2]); if n == 1 { println!("{}", m); return; } let mut a = (0..n).map(|x| x).collect::<Vec<_>>(); let s = a.iter().sum::<i64>(); if s > m { println!("-1"); return; } let last = a.len() - 1; a[last] += m - s; let max_k = n * (n - 1) / 2; if k > max_k { println!("-1"); return; } let mut k = k; let mut pos = vec![n as usize; n as usize]; let mut used = vec![false; n as usize]; for i in 0..n - 1 { let diff = min(n - 1 - i, k); // debug!(diff, k); pos[i as usize] = (diff) as usize; used[pos[i as usize]] = true; k -= diff; if k == 0 { let mut pointer = 0; for j in i + 1..n { while used[pointer] { pointer += 1; } pos[j as usize] = pointer as usize; pointer += 1; } break; } } debug!(pos); let n = n as usize; let mut answers = vec![0; n]; for i in 0..n { answers[pos[i]] = a[i]; } for ans in answers { println!("{}", ans); } } fn read<T: std::str::FromStr>() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() }