Submission #1099741

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  vvi b(n, vi(m));
  rep (i, n) {
    char tmp;
    rep (j, m) {
      scanf(" %c", &tmp);
      b[i][j] = tmp - '0';
    }
  }
  vvi a(n, vi(m, 0));
  rep (i, n-2) {
    rep (j, m) {
      int append = b[i][j];
      if (append == 0) {
        continue;
      }
      a[i+1][j] += append;
      b[i][j] -= append;
      b[i+1][j-1] -= append;
      b[i+1][j+1] -= append;
      b[i+2][j] -= append;
    }
  }
  rep (i, n) {
    rep (j, m) {
      printf("%d", a[i][j]);
    }
    printf("\n");
  }

  return 0;
}

Submission Info

Judge Result