mincostflow static_assert

hitonanode · hitonanode · commit 918aaefc3c6c · 2021-02-27T23:24:10.000+09:00
diff --git a/.gitignore b/.gitignore
@@ -37,7 +37,6 @@
 utilities/bigint.hpp
 convex_hull_trick/li_chao_tree.hpp
 convex_hull_trick/test/li_chao_tree.test.cpp
-lemon*
 
 ClipBoardHistoryConfig.txt
 SnippetConfig.json
diff --git a/LICENSE b/LICENSE
@@ -19,29 +19,3 @@ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
-
-The scripts for continuous interation (CI) were abstracted from kmyk's online-judge-tools,
-which is subject to the same license.
-Here is the oriinal copyright notice for online-judge-tools.
-
-The MIT License (MIT)
-
-Copyright (c) 2017-2018 Kimiyuki Onaka.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
diff --git a/combinatorial_opt/mincostflow.hpp b/combinatorial_opt/mincostflow.hpp
@@ -7,11 +7,12 @@
 
 // CUT begin
 // MinCostFlow based on AtCoder Library, no namespace, no private variables, compatible with C++11
-// Reference: <https://atcoder.github.io/ac-library/production/document_ja/mincostflow.html>
 // **NO NEGATIVE COST EDGES**
+// Reference: https://atcoder.github.io/ac-library/production/document_ja/mincostflow.html
+// Remark: You can use [radix heap](https://github.com/iwiwi/radix-heap) for Dijkstra acceleration
 template <class Cap, class Cost> struct mcf_graph {
     mcf_graph() {}
-    mcf_graph(int n) : _n(n), g(n) {}
+    mcf_graph(int n) : _n(n), g(n) { static_assert(std::numeric_limits<Cap>::max() > 0); }
 
     int add_edge(int from, int to, Cap cap, Cost cost) {
         assert(0 <= from && from < _n);
