summaryrefslogtreecommitdiff
path: root/content/graph/dinicScaling.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'content/graph/dinicScaling.cpp')
-rw-r--r--content/graph/dinicScaling.cpp10
1 files changed, 5 insertions, 5 deletions
diff --git a/content/graph/dinicScaling.cpp b/content/graph/dinicScaling.cpp
index 0974b78..0082c05 100644
--- a/content/graph/dinicScaling.cpp
+++ b/content/graph/dinicScaling.cpp
@@ -8,12 +8,12 @@ int s, t;
vector<int> pt, dist;
void addEdge(int u, int v, ll c) {
- adj[u].push_back({v, (int)sz(adj[v]), 0, c});
- adj[v].push_back({u, (int)sz(adj[u]) - 1, 0, 0});
+ adj[u].push_back({v, (int)ssize(adj[v]), 0, c});
+ adj[v].push_back({u, (int)ssize(adj[u]) - 1, 0, 0});
}
bool bfs(ll lim) {
- dist.assign(sz(adj), -1);
+ dist.assign(ssize(adj), -1);
dist[s] = 0;
queue<int> q({s});
while (!q.empty() && dist[t] < 0) {
@@ -28,7 +28,7 @@ bool bfs(ll lim) {
ll dfs(int v, ll flow) {
if (v == t || flow == 0) return flow;
- for (; pt[v] < sz(adj[v]); pt[v]++) {
+ for (; pt[v] < ssize(adj[v]); pt[v]++) {
Edge& e = adj[v][pt[v]];
if (dist[e.to] != dist[v] + 1) continue;
ll cur = dfs(e.to, min(e.c - e.f, flow));
@@ -45,7 +45,7 @@ ll maxFlow(int source, int target) {
ll flow = 0;
for (ll lim = (1LL << 62); lim >= 1; lim /= 2) {
while (bfs(lim)) {
- pt.assign(sz(adj), 0);
+ pt.assign(ssize(adj), 0);
ll cur;
do {
cur = dfs(s, lim);