# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671925 | Kenpar | Bold (COCI21_bold) | C++17 | 22 ms | 49412 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;
#define ll long long
#define endl '\n'
const ll MOD = 1e9+7;
const ll INF = 1e18;
const ll MAX = 2500;
vector<array<ll,3>> edges(MAX);
vector<vector<ll>> dist(MAX, vector<ll>(MAX, INF));
void solve(){
int n,m; cin>>n>>m;
vector<vector<char>> ans(n, vector<char>(m, '.'));
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
char temp; cin>>temp;
if(temp == '#'){
ans[i][j] = '#';
if(i < n-1){
ans[i+1][j] = '#';
}
if(j < m-1){
ans[i][j+1] = '#';
}
if(i < n-1 && j < m-1){
ans[i+1][j+1] = '#';
}
}
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j< m; j++){
cout<<ans[i][j];
}
cout<<endl;
}
}
int main()
{
cin.tie(NULL);
ios::sync_with_stdio(NULL);
int t = 1;
//cin>>t;
int temp = t;
while(t--){
//cout<<"Case #"<<temp - t<<" > "<<endl;
solve();
cout<<endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |