Submission details
Task:Download Speed
Sender:aalto26gh_011
Submission time:2026-10-17 23:21:06 +0300
Language:Rust (2021)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails

Code

#![allow(unused)]

use std::io;

fn take_tuple() -> (usize, usize) {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let mut it = input
        .trim()
        .split_whitespace()
        .map(|x| x.parse::<usize>().unwrap());
    (it.next().unwrap(), it.next().unwrap())
}

fn take_triple() -> (usize, usize, usize) {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let mut it = input
        .trim()
        .split_whitespace()
        .map(|x| x.parse::<usize>().unwrap());
    (it.next().unwrap(), it.next().unwrap(), it.next().unwrap())
}

fn dfs(u: usize, min: usize, adj: &mut Vec<Vec<(usize, usize, usize)>>,
    visited: &mut Vec<bool>, thr: usize, sink: usize,) -> usize {
    if u == sink { return min; }
    visited[u] = true;

    for i in 0..adj[u].len() {
        let (v, c, rev) = adj[u][i];
        if c < thr || visited[v] { continue; }

        let f = dfs(v, min.min(c), adj, visited, thr, sink);
        if f > 0 {
            adj[u][i].1 -= f;
            adj[v][rev].1 += f;
            return f;
        }
    }
    0
}

fn main() {
    let (n, m): (usize, usize) = take_tuple();
    let mut adj: Vec<Vec<(usize, usize, usize)>> = vec![Vec::new(); n + 1];

    let mut flow_sum = 0;
    for i in 0..m {
        let (a, b, c) = take_triple();
        let rev_a = adj[b].len();
        let rev_b = adj[a].len();

        adj[a].push((b, c, rev_a));
        adj[b].push((a, 0, rev_b));
        flow_sum += c;
    }

    let mut thr: usize = flow_sum;
    flow_sum = 0;

    while thr > 0 {
        loop {
            let mut visited: Vec<bool> = vec![false; n + 1];
            let f = dfs(1, usize::MAX, &mut adj, &mut visited, thr, n);
            if f == 0 { break; }
            flow_sum += f;
        }
        thr = thr / 2;
    }

    println!("{}", flow_sum);
}

Test details

Test 1

Verdict: ACCEPTED

input
4 3
1 2 5
2 3 3
3 4 6

correct output
3

user output
3

Test 2

Verdict: ACCEPTED

input
4 5
1 2 1
1 3 1
2 3 1
2 4 1
...

correct output
2

user output
2

Test 3

Verdict: ACCEPTED

input
4 5
1 2 1000000000
1 3 1000000000
2 3 1
2 4 1000000000
...

correct output
2000000000

user output
2000000000

Test 4

Verdict: ACCEPTED

input
2 1
2 1 100

correct output
0

user output
0

Test 5

Verdict: ACCEPTED

input
2 1000
1 2 1000000000
1 2 1000000000
1 2 1000000000
1 2 1000000000
...

correct output
1000000000000

user output
1000000000000

Test 6

Verdict: ACCEPTED

input
500 998
1 2 54
1 3 59
1 4 83
2 5 79
...

correct output
60

user output
60

Test 7

Verdict: ACCEPTED

input
500 998
1 2 530873053
1 3 156306296
1 4 478040476
3 5 303609600
...

correct output
1093765123

user output
1093765123

Test 8

Verdict: ACCEPTED

input
2 1
1 2 1

correct output
1

user output
1

Test 9

Verdict: ACCEPTED

input
4 5
1 2 3
2 4 2
1 3 4
3 4 5
...

correct output
6

user output
6

Test 10

Verdict: ACCEPTED

input
4 5
1 2 1
1 3 2
3 2 1
2 4 2
...

correct output
3

user output
3

Test 11

Verdict: ACCEPTED

input
10 999
1 2 1000000000
1 2 1000000000
1 2 1000000000
1 2 1000000000
...

correct output
111000000000

user output
111000000000

Test 12

Verdict: ACCEPTED

input
7 9
1 2 1
1 3 1
1 4 1
2 5 1
...

correct output
2

user output
2