fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-05-25 12:24:22
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-05-25 13:34:28
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e18
  46. #define name "hanoi"
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = (int)1e3+10;
  54. int n,m,k;
  55. char a[N][N];
  56. int dx[] = {1,0,-1,0},
  57. 	dy[] = {0,1,0,-1};
  58.  
  59. namespace hungeazy {
  60.  
  61. 	bool check[N][N],ok;
  62. 	int cnt;
  63.  
  64. 	bool checkOutline(int x, int y) {
  65. 		return (x >= 1 and x <= n and y >= 1 and y <= m);
  66. 	}
  67.  
  68. 	void BFS(ii p)
  69. 	{
  70. 		queue<ii> q;
  71. 		q.push(p);
  72. 		while (!q.empty())
  73. 		{
  74. 			int u,v;
  75. 			tie(u,v) = q.front();
  76. 			q.pop();
  77. 			cnt++;
  78. 			check[p.fi][p.se] = true;
  79. 			FOR(s,0,3)
  80. 			{
  81. 				int x = dx[s]+u, y = dy[s]+v;
  82. 				if (!checkOutline(x,y)) ok = false;
  83. 				else 
  84. 				{
  85. 					if (!check[x][y])
  86. 					{
  87. 						check[x][y] = true;
  88. 						q.push({x,y});
  89. 					}
  90. 				}
  91. 			}
  92. 		}
  93. 	}
  94.  
  95. 	void DFS(int u, int v)
  96. 	{
  97. 		check[u][v] = true;
  98. 		a[u][v] = '#';
  99. 		cnt++;
  100. 		FOR(s,0,3)
  101. 		{
  102. 			int x = dx[s]+u, y = dy[s]+v;
  103. 			if (checkOutline(x,y) and !check[x][y]) 
  104. 				DFS(x,y);
  105. 		}
  106. 	}
  107.  
  108. 	void solve(void)
  109. 	{
  110. 		FOR(i,1,n)
  111. 			FOR(j,1,m)
  112. 				if (a[i][j] == '#') check[i][j] = true;
  113. 		vector<iii> vec;
  114. 		FOR(i,1,n)
  115. 			FOR(j,1,m)
  116. 				if (!check[i][j])
  117. 				{
  118. 					cnt = 0; ok = true;
  119. 					BFS({i,j});
  120. 					if (ok) vec.pb({cnt,{i,j}});
  121. 				}
  122. 		FOR(i,1,n)
  123. 			FOR(j,1,m)
  124. 				if (a[i][j] == '.') check[i][j] = false;
  125. 		cnt = 0;
  126. 		if (!vec.empty() and (int)sz(vec)-k-1 >= 0)
  127. 		{
  128. 			sort(all(vec));
  129. 			FOR(i,0,sz(vec)-k-1)
  130. 			{
  131. 				int u,v;
  132. 				tie(u,v) = vec[i].se;
  133. 				// cout << u << " " << v << endl;
  134. 				DFS(u,v);
  135. 			}
  136. 		}
  137. 		cout << cnt << endl;
  138. 		FOR(i,1,n)
  139. 		{
  140. 			FOR(j,1,m) cout << a[i][j];
  141. 			cout << endl;
  142. 		}
  143. 	}
  144.  
  145. }
  146.  
  147. bool M2;
  148. signed main()
  149. {
  150.     fast;
  151.     if (fopen(name".inp","r"))
  152.     {
  153.     	freopen(name".inp","r",stdin);
  154.     	freopen(name".out","w",stdout);
  155.     }
  156.     cin >> n >> m >> k;
  157.     FOR(i,1,n)
  158.     	FOR(j,1,m) cin >> a[i][j];
  159.     hungeazy::solve();
  160.     time();
  161.     memory();
  162.     return 0;
  163. }
  164. // ██░ ██  █    ██  ███▄    █   ▄████
  165. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  166. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  167. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  168. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  169. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  170. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  171. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  172. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0
stderr
copy 
-------------Time:5.055ms.
1.94577 MB
https://ideone.com/O9gX15
language:
C++14 (gcc 8.3)
created:
9 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!