oj.uz

Submission #586734

# Submission time Handle Problem Language Result Execution time Memory
586734 2022-06-30T15:25:20 Z nguyen31hoang08minh2003 Bold (COCI21_bold) C++14
50 / 50
 0 ms 212 KB 
/*
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
|  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |  /\  |
| /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ | /  \ |
|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|
| \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / | \  / |
|  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |  \/  |
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (int i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (int i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (int i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;

template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};

typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

#define maxN 105
#define maxM 105
const short directions[4][2] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}};

int n, m;
string picture[maxN];

int main() {
    #ifdef LOCAL
        freopen("input.INP", "r", stdin);
    #endif // LOCAL
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    cin >> n >> m;
    fore(i, 0, n)
        cin >> picture[i];
    ford(x, n - 2, 0)
        ford(y, m - 2, 0)
            if (picture[x][y] == '#') {
                fort(dx, 0, 1)
                    fort(dy, 0, 1)
                        picture[dx + x][dy + y] = '#';
            }
    fore(i, 0, n)
        cout << picture[i] << '\n';
    return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct