onto p4

GCJ2016/Factory/Factory.c++

@@ -0,0 +1,119 @@
+#include <iostream>
+#include <fstream>
+#include <vector>
+#include <algorithm>
+#include <unordered_map>
+#include <unordered_set>
+#include <string.h>
+using namespace std;
+
+vector<int> fromR(int n, int ms, bool *m, int r) {
+    vector<int> ids;
+
+    int offset = n * r;
+    for (int i = 0; i < n; i++) {
+        if (m[offset + i])ids.push_back(i);
+    }
+
+    return ids;
+}
+
+vector<int> fromC(int n, int ms, bool *m, int c) {
+    vector<int> ids;
+
+    for (int i = 0; i < n; i++) {
+        if (m[n * i + c])ids.push_back(i);
+    }
+
+    return ids;
+}
+
+int main(int argc, char **argv) {
+	const char *fn = "sample4.in";
+	if (argc > 1)fn = argv[1];
+
+	ifstream in(fn);
+	int total_case;
+	in >> total_case;
+
+	for (int i = 1; i < total_case + 1; i++) {
+        int n, ms, skills;
+        in >> n;
+        ms = n*n;
+        skills = 0;
+        bool *m = new bool[ms];
+
+        char c;
+        for (int i = 0; i < ms; i++) {
+            in >> c;
+            if (c == '0')m[i] = false;
+            if (c == '1')m[i] = true;
+            if (c == '1')skills++;
+        }
+
+        unordered_set<int> pool;
+        for (int i = 0; i < n; i++)pool.insert(i);
+        vector<pair<int, int>> css;
+
+        while (pool.size() > 0) {
+            int elem = *(pool.begin());
+
+            unordered_set<int> comp;
+            int ls = 0;
+
+            pool.erase(elem);
+            comp.insert(elem);
+            unordered_set<int> ext;
+
+            while (comp.size() > ls) {
+                ls = comp.size();
+                ext.clear();
+                for (int e : comp) {
+                    vector<int> mids = fromR(n, ms, m, e);
+                    for (int mid : mids) {
+                        ext.insert(mid);
+                    }
+                }
+
+                unordered_set<int> closure;
+                for (int e : pool) {
+                    //cout << "checking " << e << ":";
+
+                    vector<int> mids = fromR(n, ms, m, e);
+                    for (int mid : mids) {
+                        vector<int> ids = fromC(n, ms, m, mid);
+                        //cout << "from C" << mid << ":";
+                        for (int id : ids) {
+                            //cout << "find id" << id << ":";
+                            closure.insert(id);
+                        }
+                    }
+                }
+
+                for (int id : closure) {
+                    if (pool.count(id) > 0) {
+                        vector<int> mids = fromR(n, ms, m, id);
+                        for (int mid : mids) {
+                            if (ext.count(mid) > 0) {
+                                pool.erase(id);
+                                comp.insert(id);
+                            }
+                        }                        
+                    }
+                }
+            }
+
+            css.push_back(pair<int, int>(ls, ext.size()));
+            cout << "Comp Size" << ls << ":";
+            cout << "Ext Size" << ext.size() << ":";
+
+        }
+
+		cout << "Case #" << i << ": ";
+        cout << -skills;
+
+		cout << endl;
+	}
+
+	return 0;
+}

GCJ2016/Factory/sample4.in

@@ -0,0 +1,17 @@
+5
+2
+11
+10
+2
+10
+00
+3
+000
+000
+000
+1
+1
+3
+000
+110
+000