Submission #3705268

---

Source Code Expand

#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue

using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
string a[503], b[503];

int main(int argc, char const* argv[])
{
  int n, m;
  cin >> n >> m;
  for(int i = 0; i < n + 2; i++){
    cin >> b[i];
    a[i] = string(m, '0');
  }
  for(int i = 0; i < n; i++){
    for(int j = 1; j < m - 1; j++){
      if(b[i][j] != '0'){
        a[i + 1][j] = b[i][j];
        b[i + 1][j - 1] = char(int(b[i + 1][j - 1] - '0') - int(b[i][j] - '0') + '0');
        b[i + 1][j + 1] = char(int(b[i + 1][j + 1] - '0') - int(b[i][j] - '0') + '0');
        b[i + 2][j] = char(int(b[i + 2][j] - '0') - int(b[i][j] - '0') + '0');
        b[i][j] = '0';
      }
    }
  }
  for(int i = 0; i < n; i++){
    cout << a[i] << endl;
  }
	return 0;
}

Submission Info

Judge Result