# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
620001 |
2022-08-02T18:30:03 Z |
Toqa44 |
Bold (COCI21_bold) |
C++17 |
|
1 ms |
212 KB |
#include <bits/stdc++.h>
#define endl "\n"
typedef long long ll;
using namespace std;
ll n , m ;
bool f[109][109] ;
char a[109][109];
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m ;
for(int i = 0 ; i < n ; i++)
{
for(int j = 0 ; j < m ; j++)
{
cin >> a[i][j] ;
}
}
for(int i = 0 ; i < n ; i++)
{
for(int j = 0 ; j < m ; j++)
{
if(a[i][j] == '#' && f[i][j] != 1)
{
f[i][j] = 1 ;
if(a[i][j+1] != '#')
{
a[i][j+1] = '#' ;
f[i][j+1] = 1 ;
}
if(a[i+1][j+1] != '#')
{
a[i+1][j+1] = '#' ;
f[i+1][j+1] = 1 ;
}
if(a[i+1][j] != '#')
{
a[i+1][j] = '#' ;
f[i+1][j] = 1 ;
}
}
}
}
for(int i = 0 ; i < n ; i++)
{
for(int j = 0 ; j < m ; j++)
{
cout << a[i][j] ;
}
cout << endl ;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |