Codeforces 455B

题目链接

B. A Lot of Games

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Andrew, Fedor and Alex are inventive guys. Now they invent the game with strings for two players.

Given a group of n non-empty strings. During the game two players build the word together, initially the word is empty. The players move in turns. On his step player must add a single letter in the end of the word, the resulting word must be prefix of at least one string from the group. A player loses if he cannot move.

Andrew and Alex decided to play this game k times. The player who is the loser of the i-th game makes the first move in the (i + 1)-th game. Guys decided that the winner of all games is the player who wins the last (k-th) game. Andrew and Alex already started the game. Fedor wants to know who wins the game if both players will play optimally. Help him.

Input

The first line contains two integers, n and k (1 ≤ n ≤ 105; 1 ≤ k ≤ 109).

Each of the next n lines contains a single non-empty string from the given group. The total length of all strings from the group doesn't exceed 105. Each string of the group consists only of lowercase English letters.

Output

If the player who moves first wins, print "First", otherwise print "Second" (without the quotes).

Sample test(s)

input

2 3
a
b

output

First

input

3 1
a
b
c

output

First

input

1 2
ab

output

Second

Trie树存储字符串，我们需要保存到达某个结点时是否必胜或者是否存在必败态。
win[u]表示在结点u是否必胜， lose[u]表示在结点u是否存在必败态。
Accepted Code:

 /*************************************************************************
     > File Name: D.cpp
     > Author: Stomach_ache
     > Mail: sudaweitong@gmail.com
     > Created Time: 2014年08月13日 星期三 14时10分37秒
     > Propose:
  ************************************************************************/

 #include <cmath>
 #include <string>
 #include <cstdio>
 #include <fstream>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;
 /*Let's fight!!!*/

 const int maxn = ;
 int ch[maxn][];

 struct Trie {
     int sz;
     Trie() {
           memset(ch[], , sizeof(ch[]));
         sz = ;
     }
     void insert(char *s);
     void dfs(int u);
 };

 inline void Trie::insert(char *s) {
       int u = , n = (int)strlen(s);
     for (int i = ; i < n; i++) {
           int id = s[i] - 'a';
         if (!ch[u][id]) {
               memset(ch[sz], , sizeof(ch[sz]));
               ch[u][id] = sz++;
         }
         u = ch[u][id];
     }
 }

 bool win[maxn], lose[maxn];
 inline void Trie::dfs(int u) {
       bool flag = false;
       for (int i = ; i < ; i++) if (ch[u][i]) {
           flag = true;
           int v = ch[u][i];
           dfs(v);
         if (!win[v]) win[u] = true;
         if (!lose[v]) lose[u] = true;
     }
     if (!flag) lose[u] = true;
 }

 char str[maxn];
 int main(void) {
       int n, k;
     Trie A;
     scanf("%d %d", &n, &k);
     while (n--) scanf("%s", str), A.insert(str);
     memset(win, false, sizeof(win));
     memset(lose, false, sizeof(lose));
     A.dfs();
     if ((win[] && lose[]) || (win[] && k&)) puts("First");
     else puts("Second");

     return ;
 }