Task: | Download Speed |
Sender: | ZDHKLV |
Submission time: | 2024-10-10 11:46:12 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | WRONG ANSWER |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.00 s | details |
#2 | ACCEPTED | 0.00 s | details |
#3 | ACCEPTED | 0.00 s | details |
#4 | ACCEPTED | 0.00 s | details |
#5 | WRONG ANSWER | 0.00 s | details |
#6 | ACCEPTED | 0.01 s | details |
#7 | ACCEPTED | 0.01 s | details |
#8 | ACCEPTED | 0.00 s | details |
#9 | ACCEPTED | 0.00 s | details |
#10 | ACCEPTED | 0.00 s | details |
#11 | WRONG ANSWER | 0.01 s | details |
#12 | WRONG ANSWER | 0.00 s | details |
Code
#include <bits/stdc++.h> using namespace std; struct Flow { int n; vector<vector<int>> *capacity; vector<vector<int>> *adj; Flow(vector<vector<int>> &adj, vector<vector<int>> &capacity) { n = adj.size(); this->adj = &adj; this->capacity = &capacity; } int bfs(int s, int t, vector<int>& parent) { fill(parent.begin(), parent.end(), -1); parent[s] = -2; queue<pair<int, int>> q; q.push({s, INT_MAX}); while (!q.empty()) { int current = q.front().first; int flow = q.front().second; q.pop(); for (int next : (*adj)[current]) { if (parent[next] == -1 && (*capacity)[current][next] > 0) { parent[next] = current; int new_flow = min(flow, (*capacity)[current][next]); if (next == t) return new_flow; q.push({next, new_flow}); } } } return 0; } int max_flow(int s, int t) { vector<int> parent(n); int flow = 0; int new_flow; while ((new_flow = bfs(s, t, parent))) { flow += new_flow; int current = t; while (current != s) { int previous = parent[current]; (*capacity)[previous][current] -= new_flow; (*capacity)[current][previous] += new_flow; current = previous; } } return flow; } }; int main() { int n, m; cin >> n >> m; vector<vector<int>> adj(n); vector<vector<int>> capacity(n, vector<int>(n, 0)); for (int i = 0; i < m; i++) { int a, b, c; cin >> a >> b >> c; a--, b--; adj[a].push_back(b); capacity[a][b] = c; } Flow flow{adj, capacity}; cout << flow.max_flow(0, n-1) << endl; return 0; }
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: WRONG ANSWER
input |
---|
2 1000 1 2 1000000000 1 2 1000000000 1 2 1000000000 1 2 1000000000 ... |
correct output |
---|
1000000000000 |
user output |
---|
1000000000 |
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: WRONG ANSWER
input |
---|
10 999 1 2 1000000000 1 2 1000000000 1 2 1000000000 1 2 1000000000 ... |
correct output |
---|
111000000000 |
user output |
---|
1000000000 |
Test 12
Verdict: WRONG ANSWER
input |
---|
7 9 1 2 1 1 3 1 1 4 1 2 5 1 ... |
correct output |
---|
2 |
user output |
---|
1 |