1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
#include <iostream>
#include <vector>
#include <stack>
#include <set>
#include <cassert>

using namespace std;


struct t_move {
        int i, j;
        int new_moves;
};

/*
stack<int> st;
priority_queue< t_rect*, vector<t_rect*>, t_rect_cmp > q;
t_rect rect_tab[MAX_COLS];

*/

int n, k;

const int max_size = 3002;

bool tab[max_size][max_size];
bool already_picked[max_size][max_size];
t_move move_source[max_size][max_size];

vector<t_move*> v;

void init_tab()
{
        int i;

        for(i = 0; i <= n+1; ++i) {
                tab[0][i] = 1;
                tab[i][0] = 1;
                tab[n+1][i] = 1;
                tab[i][n+1] = 1;
        }
}

int add_move_if_possible(int i, int j)
{
        if (tab[i][j] == 0 && !already_picked[i][j]) {
                t_move* move = &move_source[i][j];
                v.push_back(move);
                already_picked[i][j] = 1;
                return 1;
        }
        return 0;
}

void find_possible_moves()
{
        int i, j;

        for(i = 1; i <= n; ++i) {
                for(j = 1; j <= n; ++j) {
                        if (tab[i][j]) {
                                add_move_if_possible(i-1, j);
                                add_move_if_possible(i+1, j);
                                add_move_if_possible(i, j-1);
                                add_move_if_possible(i, j+1);
                        }
                }
        }
}


void print_tab()
{
        cout << "  ";
        for(int i = 1; i <= n; ++i) {
                cout << i;
        }
        cout << endl;
        for(int i = 1; i <= n; ++i) {
                if (i < 10) {
                        cout << " ";
                }
                cout << i;
                for(int j = 1; j <= n; ++j) {
                        cout  << tab[i][j];
                }
                cout << endl;
        }
}

void print_possible_moves()
{
        vector<t_move*>::iterator it;
        
        for(it = v.begin(); it != v.end(); it++) {
                cout << "[" << (*it)->i << "," << (*it)->j << "], ";
        }
        cout << endl;
}



void init_move_source()
{
        for(int i = 1; i <= n; ++i) {
                for(int j = 1; j <= n; ++j) {
                        move_source[i][j].i = i;
                        move_source[i][j].j = j;
                }
        }

}

inline int check_move2(int i, int j)
{
        return (!tab[i-1][j] * !already_picked[i-1][j])
             + (!tab[i+1][j] * !already_picked[i+1][j])
             + (!tab[i][j-1] * !already_picked[i][j-1])
             + (!tab[i][j+1] * !already_picked[i][j+1]);
}

long long calc_additional_moves2()
{
        vector<t_move*>::iterator it;
        long long res = 0;
        
        for(it = v.begin(); it != v.end(); it++) {
                res += check_move2((*it)->i, (*it)->j);
//                cout << "move " << (*it)->i << "," << (*it)->j << " - ";
//                cout << check_move2((*it)->i, (*it)->j) << endl;

        }
        return res;
}

int main()
{
        int i, j;

        cin >> n >> k;

        init_tab();
        init_move_source();
        for(i = 1; i <= n; ++i) {
                for(j = 1; j <= n; ++j) {
                        char c;

                        cin >> c;
                        if (c == '#') {
                                tab[i][j] = 1;
                        } else {
                                tab[i][j] = 0;
                        }
                }
        }

        //print_tab();
        find_possible_moves();
        //print_possible_moves();

        if (k == 1) {
                cout << v.size() << endl;
                return 0;
        }

        if (k == 2) {
                cout << (((long long) v.size() * (v.size()-1)/2) + calc_additional_moves2()) % 1000000007 << endl;
//                cout << v.size() * (v.size()-1)/2 << endl;
//                cout << calc_additional_moves2() << endl;
        }

        // k == 3 && k == 4 not implemented ...

        return 0;
}