結果
| 問題 | No.654 Air E869120 |
| ユーザー |
 hatoo
|
| 提出日時 | 2018-02-24 11:29:13 |
| 言語 | Rust (1.77.0) |
| 結果 |
AC
|
| 実行時間 | 6 ms / 2,000 ms |
| コード長 | 8,629 bytes |
| コンパイル時間 | 1,607 ms |
| コンパイル使用メモリ | 156,772 KB |
| 実行使用メモリ | 5,172 KB |
| 最終ジャッジ日時 | 2023-08-03 06:52:15 |
| 合計ジャッジ時間 | 3,652 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge14 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,380 KB |
| testcase_01 | AC | 1 ms
4,376 KB |
| testcase_02 | AC | 1 ms
4,376 KB |
| testcase_03 | AC | 1 ms
4,380 KB |
| testcase_04 | AC | 1 ms
4,380 KB |
| testcase_05 | AC | 1 ms
4,380 KB |
| testcase_06 | AC | 1 ms
4,380 KB |
| testcase_07 | AC | 1 ms
4,376 KB |
| testcase_08 | AC | 1 ms
4,376 KB |
| testcase_09 | AC | 1 ms
4,380 KB |
| testcase_10 | AC | 6 ms
5,172 KB |
| testcase_11 | AC | 6 ms
4,376 KB |
| testcase_12 | AC | 6 ms
4,376 KB |
| testcase_13 | AC | 6 ms
4,500 KB |
| testcase_14 | AC | 6 ms
4,380 KB |
| testcase_15 | AC | 6 ms
4,672 KB |
| testcase_16 | AC | 4 ms
4,380 KB |
| testcase_17 | AC | 4 ms
4,380 KB |
| testcase_18 | AC | 4 ms
4,380 KB |
| testcase_19 | AC | 4 ms
4,380 KB |
| testcase_20 | AC | 3 ms
4,376 KB |
| testcase_21 | AC | 3 ms
4,376 KB |
| testcase_22 | AC | 3 ms
4,384 KB |
| testcase_23 | AC | 3 ms
4,384 KB |
| testcase_24 | AC | 3 ms
4,376 KB |
| testcase_25 | AC | 2 ms
4,380 KB |
| testcase_26 | AC | 2 ms
4,376 KB |
| testcase_27 | AC | 2 ms
4,380 KB |
| testcase_28 | AC | 2 ms
4,380 KB |
| testcase_29 | AC | 2 ms
4,380 KB |
| testcase_30 | AC | 1 ms
4,376 KB |
| testcase_31 | AC | 1 ms
4,384 KB |
| testcase_32 | AC | 1 ms
4,380 KB |
| testcase_33 | AC | 2 ms
4,380 KB |
| testcase_34 | AC | 2 ms
4,380 KB |
| testcase_35 | AC | 1 ms
4,376 KB |
| testcase_36 | AC | 1 ms
4,380 KB |
| testcase_37 | AC | 1 ms
4,376 KB |
| testcase_38 | AC | 1 ms
4,380 KB |
| testcase_39 | AC | 1 ms
4,380 KB |
ソースコード
/**
* _ _ __ _ _ _ _ _ _ _
* | | | | / / | | (_) | (_) | | (_) | |
* | |__ __ _| |_ ___ ___ / /__ ___ _ __ ___ _ __ ___| |_ _| |_ ___ _____ ______ _ __ _ _ ___| |_ ______ ___ _ __ _ _ __ _ __ ___| |_ ___
* | '_ \ / _` | __/ _ \ / _ \ / / __/ _ \| '_ ` _ \| '_ \ / _ \ __| | __| \ \ / / _ \______| '__| | | / __| __|______/ __| '_ \| | '_ \| '_ \ / _ \ __/ __|
* | | | | (_| | || (_) | (_) / / (_| (_) | | | | | | |_) | __/ |_| | |_| |\ V / __/ | | | |_| \__ \ |_ \__ \ | | | | |_) | |_) | __/ |_\__ \
* |_| |_|\__,_|\__\___/ \___/_/ \___\___/|_| |_| |_| .__/ \___|\__|_|\__|_| \_/ \___| |_| \__,_|___/\__| |___/_| |_|_| .__/| .__/ \___|\__|___/
* | | | | | |
* |_| |_| |_|
*
* 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::iter::FromIterator;
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
mod util {
use std::io::{stdin, stdout, BufWriter, StdoutLock};
use std::str::FromStr;
use std::fmt::Debug;
#[allow(dead_code)]
pub fn line() -> String {
let mut line: String = String::new();
stdin().read_line(&mut line).unwrap();
line.trim().to_string()
}
#[allow(dead_code)]
pub fn chars() -> Vec<char> {
line().chars().collect()
}
#[allow(dead_code)]
pub fn gets<T: FromStr>() -> Vec<T>
where
<T as FromStr>::Err: Debug,
{
let mut line: String = String::new();
stdin().read_line(&mut line).unwrap();
line.split_whitespace()
.map(|t| t.parse().unwrap())
.collect()
}
#[allow(dead_code)]
pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) {
let out = stdout();
let writer = BufWriter::new(out.lock());
f(writer)
}
}
#[allow(unused_macros)]
macro_rules ! get { ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ;; ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; ( $ t : ty ;; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ;; ) ) . collect ::< Vec < _ >> ( ) } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { println ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[allow(dead_code)]
/// Struct for maximum flow problem
pub struct Flow {
/// to, capacity, rev
edges: Vec<Vec<(usize, usize, usize)>>,
}
impl Flow {
#[allow(dead_code)]
pub fn new(max_size: usize) -> Flow {
Flow {
edges: vec![Vec::new(); max_size + 1],
}
}
#[allow(dead_code)]
pub fn add_edge(&mut self, from: usize, to: usize, cap: usize) {
let from_rev = self.edges[to].len();
let to_rev = self.edges[from].len();
self.edges[from].push((to, cap, from_rev));
self.edges[to].push((from, 0, to_rev));
}
#[allow(dead_code)]
/// Calculate maximum flow by dinic's algorithm
pub fn max_flow_dinic(&mut self, s: usize, t: usize) -> usize {
let mut flow = 0;
loop {
let level = self.bfs_dinic(s);
let mut iter = vec![0; self.edges.len()];
if level[t].is_none() {
return flow;
}
loop {
let f = self.dfs_dinic(s, t, usize::max_value(), &level, &mut iter);
if f == 0 {
break;
}
flow += f;
}
}
}
#[allow(dead_code)]
fn bfs_dinic(&self, s: usize) -> Vec<Option<usize>> {
let mut level = vec![None; self.edges.len()];
let mut que = VecDeque::new();
level[s] = Some(0);
que.push_back(s);
while !que.is_empty() {
let v = que.pop_front().unwrap();
let l = Some(level[v].unwrap() + 1);
for &(to, cap, _) in &self.edges[v] {
if cap > 0 && level[to].is_none() {
level[to] = l;
que.push_back(to);
}
}
}
level
}
#[allow(dead_code)]
fn dfs_dinic(
&mut self,
v: usize,
t: usize,
f: usize,
level: &[Option<usize>],
iter: &mut [usize],
) -> usize {
if v == t {
return f;
}
for i in iter[v]..self.edges[v].len() {
iter[v] = i;
let (to, cap, rev) = self.edges[v][i];
if cap > 0 && level[v].unwrap() < level[to].unwrap_or(0) {
let d = self.dfs_dinic(to, t, min(f, cap), level, iter);
if d > 0 {
self.edges[v][i].1 -= d;
self.edges[to][rev].1 += d;
return d;
}
}
}
0
}
#[allow(dead_code)]
fn max_flow_ff(&mut self, s: usize, t: usize) -> usize {
let mut flow = 0;
let l = self.edges.len();
loop {
let f = self.dfs_ff(s, t, usize::max_value(), &mut vec![false; l]);
if f == 0 {
break;
}
flow += f;
}
flow
}
#[allow(dead_code)]
fn dfs_ff(&mut self, v: usize, t: usize, f: usize, used: &mut [bool]) -> usize {
if v == t {
return f;
}
used[v] = true;
for i in 0..self.edges[v].len() {
let (to, cap, rev) = self.edges[v][i];
if !used[to] && cap > 0 {
let d = self.dfs_ff(to, t, min(f, cap), used);
if d > 0 {
self.edges[v][i].1 -= d;
self.edges[to][rev].1 += d;
return d;
}
}
}
0
}
#[allow(dead_code)]
fn cut(&self, s: usize) -> BTreeSet<usize> {
let mut stack = Vec::new();
let mut ss = BTreeSet::new();
ss.insert(s);
stack.push(s);
while !stack.is_empty() {
let v = stack.pop().unwrap();
for &(to, cap, _) in &self.edges[v] {
if cap > 0 && !ss.contains(&to) {
ss.insert(to);
stack.push(to);
}
}
}
ss
}
}
const INF: usize = 1 << 60;
#[allow(dead_code)]
fn main() {
let (n, m, d) = get!(usize, usize, usize);
let fs = get!(usize, usize, usize, usize, usize; m);
let mut sort_u = vec![Vec::new(); n + 1];
for (i, &(u, v, p, q, w)) in fs.iter().enumerate() {
sort_u[u].push((i, (u, v, p, q, w)));
}
let mut flow = Flow::new(2 + 2 * m);
let s = 0;
let t = 1;
for (i, &(u, v, _p, q, w)) in fs.iter().enumerate() {
let i = 2 * i + 2;
let j = i + 1;
flow.add_edge(i, j, w);
if u == 1 {
flow.add_edge(s, i, INF);
}
if v == n {
flow.add_edge(j, t, INF);
}
// for (k, &(u1, _v1, p1, _q1, _w1)) in fs.iter().enumerate() {
for &(k, (_u1, _v1, p1, _q1, _w1)) in &sort_u[v] {
let k = 2 * k + 2;
if q + d <= p1 {
flow.add_edge(j, k, INF);
}
}
}
println!("{}", flow.max_flow_dinic(s, t));
}