[uva] Add C++ solution for 793 - Network Connections.

Author: abeaumont

uva/00793-1.ans

@@ -0,0 +1,3 @@
+1,2
+
+2,0

uva/00793-1.in

@@ -0,0 +1,15 @@
+2
+
+10
+c 1 5
+c 2 7
+q 7 1
+c 3 9
+q 9 6
+c 2 5
+q 7 5
+
+1
+q 1 1
+c 1 1
+q 1 1

uva/00793.cc

@@ -0,0 +1,41 @@
+// https://uva.onlinejudge.org/external/7/793.pdf
+#include<bits/stdc++.h>
+using namespace std;
+using vi=vector<int>;
+int main(){
+  int t,n,u,v;
+  cin>>t;
+  while(t--){
+    cin>>n;
+    string l;
+    getline(cin,l);
+    vi s=vi(n, 1),p=vi(n);
+    for(int i=0;i<n;i++)p[i]=i;
+    function<int(int)>find=[&](int i){
+      if(i==p[i])return i;
+      return p[i]=find(p[i]);
+    };
+    function<void(int,int)>unite=[&](int i, int j){
+      i=find(i);
+      j=find(j);
+      if(i==j)return;
+      if(s[i]<s[j])swap(i,j);
+      s[i]+=s[j];
+      p[j]=i;
+    };
+    int a=0,b=0;
+    while(1){
+      getline(cin,l);
+      if(l.empty())break;
+      stringstream in(l);
+      char q;
+      in>>q>>u>>v;
+      u--;v--;
+      if(q=='c')unite(u,v);
+      else if(find(u)==find(v))a++;
+      else b++;
+    }
+    cout<<a<<","<<b<<"\n";
+    if(t)cout<<"\n";
+  }
+}

uva/README.md

@@ -25,6 +25,8 @@ There are solutions for the following
   ([problem site](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=6&problem=400))
 * [579 - Clock Hands](00579.cc)
   ([problem site](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=520))
+* [793 - Network Connections](00793.cc)
+  ([problem site](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=734))
 * [10004 - Bicoloring](10004.cc)
   ([problem site](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=945))
 * [10038 - Jolly Jumpers](10038.cc)