제출 #1171538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171538		nuutsnoynton	Bob (COCI14_bob)	C++20	24 / 120	266 ms	16032 KiB

bob

#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const ll N = 1e3 + 2;
ll a[N][N] = {0}, dp[N][N] = {0};
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];
		}
	}
//	cout << "\n";
	for (i = 1; i <= n; i ++) {
		for (j = 1; 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]) {
					r = j;
					while (r >= 1 && a[i][r] == a[i][j]) r--;
					dp[i][j] = j - r ;
					
				}
				if ( a[i - 1][j] == a[i][j]) {
					r = i;
					while (r >= 1 && a[r][j] == a[i][j]) r--;
					dp[i][j] = i- r;
				}
				
			}
		}
	}
	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: 12 / 12
• Subtask 2: 12 / 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