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: struct UnionFind
4fd800b3a8 2011-02-23        kinaba: {
4fd800b3a8 2011-02-23        kinaba: 	vector<int> uf, sz;
4fd800b3a8 2011-02-23        kinaba: 	int nc;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	UnionFind(int N): uf(N), sz(N,1), nc(N)
4fd800b3a8 2011-02-23        kinaba: 		{ for(int i=0; i<N; ++i) uf[i] = i; }
4fd800b3a8 2011-02-23        kinaba: 	int size()
4fd800b3a8 2011-02-23        kinaba: 		{ return nc; }
4fd800b3a8 2011-02-23        kinaba: 	int Find(int a)
4fd800b3a8 2011-02-23        kinaba: 		{ return uf[a]==a ? a : uf[a]=Find(uf[a]); }
4fd800b3a8 2011-02-23        kinaba: 	bool Union(int a, int b)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			a = Find(a);
4fd800b3a8 2011-02-23        kinaba: 			b = Find(b);
4fd800b3a8 2011-02-23        kinaba: 			if( a != b )
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				if( sz[a] >= sz[b] ) swap(a, b);
4fd800b3a8 2011-02-23        kinaba: 				uf[a] = b;
4fd800b3a8 2011-02-23        kinaba: 				sz[b] += sz[a];
4fd800b3a8 2011-02-23        kinaba: 				--nc;
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 			return (a!=b);
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: };
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class CrazyLine { public:
4fd800b3a8 2011-02-23        kinaba: 	int maxCrazyness(vector <int> heights)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		typedef pair< int, pair<int,int> > cand;
4fd800b3a8 2011-02-23        kinaba: 		priority_queue<cand> Q;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<heights.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 		for(int j=i+1; j<heights.size(); ++j)
4fd800b3a8 2011-02-23        kinaba: 			Q.push( cand(abs(heights[i]-heights[j]), make_pair(i,j)) );
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		UnionFind uf(heights.size());
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		int score=0;
4fd800b3a8 2011-02-23        kinaba: 		vector<int> used(heights.size());
4fd800b3a8 2011-02-23        kinaba: 		while( uf.size()>1 )
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			int s = Q.top().first;
4fd800b3a8 2011-02-23        kinaba: 			int i = Q.top().second.first;
4fd800b3a8 2011-02-23        kinaba: 			int j = Q.top().second.second;
4fd800b3a8 2011-02-23        kinaba: 			Q.pop();
4fd800b3a8 2011-02-23        kinaba: 			if( used[i]<=1 && used[j]<=1 && uf.Find(i)!=uf.Find(j) )
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				score += s;
4fd800b3a8 2011-02-23        kinaba: 				used[i]++;
4fd800b3a8 2011-02-23        kinaba: 				used[j]++;
4fd800b3a8 2011-02-23        kinaba: 				uf.Union(i,j);
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return score;
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 int& Expected, const 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(_, CrazyLine().maxCrazyness(heights));}
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 heights_[] = {5,10,25,40,25};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 100;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int heights_[] = {2,3,5,7,11,13,17,19};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 82;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int heights_[] = {1,1,1,1,1,1,501};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1000;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int heights_[] = {1000,1000,1000,1000,1000,1000,1000,1000,1000};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int heights_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int heights_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: */
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE