結果
| 問題 | No.942 プレゼント配り |
| ユーザー |
 akiradeveloper
|
| 提出日時 | 2019-12-05 01:01:24 |
| 言語 | Rust (1.77.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,131 bytes |
| コンパイル時間 | 1,567 ms |
| コンパイル使用メモリ | 174,052 KB |
| 実行使用メモリ | 19,588 KB |
| 最終ジャッジ日時 | 2023-08-21 08:50:14 |
| 合計ジャッジ時間 | 4,247 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,376 KB |
| testcase_01 | AC | 36 ms
19,520 KB |
| testcase_02 | AC | 5 ms
5,540 KB |
| testcase_03 | AC | 5 ms
5,576 KB |
| testcase_04 | AC | 28 ms
7,788 KB |
| testcase_05 | AC | 37 ms
19,588 KB |
| testcase_06 | AC | 6 ms
5,576 KB |
| testcase_07 | AC | 1 ms
4,380 KB |
| testcase_08 | AC | 22 ms
5,888 KB |
| testcase_09 | AC | 25 ms
6,908 KB |
| testcase_10 | AC | 1 ms
4,380 KB |
| testcase_11 | AC | 2 ms
4,380 KB |
| testcase_12 | AC | 6 ms
5,656 KB |
| testcase_13 | AC | 1 ms
4,380 KB |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | AC | 1 ms
4,380 KB |
| testcase_19 | AC | 1 ms
4,376 KB |
コンパイルメッセージ
warning: use of deprecated associated function `std::slice::<impl [T]>::connect`: renamed to join
--> Main.rs:168:35
|
168 | let s = vec_to_string(&v).connect(" ");
| ^^^^^^^
|
= note: `#[warn(deprecated)]` on by default
warning: unused variable: `out`
--> Main.rs:112:13
|
112 | let mut out = BufWriter::new(out.lock());
| ^^^ help: if this is intentional, prefix it with an underscore: `_out`
|
= note: `#[warn(unused_variables)]` on by default
warning: variable does not need to be mutable
--> Main.rs:112:9
|
112 | let mut out = BufWriter::new(out.lock());
| ----^^^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: associated function `add` is never used
--> Main.rs:190:8
|
190 | fn add(&mut self, i: usize, x: usize) {
| ^^^
|
= note: `#[warn(dead_code)]` on by default
warning: 4 warnings emitted
ソースコード
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[macro_export]
macro_rules ! chmax { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: max ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! chmin { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: min ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! max { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: max ( $ x , max ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: min ( $ x , min ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! dvec { ( $ t : expr ; $ len : expr ) => { vec ! [ $ t ; $ len ] } ; ( $ t : expr ; $ len : expr , $ ( $ rest : expr ) ,* ) => { vec ! [ dvec ! ( $ t ; $ ( $ rest ) ,* ) ; $ len ] } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[macro_export]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut parser = Parser :: from_str ( $ s ) ; input_inner ! { parser , $ ( $ r ) * } } ; ( parser = $ parser : ident , $ ( $ r : tt ) * ) => { input_inner ! { $ parser , $ ( $ r ) * } } ; ( new_stdin_parser = $ parser : ident , $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let reader = std :: io :: BufReader :: new ( stdin . lock ( ) ) ; let mut $ parser = Parser :: new ( reader ) ; input_inner ! { $ parser , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { input ! { new_stdin_parser = parser , $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! input_inner { ( $ parser : ident ) => { } ; ( $ parser : ident , ) => { } ; ( $ parser : ident , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ parser , $ t ) ; input_inner ! { $ parser $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! read_value { ( $ parser : ident , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ parser , $ t ) ) ,* ) } ; ( $ parser : ident , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ parser , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ parser : ident , chars ) => { read_value ! ( $ parser , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ parser : ident , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
reader: R,
buf: Vec<u8>,
pos: usize,
}
impl Parser<io::Empty> {
pub fn from_str(s: &str) -> Parser<io::Empty> {
Parser {
reader: io::empty(),
buf: s.as_bytes().to_vec(),
pos: 0,
}
}
}
impl<R: BufRead> Parser<R> {
pub fn new(reader: R) -> Parser<R> {
Parser {
reader: reader,
buf: vec![],
pos: 0,
}
}
pub fn update_buf(&mut self) {
self.buf.clear();
self.pos = 0;
loop {
let (len, complete) = {
let buf2 = self.reader.fill_buf().unwrap();
self.buf.extend_from_slice(buf2);
let len = buf2.len();
if len == 0 {
break;
}
(len, buf2[len - 1] <= 0x20)
};
self.reader.consume(len);
if complete {
break;
}
}
}
pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
loop {
let mut begin = self.pos;
while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
begin += 1;
}
let mut end = begin;
while end < self.buf.len() && (self.buf[end] > 0x20) {
end += 1;
}
if begin != self.buf.len() {
self.pos = end;
return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
} else {
self.update_buf();
}
}
}
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
use std::thread;
if BIG_STACK_SIZE {
thread::Builder::new()
.stack_size(32 * 1024 * 1024)
.name("solve".into())
.spawn(solve)
.unwrap()
.join()
.unwrap();
} else {
solve();
}
}
fn solve() {
let out = stdout();
let mut out = BufWriter::new(out.lock());
input!{
n:usize,
k:usize,
}
let mut v = VecDeque::new();
let mut cum1 = CumSum1::new(n);
for i in 1..n+1 {
v.push_back(i);
cum1.set(i-1,i);
}
cum1.build();
let total = n*(n+1)/2;
if total % k != 0 {
println!("No");
return
}
let sum = total/k;
let mut fi = None;
let m = n/k;
for j in 0..m+1 {
let l = cum1.query(0, j); // j
let r = cum1.query(n-(m-j), n); // m-j
if l+r == sum {
fi = Some(j)
}
}
if fi.is_none() {
println!("No");
return
}
let mut res = vec![];
let fi = fi.unwrap();
let la = m-fi;
while !v.is_empty() {
let mut tmp = vec![];
for _ in 0..fi {
if let Some(x) = v.pop_front() {
tmp.push(x);
}
}
for _ in 0..la {
if let Some(x) = v.pop_back() {
tmp.push(x);
}
}
res.push(tmp);
}
println!("Yes");
for v in res {
let s = vec_to_string(&v).connect(" ");
println!("{}", s);
}
}
pub fn vec_to_string<T: ToString>(xs: &[T]) -> Vec<String> {
let mut res = vec![];
for x in xs {
res.push(x.to_string());
}
res
}
struct CumSum1 {
base: Vec<usize>,
dp: Vec<usize>,
}
impl CumSum1 {
fn new(n: usize) -> CumSum1 {
CumSum1 {
base: vec![0; n],
dp: vec![],
}
}
fn add(&mut self, i: usize, x: usize) {
self.base[i] += x;
}
fn set(&mut self, i: usize, x: usize) {
self.base[i] = x;
}
fn build(&mut self) {
let n = self.base.len();
let mut dp = vec![0; n + 1];
let mut acc = 0;
for i in 0..n {
acc += self.base[i];
dp[i + 1] = acc;
}
self.dp = dp;
}
#[doc = "[i,j)"]
fn query(&self, i: usize, j: usize) -> usize {
self.dp[j] - self.dp[i]
}
}