AOJ2272.cpp

#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

int main() {
	int n, m;
	cin >> n >> m;
	vector<vector<int>> semi(n,vector<int>(m));
	REP(i, n){
		string s;
		cin >> s;
		REP(j, m){
			semi[i][j] =s[j]-'0';
		}
	}
	vector<vector<int>> dp(n, vector<int>(m));
	REP(i, n){
		REP(j, m){
			int a=1234;
			int b=1234;
			if (i != 0)a = dp[i - 1][j] + semi[i][j];
			if (j != 0)b = dp[i][j - 1] + semi[i][j];
			dp[i][j] = min(a,b);
			if (!(i | j))dp[0][0] = 0;
		}
	}
	cout << dp[n - 1][m - 1] << endl;
}