ADDED   SRM/622-U/1A.cpp
Index: SRM/622-U/1A.cpp
==================================================================
--- SRM/622-U/1A.cpp
+++ SRM/622-U/1A.cpp
@@ -0,0 +1,122 @@
+#include <iostream>
+#include <sstream>
+#include <iomanip>
+#include <vector>
+#include <string>
+#include <map>
+#include <set>
+#include <algorithm>
+#include <numeric>
+#include <iterator>
+#include <functional>
+#include <complex>
+#include <queue>
+#include <stack>
+#include <cmath>
+#include <cassert>
+#include <tuple>
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+class BuildingRoutes { public:
+	int build(vector <string> dist, int T)
+	{
+		const int N = dist.size();
+		vector<vector<int>> use(N, vector<int>(N, 0));
+
+		vector<vector<int>> d(N, vector<int>(N));
+		for(int s=0; s<N; ++s)
+		for(int t=0; t<N; ++t)
+			d[s][t] = dist[s][t] - '0';
+		for(int k=0; k<N; ++k)
+		for(int i=0; i<N; ++i)
+		for(int j=0; j<N; ++j)
+			d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
+
+		for(int s=0; s<N; ++s)
+		for(int t=0; t<N; ++t)
+			for(int a=0; a<N; ++a)
+			for(int b=0; b<N; ++b) if(a!=b)
+				if(d[s][a]+(dist[a][b]-'0')+d[b][t] == d[s][t])
+					use[a][b] ++;
+
+		int total = 0;
+		for(int s=0; s<N; ++s)
+		for(int t=0; t<N; ++t)
+			if(use[s][t] >= T)
+				total += dist[s][t] - '0';
+		return total;
+	}
+};
+
+// BEGIN CUT HERE
+#include <ctime>
+double start_time; string timer()
+ { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
+template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
+ { os << "{ ";
+   for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
+   os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
+void verify_case(const int& Expected, const int& Received) {
+ bool ok = (Expected == Received);
+ if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
+ cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
+#define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
+#define END	 verify_case(_, BuildingRoutes().build(dist, T));}
+int main(){
+
+CASE(0)
+	string dist_[] = {"011",
+ "101",
+ "110"};
+	  vector <string> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int T = 1; 
+	int _ = 6; 
+END
+CASE(1)
+	string dist_[] = {"033",
+ "309",
+ "390"};
+	  vector <string> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int T = 1; 
+	int _ = 12; 
+END
+CASE(2)
+	string dist_[] = {"0123",
+ "1023",
+ "1203",
+ "1230"};
+	  vector <string> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int T = 2; 
+	int _ = 5; 
+END
+CASE(3)
+	string dist_[] = {"05789654",
+ "10347583",
+ "65085479",
+ "55602398",
+ "76590934",
+ "57939045",
+ "12345608",
+ "68647640"};
+	  vector <string> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int T = 3; 
+	int _ = 40; 
+END
+/*
+CASE(4)
+	string dist_[] = ;
+	  vector <string> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int T = ; 
+	int _ = ; 
+END
+CASE(5)
+	string dist_[] = ;
+	  vector <string> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int T = ; 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/622-U/1B.cpp
Index: SRM/622-U/1B.cpp
==================================================================
--- SRM/622-U/1B.cpp
+++ SRM/622-U/1B.cpp
@@ -0,0 +1,142 @@
+#include <iostream>
+#include <sstream>
+#include <iomanip>
+#include <vector>
+#include <string>
+#include <map>
+#include <set>
+#include <algorithm>
+#include <numeric>
+#include <iterator>
+#include <functional>
+#include <complex>
+#include <queue>
+#include <stack>
+#include <cmath>
+#include <cassert>
+#include <tuple>
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+class Ethernet { public:
+	int connect(vector <int> parent, vector <int> dist, int maxDist)
+	{
+		int N = parent.size() + 1;
+		vector<vector<pair<int,int>>> child(N);
+		for(int i=0; i<parent.size(); ++i)
+			child[parent[i]].emplace_back(i+1, dist[i]);
+		auto cc = rec(0, child, maxDist);
+		return cc.first + 1;
+	}
+
+	// (colors / critical path)
+	pair<int, int> rec(int v, const vector<vector<pair<int,int>>>& child, int maxDist)
+	{
+		if(child[v].empty())
+			return make_pair(0, 0);
+
+		int colors = 0;
+		vector<int> cps;
+		for(auto& ue: child[v]) {
+			int u = ue.first;
+			int e = ue.second;
+			auto cd = rec(u, child, maxDist);
+			int c = cd.first;
+			int d = cd.second;
+			colors += c;
+			if(e+d > maxDist)
+				colors ++;
+			else
+				cps.push_back(e + d);
+		}
+
+		if(cps.empty())
+			return make_pair(colors, 0);
+
+		sort(cps.rbegin(), cps.rend());
+		if(cps.size() > 1 && cps[0]+cps[1] > maxDist)
+			for(int i=0; i<cps.size(); ++i)
+				if(i+1==cps.size() || cps[i]+cps[i+1] <= maxDist)
+					return make_pair(colors+i, cps[i]);
+
+		// no new color needed.
+		return make_pair(colors, cps[0]);
+	}
+};
+
+// BEGIN CUT HERE
+#include <ctime>
+double start_time; string timer()
+ { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
+template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
+ { os << "{ ";
+   for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
+   os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
+void verify_case(const int& Expected, const int& Received) {
+ bool ok = (Expected == Received);
+ if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
+ cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
+#define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
+#define END	 verify_case(_, Ethernet().connect(parent, dist, maxDist));}
+int main(){
+	CASE(2)
+	int parent_[] = {0,1,2,3,4,5};
+	  vector <int> parent(parent_, parent_+sizeof(parent_)/sizeof(*parent_)); 
+	int dist_[] = {1,2,3,4,5,6};
+	  vector <int> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int maxDist = 6; 
+	int _ = 3; 
+END
+CASE(0)
+	int parent_[] = {0,0,0};
+	  vector <int> parent(parent_, parent_+sizeof(parent_)/sizeof(*parent_)); 
+	int dist_[] = {1,1,1};
+	  vector <int> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int maxDist = 2; 
+	int _ = 1; 
+END
+CASE(1)
+	int parent_[] = {0,0,0,0,0,0,0};
+	  vector <int> parent(parent_, parent_+sizeof(parent_)/sizeof(*parent_)); 
+	int dist_[] = {1,2,3,4,5,6,7};
+	  vector <int> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int maxDist = 8; 
+	int _ = 4; 
+END
+CASE(3)
+	int parent_[] = {0,0,0,1,1};
+	  vector <int> parent(parent_, parent_+sizeof(parent_)/sizeof(*parent_)); 
+	int dist_[] = {1,1,1,1,1};
+	  vector <int> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int maxDist = 2; 
+	int _ = 2; 
+END
+CASE(4)
+	int parent_[] = {0,1,0,3,0,5,0,6,0,6,0,6,4,6,9,4,5,5,2,5,2};
+	  vector <int> parent(parent_, parent_+sizeof(parent_)/sizeof(*parent_)); 
+	int dist_[] = {93,42,104,105,59,73,161,130,30,81,62,93,131,133,139,5,13,34,25,111,4};
+	  vector <int> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int maxDist = 162; 
+	int _ = 11; 
+END
+/*
+CASE(5)
+	int parent_[] = ;
+	  vector <int> parent(parent_, parent_+sizeof(parent_)/sizeof(*parent_)); 
+	int dist_[] = ;
+	  vector <int> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int maxDist = ; 
+	int _ = ; 
+END
+CASE(6)
+	int parent_[] = ;
+	  vector <int> parent(parent_, parent_+sizeof(parent_)/sizeof(*parent_)); 
+	int dist_[] = ;
+	  vector <int> dist(dist_, dist_+sizeof(dist_)/sizeof(*dist_)); 
+	int maxDist = ; 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE