member srm 471 div2 500 (dp)

Problem Statement
   
Elly is great fan of consistency. She would like to have order in even the simplest things in life – like listening to music.  She has chosen several songs from which she wants to compose a playlist. The names of these songs are given in vector <string> songs, where each element is the name of a single song. Each name is unique and consists of at least three lowercase Latin letters.  A playlist is a sequence containing exactly K song names from songs. Each song from songs can be included zero, one or more times into a playlist. For each song in her playlist (except the last one), Elly wants the transition from this song to the next one in the playlist to be smooth. She calls transition from one song to another smooth if the substring formed by the first three letters of the name of the new song is the same as the substring formed by the last three letters from the name of the previous song. For example valid smooth transitions are from "xxxabc" to "abcyyy", from "entersandman" to "maneater", or from "heavensalie" to "liebe". On the other hand invalid transitions are from "yyydefg" to "defgyyy", from "toxicity" to "citylights", from "fadetoblack" to "breakingthehabit", from "hello" to "lol" or from "abbccddd" to "bcda".  Elly wonders how many different playlists with exactly K songs she can make from the given songs, while respecting her wish to have smooth transition between each two consecutive ones. Since this number can be quite large, return its remainder when divided by 1,000,000,007. Two playlists are considered different if there is an index i such that the i-th songs in these playlists are different.
Definition
   
Class:
EllysPlaylists
Method:
countPlaylists
Parameters:
vector <string>, int
Returns:
int
Method signature:
int countPlaylists(vector <string> songs, int K)
(be sure your method is public)
   

Constraints
-
K will be between 1 and 1000, inclusive.
-
songs will contain between 1 and 50 elements, inclusive.
-
Each element of songs will contain between 3 and 20 characters, inclusive.
-
Each element of songs will consist of lowercase Latin letters ('a'-'z') only.
-
All elements of songs will be distinct.
Examples
0)

   
{ "abcxxx", "xxxabc", "entersandman", "toxicity", "maneater", "heavensalie",
  "liebe", "citylights", "fadetoblack", "breakingthehabit", "yyydefg", "defgyyy" }
2
Returns: 5
The possible pairs are {"abcxxx", "xxxabc"}, {"xxxabc", "abcxxx"}, {"entersandman", "maneater"}, {"heavensalie", "liebe"}, and {"defgyyy", "yyydefg"}. Note that the order of the songs is important.
1)

   
{ "aaaaaa", "aaabcd", "bcdaaa" }
4
Returns: 13
One song can be used more than once in a playlist.
2)

   
{ "aaa", "aaaa", "aaaaa" }
3
Returns: 27
Aaaaaaa...
3)

   
{ "elly", "looks", "lovely" }
1
Returns: 3
Each song is a valid playlist.
4)

   
{ "life", "universe", "everything" }
42
Returns: 0
No valid sequence of 42 songs exists.
5)

   
{ "aaaaaaaaa", "aaabbbaaa", "aaacccaaa", "aaadddaaa", "aaaeeeaaa", "aaafffaaa" }
12
Returns: 176782322
The answer can be quite large, so don't forget to return only its remainder.
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.

 

一个不难的dp，当时根本没往dp上想……

记录以每一个字符串结束的次数。

morefreeze大牛代码精练，佩服……

 

#include <vector> #include <list> #include <map> #include <set> #include <deque> #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 <cstring> using namespace std; class EllysPlaylists { public: int countPlaylists(vector <string>, int); }; int EllysPlaylists::countPlaylists(vector <string> s, int K) { int f[50][1010]; int n = s.size(); memset(f, 0, sizeof(f)); for (int i=0; i < n; i++) f[i][1] = 1; for (int i=2; i <= K; i++) for (int j=0; j < n; j++) for (int k=0; k < n; k++) if (s[j].substr(0, 3) == s[k].substr(s[k].size()-3)) f[j][i] = (f[j][i] + f[k][i-1]) % 1000000007; int res = 0; for (int i=0; i < n; i++) res = (res +f[i][K]) % 1000000007; return res; } //Powered by [KawigiEdit] 2.0!