oj.uz

Submission #386864

# Submission time Handle Problem Language Result Execution time Memory
386864 2021-04-07T14:07:46 Z phathnv Bold (COCI21_bold) C++11
50 / 50
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 107;

int m, n;
char a[N][N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

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

    return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct