ADDED   SRM/654-U/1A.cpp
Index: SRM/654-U/1A.cpp
==================================================================
--- SRM/654-U/1A.cpp
+++ SRM/654-U/1A.cpp
@@ -0,0 +1,116 @@
+#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 SquareScores { public:
+	double calcexpectation(vector <int> p, string s)
+	{
+		double ans = 0.0;
+		for(int k=0; k<s.size(); ++k) {
+			int num_q = 0;
+			char ch = '*';
+			for(int e=k; e<s.size(); ++e) {
+				if(s[e]=='?')
+					num_q++;
+				if(ch == '*') {
+					if(s[e] != '?')
+						ch = s[e];
+				} else {
+					if(s[e] != '?' && s[e] != ch)
+						break;
+				}
+
+				for(int ci=0; ci<p.size(); ++ci)
+					if(ch=='*' || ch-'a'==ci)
+						ans += pow(p[ci]/100.0, num_q);
+			}
+		}
+		return ans;
+	}
+};
+
+// 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 double& Expected, const double& Received) {
+ bool ok = (abs(Expected - Received) < 1e-9);
+ 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(_, SquareScores().calcexpectation(p, s));}
+int main(){
+
+CASE(0)
+	int p_[] = {1, 99};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	string s = "aaaba"; 
+	double _ = 8.0; 
+END
+CASE(1)
+	int p_[] = {10, 20, 70};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	string s = "aa?bbbb"; 
+	double _ = 15.0; 
+END
+CASE(2)
+	int p_[] = {10, 20, 30, 40};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	string s = "a??c?dc?b"; 
+	double _ = 11.117; 
+END
+CASE(3)
+	int p_[] = {25, 25, 21, 2, 2, 25};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	string s = "a??b???????ff??e"; 
+	double _ = 21.68512690712425; 
+END
+CASE(4)
+	int p_[] = {4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	string s = "??????????????????????????????"; 
+	double _ = 31.16931963781721; 
+END
+CASE(5)
+	int p_[] = {4, 3, 4, 3, 8, 2, 4, 3, 4, 4, 3, 2, 4, 4, 3, 4, 2, 4, 7, 6, 4, 4, 3, 4, 4, 3};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	string s = "makigotapresentfromniko"; 
+	double _ = 23.0; 
+END
+/*
+CASE(6)
+	int p_[] = ;
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	string s = ; 
+	double _ = ; 
+END
+CASE(7)
+	int p_[] = ;
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	string s = ; 
+	double _ = ; 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/654-U/1B.cpp
Index: SRM/654-U/1B.cpp
==================================================================
--- SRM/654-U/1B.cpp
+++ SRM/654-U/1B.cpp
@@ -0,0 +1,163 @@
+#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;
+
+template<typename T>
+struct DP2
+{
+	const int N1, N2;
+	vector<T> data;
+	DP2(int N1, int N2, const T& t = T())
+		: N1(N1), N2(N2), data(N1*N2, t) { assert(data.size()*sizeof(T)<(1<<28)); }
+	T& operator()(int i1, int i2)
+		{ return data[ (i1*N2)+i2 ]; }
+	void swap(DP2& rhs)
+		{ data.swap(rhs.data); }
+};
+
+class SuccessiveSubtraction2 { public:
+	vector <int> calc(vector <int> a, vector <int> p, vector <int> v)
+	{
+		vector<int> answer;
+		for(int i=0; i<p.size(); ++i) {
+			a[p[i]] = v[i];
+
+			if(a.size() == 1) {
+				answer.push_back(a[0]);
+				continue;
+			}
+
+			answer.push_back(a[0]-a[1]+solve(a));
+		}
+		return answer;
+	}
+
+	int solve(const vector<int>& a)
+	{
+		DP2<int> dp(a.size(), 5, -0x1fffffff);
+		dp(1, 0) = 0;
+
+		for(int i=2; i<a.size(); ++i)
+			for(int prev_s=0; prev_s<=4; ++prev_s)
+			{
+				int s = prev_s;
+				dp(i,s) = max(dp(i,s), dp(i-1,prev_s) + a[i]*(s&1 ? +1 : -1));
+				if(prev_s<4) {
+					s = prev_s + 1;
+					dp(i,s) = max(dp(i,s), dp(i-1,prev_s) + a[i]*(s&1 ? +1 : -1));
+				}
+			}
+
+		int best = 0;
+		for(int s=0; s<=4; ++s)
+			best = max(best, dp(a.size()-1, s));
+		return best;
+	}
+};
+
+// 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 vector <int>& Expected, const vector <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(_, SuccessiveSubtraction2().calc(a, p, v));}
+int main(){
+
+CASE(0)
+	int a_[] = {1, 2, 3, 4, 5};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int p_[] = {1, 2, 0, 4, 3};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	int v_[] = {3, 9, -10, 5, 1};
+	  vector <int> v(v_, v_+sizeof(v_)/sizeof(*v_)); 
+	int __[] = {10, 16, 5, 5, 2 };
+	  vector <int> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(1)
+	int a_[] = {-100, -100, -100, -100, -100};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int p_[] = {0, 1, 2, 3, 4};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	int v_[] = {0, 0, 0, 0, 0};
+	  vector <int> v(v_, v_+sizeof(v_)/sizeof(*v_)); 
+	int __[] = {400, 300, 200, 100, 0 };
+	  vector <int> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(2)
+	int a_[] = {83, 0, 25, 21};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int p_[] = {0, 3, 2, 1, 3, 1, 2};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	int v_[] = {10, -90, 33, 52, -100, 0, 45};
+	  vector <int> v(v_, v_+sizeof(v_)/sizeof(*v_)); 
+	int __[] = {56, 125, 133, 81, 91, 143, 155 };
+	  vector <int> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(3)
+	int a_[] = {1};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int p_[] = {0, 0, 0, 0};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	int v_[] = {10, -10, 100, -100};
+	  vector <int> v(v_, v_+sizeof(v_)/sizeof(*v_)); 
+	int __[] = {10, -10, 100, -100 };
+	  vector <int> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(4)
+	int a_[] = {-11, -4, 28, 38, 21, -29, -45, 11, -58, -39, 92, 35, -56, -6, 29, -2, 61, 10, -29, -63};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int p_[] = {19, 5, 3, 10, 4, 18, 5, 2, 0, 15};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	int v_[] = {-19, 21, 7, -66, 38, -39, -22, 24, -32, 13};
+	  vector <int> v(v_, v_+sizeof(v_)/sizeof(*v_)); 
+	int __[] = {451, 443, 412, 440, 457, 467, 468, 464, 443, 458 };
+	  vector <int> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(5)
+int a_[] = {10, 20};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	  int p_[] = {0, 1};
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	  int v_[] = {2, 3};
+	  vector <int> v(v_, v_+sizeof(v_)/sizeof(*v_)); 
+	  int __[] = {-18, -1};
+	  vector <int> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+/*
+CASE(6)
+	int a_[] = ;
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int p_[] = ;
+	  vector <int> p(p_, p_+sizeof(p_)/sizeof(*p_)); 
+	int v_[] = ;
+	  vector <int> v(v_, v_+sizeof(v_)/sizeof(*v_)); 
+	int __[] = ;
+	  vector <int> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/654-U/1C-U.cpp
Index: SRM/654-U/1C-U.cpp
==================================================================
--- SRM/654-U/1C-U.cpp
+++ SRM/654-U/1C-U.cpp
@@ -0,0 +1,180 @@
+#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;
+
+static const unsigned MODVAL = 1000000007;
+struct mint
+{
+	unsigned val;
+	mint():val(0){}
+	mint(int      x):val(x%MODVAL) {}
+	mint(unsigned x):val(x%MODVAL) {}
+	mint(LL       x):val(x%MODVAL) {}
+};
+mint& operator+=(mint& x, mint y) { return x = x.val+y.val; }
+mint& operator-=(mint& x, mint y) { return x = x.val-y.val+MODVAL; }
+mint& operator*=(mint& x, mint y) { return x = LL(x.val)*y.val; }
+mint operator+(mint x, mint y) { return x+=y; }
+mint operator-(mint x, mint y) { return x-=y; }
+mint operator*(mint x, mint y) { return x*=y; }
+
+mint POW(mint x, LL e) { mint v=1; for(;e;x*=x,e>>=1) if(e&1) v*=x; return v; }
+mint& operator/=(mint& x, mint y) { return x *= POW(y, MODVAL-2); }
+mint operator/(mint x, mint y) { return x/=y; }
+
+vector<mint> FAC_(1,1);
+mint FAC(LL n) { while( FAC_.size()<=n ) FAC_.push_back( FAC_.back()*FAC_.size() ); return FAC_[size_t(n)]; }
+
+vector< vector<mint> > CP_;
+mint C(int n, int k) {
+	while( CP_.size() <= n ) {
+		int nn = CP_.size();
+		CP_.push_back(vector<mint>(nn+1,1));
+		for(int kk=1; kk<nn; ++kk)
+			CP_[nn][kk] = CP_[nn-1][kk-1] + CP_[nn-1][kk];
+	}
+	return k<0 || n<k ? 0 : CP_[n][k];
+}
+
+class TwoEntrances { public:
+	int count(vector <int> a, vector <int> b, int s1, int s2)
+	{
+		const int N = a.size() + 1;
+
+		// Graph
+		vector<vector<int>> g(N);
+		for(int i=0; i<a.size(); ++i) {
+			g[a[i]].push_back(b[i]);
+			g[b[i]].push_back(a[i]);
+		}
+
+		// Tree (as root=s1)
+		vector<vector<int>> children(N);
+		vector<int> parent(N, -1);
+		vector<int> tree_size(N);
+		function<int(int,int)> rec; rec = [&](int pre, int v) {
+			int sub_size = 1;
+			for(auto u: g[v]) if(u != pre) {
+				children[v].push_back(u);
+				parent[u] = v;
+				sub_size += rec(v, u);
+			}
+			tree_size[v] = sub_size;
+		};
+		rec(-1, s1);
+
+		// Mark s1--s2
+		vector<bool> s2_path(N);
+		for(int v=s2; v!=-1; v=parent[v])
+			s2_path[v] = true;
+
+		// Parts except s1--s2 path is easy.
+		// It's dp-on-tree[s1 \setminus s2] * dp-on-tree[s1] * C(N, |s1|) * C(N-|s1|, |s2|).
+		// CAUTION: ENSURE s1 and s2 NOT be included on dp-on-tree and |s|.
+		// otherwise C(N, |s1|) will fix the timing s1 is filled, which reduces the freedom in
+		// path mode.
+
+		// What about the rest N-|s1|-|s2|?
+	}
+};
+
+// 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(_, TwoEntrances().count(a, b, s1, s2));}
+int main(){
+
+CASE(0)
+	int a_[] = {0, 1, 2};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int b_[] = {1, 2, 3};
+	  vector <int> b(b_, b_+sizeof(b_)/sizeof(*b_)); 
+	int s1 = 0; 
+	int s2 = 1; 
+	int _ = 4; 
+END
+CASE(1)
+	int a_[] = {0, 1, 2};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int b_[] = {1, 2, 3};
+	  vector <int> b(b_, b_+sizeof(b_)/sizeof(*b_)); 
+	int s1 = 0; 
+	int s2 = 2; 
+	int _ = 9; 
+END
+CASE(2)
+	int a_[] = {0, 1, 1, 3, 3, 3, 6, 7, 6};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int b_[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
+	  vector <int> b(b_, b_+sizeof(b_)/sizeof(*b_)); 
+	int s1 = 1; 
+	int s2 = 9; 
+	int _ = 16000; 
+END
+CASE(3)
+	int a_[] = {0, 0, 1, 2, 3, 1, 2, 0, 6, 5, 10, 10};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int b_[] = {1 ,2 ,3 ,4 ,5 ,6 ,7 ,8 ,9 ,10, 11, 12};
+	  vector <int> b(b_, b_+sizeof(b_)/sizeof(*b_)); 
+	int s1 = 3; 
+	int s2 = 6; 
+	int _ = 310464; 
+END
+CASE(4)
+	int a_[] = {0};
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int b_[] = {1};
+	  vector <int> b(b_, b_+sizeof(b_)/sizeof(*b_)); 
+	int s1 = 1; 
+	int s2 = 0; 
+	int _ = 2; 
+END
+/*
+CASE(5)
+	int a_[] = ;
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int b_[] = ;
+	  vector <int> b(b_, b_+sizeof(b_)/sizeof(*b_)); 
+	int s1 = ; 
+	int s2 = ; 
+	int _ = ; 
+END
+CASE(6)
+	int a_[] = ;
+	  vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 
+	int b_[] = ;
+	  vector <int> b(b_, b_+sizeof(b_)/sizeof(*b_)); 
+	int s1 = ; 
+	int s2 = ; 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE