# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
811472 | tlnk07 | Bold (COCI21_bold) | C++17 | 2 ms | 3412 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long n, m;
string a[100001];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = n - 2; i >= 0; --i) for (int j = m - 2; j >= 0; --j)if (a[i][j] == '#') a[i][j + 1] = a[i + 1][j + 1] = a[i + 1][j] = '#';
for (int i = 0; i < n; ++i) cout << a[i] << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |