結果
問題 | No.2263 Perms |
ユーザー | akakimidori |
提出日時 | 2023-04-07 22:09:08 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 6 ms / 2,000 ms |
コード長 | 8,395 bytes |
コンパイル時間 | 12,990 ms |
コンパイル使用メモリ | 378,176 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-02 19:39:53 |
合計ジャッジ時間 | 14,994 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 0 ms
5,248 KB |
testcase_04 | AC | 1 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 5 ms
5,248 KB |
testcase_07 | AC | 3 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 6 ms
5,248 KB |
testcase_10 | AC | 1 ms
5,248 KB |
testcase_11 | AC | 3 ms
5,248 KB |
testcase_12 | AC | 4 ms
5,248 KB |
testcase_13 | AC | 5 ms
5,248 KB |
testcase_14 | AC | 5 ms
5,248 KB |
testcase_15 | AC | 1 ms
5,248 KB |
testcase_16 | AC | 1 ms
5,248 KB |
testcase_17 | AC | 1 ms
5,248 KB |
testcase_18 | AC | 1 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 4 ms
5,248 KB |
testcase_21 | AC | 4 ms
5,248 KB |
testcase_22 | AC | 3 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 1 ms
5,248 KB |
testcase_25 | AC | 4 ms
5,248 KB |
testcase_26 | AC | 5 ms
5,248 KB |
testcase_27 | AC | 2 ms
5,248 KB |
testcase_28 | AC | 1 ms
5,248 KB |
testcase_29 | AC | 2 ms
5,248 KB |
testcase_30 | AC | 1 ms
5,248 KB |
testcase_31 | AC | 1 ms
5,248 KB |
testcase_32 | AC | 1 ms
5,248 KB |
testcase_33 | AC | 2 ms
5,248 KB |
testcase_34 | AC | 1 ms
5,248 KB |
testcase_35 | AC | 0 ms
5,248 KB |
testcase_36 | AC | 1 ms
5,248 KB |
testcase_37 | AC | 1 ms
5,248 KB |
testcase_38 | AC | 4 ms
5,248 KB |
testcase_39 | AC | 1 ms
5,248 KB |
testcase_40 | AC | 1 ms
5,248 KB |
ソースコード
fn main() { input! { n: usize, m: u32, a: [[u32; n]; n], } let mut ok = true; ok &= a.iter().all(|a| a.iter().sum::<u32>() == m); ok &= (0..n).all(|j| a.iter().map(|a| a[j]).sum::<u32>() == m); if !ok { println!("-1"); return; } let mut a = a; let mut ans = vec![]; for _ in 0..m { let mut g = maxflow::Graph::new(2 * n + 2); let src = 2 * n; let dst = src + 1; for i in 0..n { g.add_edge(src, i, 1); g.add_edge(i + n, dst, 1); } let mut e = vec![]; for (i, a) in a.iter().enumerate() { for (j, a) in a.iter().enumerate() { if *a > 0 { e.push(g.add_edge(i, n + j, 1)); } } } assert!(g.flow(src, dst) == (n as u32)); let mut p = vec![0; n]; for e in e.iter() { let (s, t, u, _) = g.get_edge(e); if u > 0 { a[s][t - n] -= 1; p[s] = t - n + 1; } } ans.push(p); } for a in ans { use util::*; println!("{}", a.iter().join(" ")); } } mod util { pub trait Join { fn join(self, sep: &str) -> String; } impl<T, I> Join for I where I: Iterator<Item = T>, T: std::fmt::Display, { fn join(self, sep: &str) -> String { let mut s = String::new(); use std::fmt::*; for (i, v) in self.enumerate() { if i > 0 { write!(&mut s, "{}", sep).ok(); } write!(&mut s, "{}", v).ok(); } s } } } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::<Vec<char>>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::<Vec<u8>>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- // ---------- begin max flow (Dinic) ---------- mod maxflow { pub trait MaxFlowCapacity: Copy + Ord + std::ops::Add<Output = Self> + std::ops::Sub<Output = Self> { fn zero() -> Self; fn inf() -> Self; } macro_rules! impl_primitive_integer_capacity { ($x:ty, $y:expr) => { impl MaxFlowCapacity for $x { fn zero() -> Self { 0 } fn inf() -> Self { $y } } }; } impl_primitive_integer_capacity!(u32, std::u32::MAX); impl_primitive_integer_capacity!(u64, std::u64::MAX); impl_primitive_integer_capacity!(i32, std::i32::MAX); impl_primitive_integer_capacity!(i64, std::i64::MAX); #[derive(Clone)] struct Edge<Cap> { to_: u32, inv_: u32, cap_: Cap, } impl<Cap> Edge<Cap> { fn new(to: usize, inv: usize, cap: Cap) -> Self { Edge { to_: to as u32, inv_: inv as u32, cap_: cap, } } fn to(&self) -> usize { self.to_ as usize } fn inv(&self) -> usize { self.inv_ as usize } } impl<Cap: MaxFlowCapacity> Edge<Cap> { fn add(&mut self, cap: Cap) { self.cap_ = self.cap_ + cap; } fn sub(&mut self, cap: Cap) { self.cap_ = self.cap_ - cap; } fn cap(&self) -> Cap { self.cap_ } } pub struct Graph<Cap> { graph: Vec<Vec<Edge<Cap>>>, } #[allow(dead_code)] pub struct EdgeIndex { src: usize, dst: usize, x: usize, y: usize, } impl<Cap: MaxFlowCapacity> Graph<Cap> { pub fn new(size: usize) -> Self { Self { graph: vec![vec![]; size], } } pub fn add_edge(&mut self, src: usize, dst: usize, cap: Cap) -> EdgeIndex { assert!(src.max(dst) < self.graph.len()); assert!(cap >= Cap::zero()); assert!(src != dst); let x = self.graph[src].len(); let y = self.graph[dst].len(); self.graph[src].push(Edge::new(dst, y, cap)); self.graph[dst].push(Edge::new(src, x, Cap::zero())); EdgeIndex { src, dst, x, y } } // src, dst, used, intial_capacity #[allow(dead_code)] pub fn get_edge(&self, e: &EdgeIndex) -> (usize, usize, Cap, Cap) { let max = self.graph[e.src][e.x].cap() + self.graph[e.dst][e.y].cap(); let used = self.graph[e.dst][e.y].cap(); (e.src, e.dst, used, max) } pub fn flow(&mut self, src: usize, dst: usize) -> Cap { let size = self.graph.len(); assert!(src.max(dst) < size); assert!(src != dst); let mut queue = std::collections::VecDeque::new(); let mut level = vec![0; size]; let mut it = vec![0; size]; let mut ans = Cap::zero(); loop { (|| { level.clear(); level.resize(size, 0); level[src] = 1; queue.clear(); queue.push_back(src); while let Some(v) = queue.pop_front() { let d = level[v] + 1; for e in self.graph[v].iter() { let u = e.to(); if e.cap() > Cap::zero() && level[u] == 0 { level[u] = d; if u == dst { return; } queue.push_back(u); } } } })(); if level[dst] == 0 { break; } it.clear(); it.resize(size, 0); loop { let f = self.dfs(dst, src, Cap::inf(), &mut it, &level); if f == Cap::zero() { break; } ans = ans + f; } } ans } fn dfs(&mut self, v: usize, src: usize, cap: Cap, it: &mut [usize], level: &[u32]) -> Cap { if v == src { return cap; } while let Some((u, inv)) = self.graph[v].get(it[v]).map(|p| (p.to(), p.inv())) { if level[u] + 1 == level[v] && self.graph[u][inv].cap() > Cap::zero() { let cap = cap.min(self.graph[u][inv].cap()); let c = self.dfs(u, src, cap, it, level); if c > Cap::zero() { self.graph[v][it[v]].add(c); self.graph[u][inv].sub(c); return c; } } it[v] += 1; } Cap::zero() } } } // ---------- end max flow (Dinic) ----------