제출 #1132911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1132911		DangKhoizzzz	Bold (COCI21_bold)	C++20	50 / 50	0 ms	328 KiB

bold

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pii pair <int , int>
#define ar3 array <int , 3>

using namespace std;

const int INF = 1e9 + 7;
const int maxn = 2e5 + 7;


int n , m;
char c[105][105] , a[105][105];

void solve()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            cin >> c[i][j];
            a[i][j] = '.';
        }
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            if(c[i][j] == '#')
            {
                a[i][j] = a[i+1][j] = a[i+1][j+1] = a[i][j+1] = '#';
            }
        }
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++) cout << a[i][j];
        cout << '\n';
    }
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();
    return 0;
}

• Subtask 1: 50 / 50