-
Notifications
You must be signed in to change notification settings - Fork 2
/
c.cpp
64 lines (58 loc) · 1.67 KB
/
c.cpp
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
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
int n, m, k; cin >> n >> m >> k;
string b[n];
int reached = 0;
for(int i = 0; i < n; i++){
cin >> b[i];
for(int j = 0; j < m; j++){
if(b[i][j] == '.'){
b[i][j] = 'X';
reached++;
}
}
}
queue<pii> bfs;
for(int i = 0; i < n * m; i++){
int x = i / m;
int y = i % m;
if(b[x][y] == 'X'){
bfs.push(pii(x, y));
break;
}
}
while(!bfs.empty()){
pii idx = bfs.front();
bfs.pop();
if(idx.f < 0 || idx.f > n-1 || idx.s < 0 || idx.s > m-1 || b[idx.f][idx.s] != 'X'){
continue;
}
if(reached <= k){
break;
}
reached--;
b[idx.f][idx.s] = '.';
bfs.push(pii(idx.f + 1, idx.s));
bfs.push(pii(idx.f - 1, idx.s));
bfs.push(pii(idx.f, idx.s + 1));
bfs.push(pii(idx.f, idx.s - 1));
}
for(int i = 0; i < n; i++){
cout << b[i] << endl;
}
return 0;
}