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 SnowPlow { public:
4fd800b3a8 2011-02-23        kinaba: 	int solve(vector <string> roads)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int N = roads.size();
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		set< pair<int,int> > edges;
4fd800b3a8 2011-02-23        kinaba: 		int sum = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i)
4fd800b3a8 2011-02-23        kinaba: 			for(int j=i+1; j<N; ++j)
4fd800b3a8 2011-02-23        kinaba: 				if( roads[i][j] > '0' ) {
4fd800b3a8 2011-02-23        kinaba: 					edges.insert( make_pair(i,j) );
4fd800b3a8 2011-02-23        kinaba: 					sum += 2*(roads[i][j]-'0');
4fd800b3a8 2011-02-23        kinaba: 				}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		set<int> vis;
4fd800b3a8 2011-02-23        kinaba: 		queue<int> q; q.push(0);
4fd800b3a8 2011-02-23        kinaba: 		while( !q.empty() ) {
4fd800b3a8 2011-02-23        kinaba: 			int v = q.front();
4fd800b3a8 2011-02-23        kinaba: 			q.pop();
4fd800b3a8 2011-02-23        kinaba: 			for(int j=0; j<N; ++j) if( j!=v )
4fd800b3a8 2011-02-23        kinaba: 				if( roads[v][j]>'0' ) {
4fd800b3a8 2011-02-23        kinaba: 					edges.erase( make_pair(min(j,v), max(j,v)) );
4fd800b3a8 2011-02-23        kinaba: 					if( !vis.count(j) ) {
4fd800b3a8 2011-02-23        kinaba: 						q.push(j);
4fd800b3a8 2011-02-23        kinaba: 						vis.insert(j);
4fd800b3a8 2011-02-23        kinaba: 					}
4fd800b3a8 2011-02-23        kinaba: 				}
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return edges.empty() ? sum : -1;
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(_, SnowPlow().solve(roads));}
4fd800b3a8 2011-02-23        kinaba: int main(){
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: CASE(0)
4fd800b3a8 2011-02-23        kinaba: 	string roads_[] = {"010000",
4fd800b3a8 2011-02-23        kinaba:  "101000",
4fd800b3a8 2011-02-23        kinaba:  "010100",
4fd800b3a8 2011-02-23        kinaba:  "001010",
4fd800b3a8 2011-02-23        kinaba:  "000101",
4fd800b3a8 2011-02-23        kinaba:  "000010"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> roads(roads_, roads_+sizeof(roads_)/sizeof(*roads_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 10;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	string roads_[] = {"010000",
4fd800b3a8 2011-02-23        kinaba:  "101000",
4fd800b3a8 2011-02-23        kinaba:  "010100",
4fd800b3a8 2011-02-23        kinaba:  "001020",
4fd800b3a8 2011-02-23        kinaba:  "000201",
4fd800b3a8 2011-02-23        kinaba:  "000010"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> roads(roads_, roads_+sizeof(roads_)/sizeof(*roads_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 12;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	string roads_[] = {"031415",
4fd800b3a8 2011-02-23        kinaba:  "300000",
4fd800b3a8 2011-02-23        kinaba:  "100000",
4fd800b3a8 2011-02-23        kinaba:  "400000",
4fd800b3a8 2011-02-23        kinaba:  "100000",
4fd800b3a8 2011-02-23        kinaba:  "500000"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> roads(roads_, roads_+sizeof(roads_)/sizeof(*roads_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 28;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	string roads_[] = {"0100",
4fd800b3a8 2011-02-23        kinaba:  "1000",
4fd800b3a8 2011-02-23        kinaba:  "0001",
4fd800b3a8 2011-02-23        kinaba:  "0010"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> roads(roads_, roads_+sizeof(roads_)/sizeof(*roads_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	string roads_[] = {"0101",
4fd800b3a8 2011-02-23        kinaba:  "1001",
4fd800b3a8 2011-02-23        kinaba:  "0000",
4fd800b3a8 2011-02-23        kinaba:  "1100"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> roads(roads_, roads_+sizeof(roads_)/sizeof(*roads_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 6;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	string roads_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> roads(roads_, roads_+sizeof(roads_)/sizeof(*roads_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	string roads_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> roads(roads_, roads_+sizeof(roads_)/sizeof(*roads_));
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