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 PrefixTree { public: 4fd800b3a8 2011-02-23 kinaba: static vector<int> wordToFreq( const string& word ) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: vector<int> freq(26); 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<word.size(); ++i) 4fd800b3a8 2011-02-23 kinaba: freq[word[i]-'a']++; 4fd800b3a8 2011-02-23 kinaba: return freq; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: static vector< vector<int> > wordsToFreqs( const vector<string>& words ) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: vector< vector<int> > freqs; 4fd800b3a8 2011-02-23 kinaba: transform(words.begin(), words.end(), back_inserter(freqs), &wordToFreq); 4fd800b3a8 2011-02-23 kinaba: return freqs; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: static int commonPrefix(const vector< vector<int> >& freqs, int s) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: vector<int> common; 4fd800b3a8 2011-02-23 kinaba: for(int first=1,i=0; (1<<i)<=s; ++i) 4fd800b3a8 2011-02-23 kinaba: if( s & (1<<i) ) 4fd800b3a8 2011-02-23 kinaba: if( first ) { 4fd800b3a8 2011-02-23 kinaba: common = freqs[i]; 4fd800b3a8 2011-02-23 kinaba: first = 0; 4fd800b3a8 2011-02-23 kinaba: } else { 4fd800b3a8 2011-02-23 kinaba: for(int k=0; k<26; ++k) 4fd800b3a8 2011-02-23 kinaba: common[k] = min(common[k], freqs[i][k]); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: return accumulate(common.begin(), common.end(), 0); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: int getNumNodes(vector<string> words) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: const int N = words.size(); 4fd800b3a8 2011-02-23 kinaba: const vector< vector<int> >& freqs = wordsToFreqs(words); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: vector<int> dp(1<<N); 4fd800b3a8 2011-02-23 kinaba: for(int s=1; s<(1<<N); ++s) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: dp[s] = 1; 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<N; ++i) 4fd800b3a8 2011-02-23 kinaba: if( s & (1<<i) ) 4fd800b3a8 2011-02-23 kinaba: dp[s] += words[i].size(); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: int cp = commonPrefix(freqs, s); 4fd800b3a8 2011-02-23 kinaba: for(int ss=s-1; ss&=s; --ss) 4fd800b3a8 2011-02-23 kinaba: dp[s] = min(dp[s], dp[ss]+dp[s&~ss]-cp-1); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: return dp[(1<<N)-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(_, PrefixTree().getNumNodes(words));} 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 words_[] = {"topcoder"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> words(words_, words_+sizeof(words_)/sizeof(*words_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 9; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: string words_[] = {"topcoder","topcoder"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> words(words_, words_+sizeof(words_)/sizeof(*words_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 9; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: string words_[] = {"aab","ca"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> words(words_, words_+sizeof(words_)/sizeof(*words_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 5; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(3) 4fd800b3a8 2011-02-23 kinaba: string words_[] = {"aab","ca","ba"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> words(words_, words_+sizeof(words_)/sizeof(*words_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 5; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: string words_[] = {"ab","cd","ef"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> words(words_, words_+sizeof(words_)/sizeof(*words_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 7; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(5) 4fd800b3a8 2011-02-23 kinaba: string words_[] = {"a","aa","aaa"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> words(words_, words_+sizeof(words_)/sizeof(*words_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 4; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: /* 4fd800b3a8 2011-02-23 kinaba: CASE(6) 4fd800b3a8 2011-02-23 kinaba: string words_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <string> words(words_, words_+sizeof(words_)/sizeof(*words_)); 4fd800b3a8 2011-02-23 kinaba: int _ = ; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(7) 4fd800b3a8 2011-02-23 kinaba: string words_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <string> words(words_, words_+sizeof(words_)/sizeof(*words_)); 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