ADDED   SRM/632-U/1A.cpp
Index: SRM/632-U/1A.cpp
==================================================================
--- SRM/632-U/1A.cpp
+++ SRM/632-U/1A.cpp
@@ -0,0 +1,109 @@
+#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 PotentialArithmeticSequence { public:
+	int numberOfSubsequences(vector <int> d)
+	{
+		int cnt = 0;
+		for(int s=0; s<d.size(); ++s)
+			for(int e=s+1; e<=d.size(); ++e)
+				if(incr(vector<int>(d.begin()+s, d.begin()+e)))
+					++cnt;
+		return cnt;
+	}
+
+	bool incr(vector<int> d)
+	{
+		int mi = max_element(d.begin(), d.end()) - d.begin();
+		int& M = d[mi];
+
+		// Can assume a[mi] == 1<<M.
+		M = min(M, 8);
+		for(int i=0; i<d.size(); ++i) {
+			int a = (1<<M)-mi+i;
+			if(a<=0)
+				return false;
+			if(d[i]>M)
+				return false;
+			if(((a>>d[i])&1) == 0)
+				return false;
+			if(a & ((1<<d[i])-1))
+				return false;
+		}
+		return true;
+	}
+};
+
+// 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(_, PotentialArithmeticSequence().numberOfSubsequences(d));}
+int main(){
+
+CASE(0)
+	int d_[] = {0,1,0,2,0,1,0};
+	  vector <int> d(d_, d_+sizeof(d_)/sizeof(*d_)); 
+	int _ = 28; 
+END
+CASE(1)
+	int d_[] = {0,0,0,0,0,0,0};
+	  vector <int> d(d_, d_+sizeof(d_)/sizeof(*d_)); 
+	int _ = 7; 
+END
+CASE(2)
+	int d_[] = {0,0,0,0,1,1,1};
+	  vector <int> d(d_, d_+sizeof(d_)/sizeof(*d_)); 
+	int _ = 8; 
+END
+CASE(3)
+	int d_[] = {0,100,0,2,0};
+	  vector <int> d(d_, d_+sizeof(d_)/sizeof(*d_)); 
+	int _ = 11; 
+END
+CASE(4)
+	int d_[] = {1,11,3,0,1,0,1,0,1,0,1,0,3,0,2,0,0,0,0,1,2,3,20};
+	  vector <int> d(d_, d_+sizeof(d_)/sizeof(*d_)); 
+	int _ = 49; 
+END
+/*
+CASE(5)
+	int d_[] = ;
+	  vector <int> d(d_, d_+sizeof(d_)/sizeof(*d_)); 
+	int _ = ; 
+END
+CASE(6)
+	int d_[] = ;
+	  vector <int> d(d_, d_+sizeof(d_)/sizeof(*d_)); 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/632-U/1B-U.cpp
Index: SRM/632-U/1B-U.cpp
==================================================================
--- SRM/632-U/1B-U.cpp
+++ SRM/632-U/1B-U.cpp
@@ -0,0 +1,175 @@
+#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; }
+
+class CandyCupRunningCompetition { public:
+	int findMaximum(int N, vector <int> A, vector <int> B)
+	{
+		const int START = 0, GOAL = N-1;
+		typedef mint Flow;
+		typedef int FlowFlag;
+
+		vector<vector<FlowFlag>> FF(N, vector<FlowFlag>(N, 0));
+		vector<vector<Flow>> F(N, vector<Flow>(N, 0));
+		vector<vector<int>> G(N);
+		for(int i=0; i<A.size(); ++i) {
+			int a = A[i], b = B[i];
+			FF[a][b] = FF[b][a] = i+1;
+			F[a][b] = F[b][a] = POW(3, i);
+			G[a].push_back(b);
+			G[b].push_back(a);
+		}
+
+		Flow total = 0;
+		for(;;) {
+			// BFS
+			vector<int> prev(N, -1);
+			queue<int> q;
+			prev[START] = START;
+			q.push(START);
+
+			while(!q.empty()) {
+				int u = q.front(); q.pop();
+				for(int v: G[u]) if(prev[v]==-1 && FF[u][v]) {
+					q.push(v);
+					prev[v] = u;
+					if(v == GOAL)
+						goto endBfs;
+				}
+			}
+		endBfs:
+			if(prev[GOAL] == -1)
+				break; // no more flow
+
+			Flow f;
+			FlowFlag ff = 0x7fffffff;
+			for(int v=GOAL; v!=prev[v]; v=prev[v]) {
+				int u = prev[v];
+				if(FF[u][v] < ff) {
+					ff = FF[u][v];
+					f = F[u][v];
+				}
+			}
+
+			total += f;
+			for(int v=GOAL; v!=prev[v]; v=prev[v]) {
+				int u = prev[v];
+				F[u][v] -= f;
+				F[v][u] += f;
+				if(FF[u][v] == ff) {
+					FF[u][v] = 0;
+					FF[v][u] = ff;
+				}
+			}
+		}
+		return total.val;
+	}
+};
+
+// 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(_, CandyCupRunningCompetition().findMaximum(N, A, B));}
+int main(){
+CASE(0)
+	int N = 3; 
+	int A_[] = {0,1};
+	  vector <int> A(A_, A_+sizeof(A_)/sizeof(*A_)); 
+	int B_[] = {1,2};
+	  vector <int> B(B_, B_+sizeof(B_)/sizeof(*B_)); 
+	int _ = 1; 
+END
+CASE(1)
+	int N = 4; 
+	int A_[] = {0,1,0,2};
+	  vector <int> A(A_, A_+sizeof(A_)/sizeof(*A_)); 
+	int B_[] = {1,3,2,3};
+	  vector <int> B(B_, B_+sizeof(B_)/sizeof(*B_)); 
+	int _ = 10; 
+END
+CASE(2)
+	int N = 3; 
+	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 _ = 0; 
+END
+CASE(3)
+	int N = 5; 
+	vector <int> A; 
+	vector <int> B; 
+	int _ = 0; 
+END
+CASE(4)
+	int N = 6; 
+	int A_[] = {1,1,2,0,4,3,0,1,4};
+	  vector <int> A(A_, A_+sizeof(A_)/sizeof(*A_)); 
+	int B_[] = {3,2,3,1,5,5,2,4,3};
+	  vector <int> B(B_, B_+sizeof(B_)/sizeof(*B_)); 
+	int _ = 39; 
+END
+/*
+CASE(5)
+	int N = ; 
+	int A_[] = ;
+	  vector <int> A(A_, A_+sizeof(A_)/sizeof(*A_)); 
+	int B_[] = ;
+	  vector <int> B(B_, B_+sizeof(B_)/sizeof(*B_)); 
+	int _ = ; 
+END
+CASE(6)
+	int N = ; 
+	int A_[] = ;
+	  vector <int> A(A_, A_+sizeof(A_)/sizeof(*A_)); 
+	int B_[] = ;
+	  vector <int> B(B_, B_+sizeof(B_)/sizeof(*B_)); 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/632-U/1C-U.cpp
Index: SRM/632-U/1C-U.cpp
==================================================================
--- SRM/632-U/1C-U.cpp
+++ SRM/632-U/1C-U.cpp
@@ -0,0 +1,119 @@
+#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;
+
+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; }
+
+class PatternLock { public:
+	int solve(int N, int MOD)
+	{
+		MODVAL = MOD;
+		memo.resize(N+1, vector<int>(N+1, -1));
+		return (rec(N,N)*2) % MOD;
+	}
+
+	vector<vector<int>> memo;
+	int rec(int A, int B)
+	{
+		if(memo[A][B] != -1)
+			return memo[A][B];
+		mint total;
+		for(int a=0; a<A; ++a)
+			total += rec(A, B, a);
+		return memo[A][B] = total.val;
+	}
+	int rec(int A, int B, int a)
+	{
+		if(A==1 && B==0)
+			return 1;
+
+		mint total;
+		if(B) total += rec(B, A-1);
+		if(a>0) total += rec(A-1, B, a-1);
+		if(a!=A-1) total += rec(A-1, B, a);
+		return total.val;
+	}
+};
+
+// 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(_, PatternLock().solve(N, MOD));}
+int main(){
+/*
+CASE(0)
+	int N = 1; 
+	int MOD = 12345667; 
+	int _ = 2; 
+END
+*/
+CASE(1)
+	int N = 2; 
+	int MOD = 324124124; 
+	int _ = 24; 
+END
+CASE(2)
+	int N = 3; 
+	int MOD = 5325352; 
+	int _ = 504; 
+END
+CASE(3)
+	int N = 500; 
+	int MOD = 1000000007; 
+	int _ = 286169049; 
+END
+/*
+CASE(4)
+	int N = ; 
+	int MOD = ; 
+	int _ = ; 
+END
+CASE(5)
+	int N = ; 
+	int MOD = ; 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE