Submission #1171534

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171534		nuutsnoynton	Bob (COCI14_bob)	C++20	0 / 120	241 ms	16068 KiB

bob

#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const ll N = 1e3 + 2;
ll a[N][N], dp[N][N];
int main() {
	ll n, m, r, x, y, lo1, hi1, cnt, s, i, j, ans, t;

	cin >> n >> m;
	
	
	for (i = 1; i <= n; i ++) {
		for (j = 1; j <= m; j ++) {
			cin >> a[i][j];
		}
	}
	dp[1][1] = 1;
	for (i = 2; i <= n; i ++) {
		if ( a[i][1] == a[i - 1][1]) dp[i][1] = dp[i - 1][1] + 1;
		else dp[i][1] = 1;
	}
	for (j = 2; j <= m; j ++) {
		if ( a[1][j] == a[1][j - 1]) dp[1][j] = dp[1][j - 1] + 1;
		else dp[1][j] = 1;
	}
//	cout << "\n";
	for (i = 2; i <= n; i ++) {
		for (j = 2; j <= m; j ++) {
			dp[i][j] = 1;
			if ( a[i][j - 1] == a[i][j] && a[i][j] == a[i - 1][j]) {
				dp[i][j] += dp[i][j - 1] + dp[i - 1][j];
				if ( a[i - 1][j - 1] == a[i][j]) dp[i][j] -= (dp[i - 1][j - 1] );
			}
			else {
				if ( a[i][j - 1] == a[i][j]) {
					dp[i][j] += dp[i][j- 1];
					if ( a[i - 1][j - 1] == a[i][j]) dp[i][j] -= (dp[i - 1][j - 1] );
				}
				if ( a[i - 1][j] == a[i][j]) {
					dp[i][j] += dp[i - 1][j];
					if ( a[i - 1][j - 1] == a[i][j]) dp[i][j] -= (dp[i - 1][j - 1] );
				}
				
			}
		}
	}
	ans = 0;
	for (i = 1; i <= n; i ++) {
		for (j = 1; j <= m; j ++) {
		//	cout << dp[i][j] << " ";
			ans += dp[i][j];
		}
//		cout << endl;
	}
	cout << ans << endl;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12