manasimu 0.0.37 → 0.0.39

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: dfddb9b67b9eac0b7ee4543b20a8538843f46838354f821dbb0993f94edff721
-  data.tar.gz: be26dd437beefa519f043954c2eddde291d0bc32e3e7afaffa7414f68748fef7
+  metadata.gz: 9fe16394f29a9190d502c063076bc1a08d9da2880409d4572472347f1f79a1b0
+  data.tar.gz: 4eae481a2d2e126e524c09b0dd4d5792a5457e7975a60497a46cdae0b71bcff5
 SHA512:
-  metadata.gz: 0a1217c58b600a709669d9609e13cef431c392043aaba9f7a154e8f350cf9e8dc454e4e5db9eaced373673749996f53fe3711e71c4c51f2abdc7f4c5c4574516
-  data.tar.gz: 3da2ba53f07926d11656008d2a131de9cdb9ba639cbfc5f3bef29399066f8ff612c2ac53c3ce0a86a178da553cc2937964fa82e646e18e435ed65a555e006fab
+  metadata.gz: d36c4c95f78a000af39fb4148ec907c93452edbc8485fa6eb6e11850d6399b6a0cd5260fda29f0627d58120e7061fcaa6e75230faeaa394b67aa7f640602a8ec
+  data.tar.gz: 6ac1e7f68d71f26df69088afc0659fa5f712b528b2ad0d99925159bf7a46c13048c69a587e3a01799bea7f7ca9a3d12d8890b9f2863760d5e0ff36035a4d7b54

data/ext/manasimu/ford_fulkerson.cpp

@@ -0,0 +1,125 @@
+#include "./config.h"
+#include <bits/stdc++.h>
+using namespace std;
+
+#ifndef NO_RUBY_EXT
+#include <rice/rice.hpp>
+#include <rice/stl.hpp>
+using namespace Rice;
+#endif
+
+template <class T>
+struct Edge {
+  int rev, from, to;  // rev:逆向きの辺の番号
+  T cap, original_cap;
+  Edge(int r, int f, int t, T c) : rev(r), from(f), to(t), cap(c), original_cap(c) {}
+};
+
+template <class T>
+struct Graph {
+  vector<vector<Edge<T>>> G;
+  Graph(int n = 0) : G(n) {}
+  vector<Edge<T>>& operator[](int i) { return G[i]; }
+  const size_t size() const { return G.size(); }
+  Edge<T>& redge(Edge<T> e) {  // 逆向きの辺を返す
+    return G[e.to][e.rev];   // 自己ループはないと仮定（あれば G[e.to][e.rev + 1] とする必要がある）
+  }
+  void add_edge(int from, int to, T cap) {  // 有向辺を加える
+    G[from].push_back(Edge<T>((int)G[to].size(), from, to, cap));
+    G[to].push_back(Edge<T>((int)G[from].size() - 1, to, from, 0));
+  }
+};
+
+/* FordFulkerson: Ford-Fulkersonのアルゴリズムで最大流を求める構造体
+   max_flow(G,s,t) ：グラフGの最大流が求まる
+   副作用：G は最大流の残余ネットワークになる
+   計算量: O(|f*||E|) (f*:最大流) 
+ */
+template <class T>
+struct FordFulkerson {
+  const T INF = 1e9;
+  vector<int> used;
+  vector<int> last_used;
+
+  FordFulkerson(){};
+  T dfs(Graph<T>& G, int v, int t, T f) {  // 増加可能経路を見つけて増加分のフローを返す
+    if (v == t) return f;
+    used[v] = 1;
+    for (auto& e : G[v]) {
+      if (used[e.to] == 0 && e.cap > 0) {
+        T d = dfs(G, e.to, t, min(f, e.cap));
+        if (d > 0) {
+          e.cap -= d;
+          G.redge(e).cap += d;
+          return d;
+        }
+      }
+    }
+    return 0;
+  }
+  T max_flow(Graph<T>& G, int s, int t) {
+    T flow = 0;
+    while (true) {
+      last_used.clear();
+      for (int i = 0; i < used.size(); i++) {
+        last_used.push_back(used[i]);
+      }
+      used.assign(G.size(), 0);
+      T f = dfs(G, s, t, INF);  // f が増加分のフロー
+      if (f == 0) {
+        return flow;
+      } else {
+        flow += f;
+      }
+    }
+    return 0;
+  }
+};
+
+#ifdef NO_RUBY_EXT
+int main() {
+  int X, Y, E;
+  cin >> X >> Y >> E;
+  Graph<int> G(X + Y + 2);
+  for (int i = 0; i < X; i++) {  // ソース(0)から X(1~X) への辺
+    G.add_edge(0, i + 1, 1);
+  }
+  for (int i = 0; i < E; i++) {  // X(1~X) から Y(X+1~X+Y) への辺
+    int x, y;
+    cin >> x >> y;
+    G.add_edge(x + 1, y + X + 1, 1);
+  }
+  for (int i = 0; i < Y; i++) {  // Y(X+1~X+Y) からシンク(X+Y+1)への辺
+    G.add_edge(i + X + 1, X + Y + 1, 1);
+  }
+
+  FordFulkerson<int> ff;
+  cout << ff.max_flow(G, 0, X + Y + 1) << endl;
+}
+#else
+
+extern "C" {
+  
+  void Init_ford_fulkerson() {
+
+    Data_Type<Edge<int>> rb_cEdge =
+      define_class<Edge<int>>("Edge")
+      .define_attr("rev", &Edge<int>::rev, Rice::AttrAccess::Read)
+      .define_attr("from", &Edge<int>::from, Rice::AttrAccess::Read)
+      .define_attr("to", &Edge<int>::to, Rice::AttrAccess::Read)
+      .define_attr("cap", &Edge<int>::cap, Rice::AttrAccess::Read);
+
+    Data_Type<Graph<int>> rb_cGraph =
+      define_class<Graph<int>>("Graph")
+      .define_constructor(Constructor<Graph<int>, int>(), (Arg("n")))
+      .define_attr("G", &Graph<int>::G, Rice::AttrAccess::Read)
+      .define_method("add_edge", &Graph<int>::add_edge);
+
+    Data_Type<FordFulkerson<int>> rb_cFordFulkerson =
+      define_class<FordFulkerson<int>>("FordFulkerson")
+      .define_constructor(Constructor<FordFulkerson<int>>())
+      .define_method("max_flow", &FordFulkerson<int>::max_flow)
+      .define_attr("used", &FordFulkerson<int>::last_used, Rice::AttrAccess::Read);
+  };
+}
+#endif

data/lib/manasimu/data.rb

@@ -274,6 +274,7 @@ class Deck
     clone_card_types = []
     deck_items.each do |deck_item|
       card_type = card_types.find(deck_item[:set], deck_item[:setnum])
+      next if not card_type
       clone = CardType.create(card_type, deck_item[:name])
       clone_card_types << clone
       if clone.is_land?

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: manasimu
 version: !ruby/object:Gem::Version
-  version: 0.0.37
+  version: 0.0.39
 platform: ruby
 authors:
 - so1itaryrove
@@ -18,7 +18,9 @@ extensions:
 extra_rdoc_files: []
 files:
 - db/card_type_aggregate
+- ext/manasimu/config.h
 - ext/manasimu/extconf.rb
+- ext/manasimu/ford_fulkerson.cpp
 - lib/manasimu.rb
 - lib/manasimu/api_util.rb
 - lib/manasimu/card.rb