From 1880ccb6d85c6eb79e724593457877bab431951c Mon Sep 17 00:00:00 2001
From: Gloria Mundi <gloria@gloria-mundi.eu>
Date: Sat, 16 Nov 2024 21:17:29 +0100
Subject: get rid of all() and sz()

---
 content/graph/minCostMaxFlow.cpp | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

(limited to 'content/graph/minCostMaxFlow.cpp')

diff --git a/content/graph/minCostMaxFlow.cpp b/content/graph/minCostMaxFlow.cpp
index 14a222c..fde95f3 100644
--- a/content/graph/minCostMaxFlow.cpp
+++ b/content/graph/minCostMaxFlow.cpp
@@ -15,16 +15,16 @@ struct MinCostFlow {
 		adj(n), s(source), t(target) {};
 
 	void addEdge(int u, int v, ll c, ll cost) {
-		adj[u].push_back(sz(edges));
+		adj[u].push_back(ssize(edges));
 		edges.push_back({v, c, cost});
-		adj[v].push_back(sz(edges));
+		adj[v].push_back(ssize(edges));
 		edges.push_back({u, 0, -cost});
 	}
 
 	bool SPFA() {
-		pref.assign(sz(adj), -1);
-		dist.assign(sz(adj), INF);
-		vector<bool> inqueue(sz(adj));
+		pref.assign(ssize(adj), -1);
+		dist.assign(ssize(adj), INF);
+		vector<bool> inqueue(ssize(adj));
 		queue<int> queue;
 		dist[s] = 0;
 		queue.push(s);
@@ -59,7 +59,7 @@ struct MinCostFlow {
 	}}
 
 	void mincostflow() {
-		con.assign(sz(adj), 0);
+		con.assign(ssize(adj), 0);
 		maxflow = mincost = 0;
 		while (SPFA()) extend();
 	}
-- 
cgit v1.2.3