SRM 599 DIV2 950
2013-12-06 20:55
357 查看
太弱了。。。。这么简单的题也只能比赛之后写。。。。。
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
roblem Statement | ||||||||||||
Fox Ciel has a list of names on her computer. In this problem, a name is simply a non-empty string of lowercase letters. All names in her list are distinct. One day, when she left her seat, she forgot to lock her computer. Then, Lun the mischievous dog appeared, and randomly shuffled the order of the names in her list. Now, Ciel has to restore the original order of names using her memory. You are given a vector <string> names and an int L. namescontains all names in the shuffled list in the order they appear. L describes Ciel's memory of the original list. She remembers that, for each i between 0 and L-2, inclusive, the i-th (0-indexed) name in the original list was a prefix of the (i+1)-th name. Let X be the number of possible orders of the names in the original list that are consistent with Ciel's memory. Calculate and return the value (X modulo 1,000,000,007). X can be 0, which means Ciel's memory is inconsistent with the names in the list. | ||||||||||||
Definition | ||||||||||||
| ||||||||||||
Notes | ||||||||||||
- | A prefix of a string is the result of erasing zero or more characters from the right end of that string. | |||||||||||
Constraints | ||||||||||||
- | names will contain between 2 and 50 elements, inclusive. | |||||||||||
- | Each element of names will contain between 1 and 50 characters, inclusive. | |||||||||||
- | Each character of each element of names will be a lowercase letter ('a'-'z'). | |||||||||||
- | Elements of names will be distinct. | |||||||||||
- | L will be between 1 and n, inclusive, where n is the number of elements in names. | |||||||||||
Examples | ||||||||||||
0) | ||||||||||||
| ||||||||||||
1) | ||||||||||||
| ||||||||||||
2) | ||||||||||||
| ||||||||||||
3) | ||||||||||||
| ||||||||||||
4) | ||||||||||||
| ||||||||||||
5) | ||||||||||||
|
#include <vector> #include <list> #include <map> #include <set> #include <queue> #include <deque> #include <cstring> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> using namespace std; const int MOD=1000000007; int qianzui[100]; int Com[60][60]; void getCom() { Com[0][0]=1; for(int i=1;i<=50;i++) Com[i][i]=Com[0][i]=1; for(int i=2;i<=50;i++) { for(int j=1;j<i;j++) { Com[j][i]=(Com[j-1][i-1]+Com[j][i-1])%MOD; } } } int getC(int l,int z) { if(l>z) return 0; if(l==0||l==z) return 1; return Com[l][z]; } class SimilarNames2 { public: int count(vector <string> names, int L) { getCom(); int n=names.size(); memset(qianzui,0,sizeof(qianzui)); sort(names.begin(),names.end()); ///预处理前缀 for(int i=1;i<n;i++) { int len2; for(int j=0;j<i;j++) { len2=names[j].size(); if(names[i].substr(0,len2)==names[j]) { qianzui[i]=max(qianzui[j]+1,qianzui[i]); } } } long long int ans=0; for(int i=0;i<n;i++) { ans=(ans+getC(L-1,qianzui[i]))%MOD; } for(int i=2;i<=n-L;i++) { ans=(ans*i)%MOD; } return ans%MOD; } }; ///<%:testing-code%> //Powered by KawigiEdit 2.1.4 (beta) modified by pivanof! // BEGIN KAWIGIEDIT TESTING
相关文章推荐
- [树形DP][状压DP] SRM599 950-point SimilarNames
- SRM 599 DIV 2
- SRM 551 div2 950(DP, 环形+优化)
- TC-SRM-609-DIV2-950- VocaloidsAndSongs
- SRM 531 div1 600/300 div2 950
- SRM 599 div2 250 500
- SRM 599 DIV1
- SRM 542 DIV2 950 StrangeDictionary
- SRM145_DIV2
- TopCoder - SRM521 div1 500 RangeSquaredSubsets
- Topcoder Arena SRM 144 DIV2 1100 point 图遍历(非递归)+动态规划
- Topcoder SRM 641 Div1 250(另辟蹊径,排除法)
- [LP对偶费用流] SRM 676 div1 Farmville
- SRM 615 DIV1 500
- TopCoder——SRM 519 DIV 2
- SRM 397 DIV 2 [250]
- TopCoder 250 points 17-SRM 152 DIV 1 106.51/250 42.60%
- TopCoder 350 points 22-SRM 154 DIV 2 246.20/300 82.07%
- TopCoder SRM 637 Div2 A
- SRM 618 DIV1 500