4fd800b3a8 2011-02-23        kinaba: #include <iostream>
4fd800b3a8 2011-02-23        kinaba: #include <sstream>
4fd800b3a8 2011-02-23        kinaba: #include <iomanip>
4fd800b3a8 2011-02-23        kinaba: #include <vector>
4fd800b3a8 2011-02-23        kinaba: #include <string>
4fd800b3a8 2011-02-23        kinaba: #include <map>
4fd800b3a8 2011-02-23        kinaba: #include <set>
4fd800b3a8 2011-02-23        kinaba: #include <algorithm>
4fd800b3a8 2011-02-23        kinaba: #include <numeric>
4fd800b3a8 2011-02-23        kinaba: #include <iterator>
4fd800b3a8 2011-02-23        kinaba: #include <functional>
4fd800b3a8 2011-02-23        kinaba: #include <complex>
4fd800b3a8 2011-02-23        kinaba: #include <queue>
4fd800b3a8 2011-02-23        kinaba: #include <stack>
4fd800b3a8 2011-02-23        kinaba: #include <cmath>
4fd800b3a8 2011-02-23        kinaba: #include <cassert>
4fd800b3a8 2011-02-23        kinaba: #include <cstring>
4fd800b3a8 2011-02-23        kinaba: using namespace std;
4fd800b3a8 2011-02-23        kinaba: typedef long long LL;
4fd800b3a8 2011-02-23        kinaba: typedef complex<double> CMP;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class LadderPermutation { public:
4fd800b3a8 2011-02-23        kinaba: 	vector <int> createLadder(int n, int m, int k)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		try {
4fd800b3a8 2011-02-23        kinaba: 			vector<int> v = gen(n-k, m-1, k);
4fd800b3a8 2011-02-23        kinaba: 			for(int i=0; i<k; ++i)
4fd800b3a8 2011-02-23        kinaba: 				v.push_back(n-i);
4fd800b3a8 2011-02-23        kinaba: 			return v;
4fd800b3a8 2011-02-23        kinaba: 		} catch(...) {
4fd800b3a8 2011-02-23        kinaba: 			return vector<int>();
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	vector<int> gen(int n, int m, int k) // make m blocks of length <=k
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		if( m==0 ) {
4fd800b3a8 2011-02-23        kinaba: 			if( n==0 )
4fd800b3a8 2011-02-23        kinaba: 				return vector<int>();
4fd800b3a8 2011-02-23        kinaba: 			throw "fail";
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		int x = min(k, n-(m-1));
4fd800b3a8 2011-02-23        kinaba: 		if( x <= 0 )
4fd800b3a8 2011-02-23        kinaba: 			throw "fail";
4fd800b3a8 2011-02-23        kinaba: 		vector<int> v = gen(n-x, m-1, k);
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<x; ++i)
4fd800b3a8 2011-02-23        kinaba: 			v.push_back(n-i);
4fd800b3a8 2011-02-23        kinaba: 		return v;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: };
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: // BEGIN CUT HERE
4fd800b3a8 2011-02-23        kinaba: #include <ctime>
4fd800b3a8 2011-02-23        kinaba: double start_time; string timer()
4fd800b3a8 2011-02-23        kinaba:  { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
4fd800b3a8 2011-02-23        kinaba: template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
4fd800b3a8 2011-02-23        kinaba:  { os << "{ ";
4fd800b3a8 2011-02-23        kinaba:    for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
4fd800b3a8 2011-02-23        kinaba:    os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
4fd800b3a8 2011-02-23        kinaba: void verify_case(const vector <int>& Expected, const vector <int>& Received) {
4fd800b3a8 2011-02-23        kinaba:  bool ok = (Expected == Received);
4fd800b3a8 2011-02-23        kinaba:  if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
4fd800b3a8 2011-02-23        kinaba:  cerr << "\to: " << Expected << endl << "\tx: " << Received << endl; } }
4fd800b3a8 2011-02-23        kinaba: #define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
4fd800b3a8 2011-02-23        kinaba: #define END	 verify_case(_, LadderPermutation().createLadder(n, m, k));}
4fd800b3a8 2011-02-23        kinaba: int main(){
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: CASE(0)
4fd800b3a8 2011-02-23        kinaba: 	int n = 4;
4fd800b3a8 2011-02-23        kinaba: 	int m = 2;
4fd800b3a8 2011-02-23        kinaba: 	int k = 2;
4fd800b3a8 2011-02-23        kinaba: 	int __[] = {2, 1, 4, 3 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int n = 3;
4fd800b3a8 2011-02-23        kinaba: 	int m = 2;
4fd800b3a8 2011-02-23        kinaba: 	int k = 2;
4fd800b3a8 2011-02-23        kinaba: 	int __[] = {1, 3, 2 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int n = 2;
4fd800b3a8 2011-02-23        kinaba: 	int m = 1;
4fd800b3a8 2011-02-23        kinaba: 	int k = 1;
4fd800b3a8 2011-02-23        kinaba: 	vector <int> _;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int n = 6;
4fd800b3a8 2011-02-23        kinaba: 	int m = 3;
4fd800b3a8 2011-02-23        kinaba: 	int k = 2;
4fd800b3a8 2011-02-23        kinaba: 	int __[] = {2, 1, 4, 3, 6, 5 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int n = 6;
4fd800b3a8 2011-02-23        kinaba: 	int m = 2;
4fd800b3a8 2011-02-23        kinaba: 	int k = 3;
4fd800b3a8 2011-02-23        kinaba: 	int __[] = {3, 2, 1, 6, 5, 4 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int n = 7;
4fd800b3a8 2011-02-23        kinaba: 	int m = 4;
4fd800b3a8 2011-02-23        kinaba: 	int k = 4;
4fd800b3a8 2011-02-23        kinaba: 	int __[] = {1, 2, 3, 7, 6, 5, 4 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	int n = ;
4fd800b3a8 2011-02-23        kinaba: 	int m = ;
4fd800b3a8 2011-02-23        kinaba: 	int k = ;
4fd800b3a8 2011-02-23        kinaba: 	int __[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(7)
4fd800b3a8 2011-02-23        kinaba: 	int n = ;
4fd800b3a8 2011-02-23        kinaba: 	int m = ;
4fd800b3a8 2011-02-23        kinaba: 	int k = ;
4fd800b3a8 2011-02-23        kinaba: 	int __[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: */
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE