Submission #1777613

---

Source Code Expand

#include<iostream>

using namespace std;
typedef long long ll;

const ll MOD = 1000000007;

int H, W;
ll dp[1000][1000];
ll in[1000][1000];
const int vx[4] = { 0,-1,0,1 };
const int vy[4] = { 1,0,-1,0 };

ll f(int a, int b) {

	if (dp[a][b] != 0)return dp[a][b];

	ll ans1 = 0;
	for (int i = 0; i < 4; i++) {
		int nx = a + vx[i], ny = b + vy[i];
		if (nx < 0 || ny < 0 || nx >= H || ny >= W)continue;
		if (in[a][b] < in[nx][ny])ans1 += f(nx, ny);
	}
	return dp[a][b] = (ans1 + 1) % MOD;
}

int main() {
	cin >> H >> W;

	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			cin >> in[i][j];
		}
	}

	ll ans = 0;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {

			ans += f(i, j);
			ans %= MOD;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result