# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492763 | inksamurai | Bold (COCI21_bold) | C++17 | 1 ms | 332 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>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3cSpNGp ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
int main(){
_3cSpNGp;
int h,w;
cin>>h>>w;
vec(vec(char)) a(h,vec(char)(w));
rep(i,h)rep(j,w){
cin>>a[i][j];
}
vec(vec(char)) nea=a;
rep(i,h)rep(j,w){
if(a[i][j]=='#'){
if(i+1<h) nea[i+1][j]='#';
if(j+1<w) nea[i][j+1]='#';
if(i+1<h and j+1<w) nea[i+1][j+1]='#';
}
}
swap(a,nea);
rep(i,h){
rep(j,w) cout<<a[i][j];
cout<<"\n";
}
//
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |